Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r320-tall-167873970500397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PolyORBNT-COL-S05J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-167873970500397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678871713437

Running Version 202205111006
[2023-03-15 09:15:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:15:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:15:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 09:15:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:15:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2023-03-15 09:15:15] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 21 ms.
[2023-03-15 09:15:15] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 45 ms.
[2023-03-15 09:15:15] [INFO ] Unfolded 38 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:15:15] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 09:15:15] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 09:15:15] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 09:15:16] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-15 09:15:16] [INFO ] Computed 62 place invariants in 49 ms
[2023-03-15 09:15:16] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-15 09:15:16] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:15:16] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:15:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2023-03-15 09:15:16] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:15:16] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:15:16] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:16] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 09:15:16] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 126 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2023-03-15 09:15:17] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-15 09:15:17] [INFO ] Computed 57 place invariants in 12 ms
[2023-03-15 09:15:17] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/349 places, 501/555 transitions.
Incomplete random walk after 1000000 steps, including 52279 resets, run finished after 3895 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7231 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3143428 steps, run timeout after 12001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 3143428 steps, saw 908217 distinct states, run finished after 12003 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:15:34] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-15 09:15:34] [INFO ] Computed 57 place invariants in 14 ms
[2023-03-15 09:15:34] [INFO ] [Real]Absence check using 50 positive place invariants in 74 ms returned sat
[2023-03-15 09:15:34] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 09:15:34] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:15:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-15 09:15:34] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 09:15:35] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:15:35] [INFO ] After 99ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:35] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 09:15:35] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 501/501 transitions.
Applied a total of 0 rules in 27 ms. Remains 290 /290 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 501/501 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 501/501 transitions.
Applied a total of 0 rules in 19 ms. Remains 290 /290 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-15 09:15:35] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-15 09:15:35] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 09:15:35] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-15 09:15:35] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-15 09:15:35] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-15 09:15:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:15:36] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2023-03-15 09:15:36] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-15 09:15:36] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-15 09:15:36] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 09:15:36] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in SAFETY mode, iteration 1 : 290/290 places, 406/501 transitions.
Applied a total of 0 rules in 16 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 09:15:36] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 290/290 places, 406/501 transitions.
Incomplete random walk after 1000000 steps, including 52075 resets, run finished after 2919 ms. (steps per millisecond=342 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7170 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2841972 steps, run timeout after 9001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 2841972 steps, saw 828662 distinct states, run finished after 9001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:15:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:15:49] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 09:15:49] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-15 09:15:49] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:15:49] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:15:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:15:49] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:15:49] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:15:49] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 1 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:15:50] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:15:51] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:15:52] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:15:52] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 1 ms to minimize.
[2023-03-15 09:15:54] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:15:54] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:15:55] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:15:55] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 0 ms to minimize.
[2023-03-15 09:15:55] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:15:56] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 4 ms to minimize.
[2023-03-15 09:15:56] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2023-03-15 09:15:57] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 1 ms to minimize.
[2023-03-15 09:15:58] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2023-03-15 09:15:58] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:16:01] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:16:01] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:16:09] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:16:12] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:16:12] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:16:12] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 1 ms to minimize.
[2023-03-15 09:16:13] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2023-03-15 09:16:13] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:16:13] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:16:13] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:16:13] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2023-03-15 09:16:14] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2023-03-15 09:16:14] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2023-03-15 09:16:15] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2023-03-15 09:16:15] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:16:16] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:16:17] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:16:17] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:16:18] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 7 ms to minimize.
[2023-03-15 09:16:18] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:16:19] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:16:20] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 1 ms to minimize.
[2023-03-15 09:16:21] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:16:22] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 41760 ms
[2023-03-15 09:16:31] [INFO ] After 41884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:16:31] [INFO ] After 42106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 09:16:31] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:16:31] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 09:16:31] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-15 09:16:31] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:16:31] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 09:16:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:32] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-15 09:16:32] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 09:16:32] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:16:32] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 09:16:32] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5234 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:33] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:16:33] [INFO ] Computed 57 place invariants in 13 ms
[2023-03-15 09:16:33] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-15 09:16:33] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:16:33] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:16:33] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 09:16:33] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:33] [INFO ] After 97ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:33] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:16:33] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 4 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 101 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:16:34] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2023-03-15 09:16:35] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:16:38] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:16:38] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:16:38] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:16:39] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:16:39] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:16:39] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:16:39] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:16:40] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:16:41] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:16:41] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:16:44] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:16:45] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:16:53] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:16:53] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 1 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:16:55] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:16:55] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:16:55] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:16:57] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:16:57] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:16:57] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 1 ms to minimize.
[2023-03-15 09:16:58] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:16:58] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:16:59] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:16:59] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2023-03-15 09:17:04] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2023-03-15 09:17:05] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 1 ms to minimize.
[2023-03-15 09:17:15] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 41358 ms
[2023-03-15 09:17:15] [INFO ] After 41472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:17:15] [INFO ] After 41674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52114 resets, run finished after 2957 ms. (steps per millisecond=338 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7066 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2839488 steps, run timeout after 9001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 2839488 steps, saw 827893 distinct states, run finished after 9001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:27] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:17:27] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 09:17:28] [INFO ] [Real]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-15 09:17:28] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:17:28] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:17:28] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:17:28] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:28] [INFO ] After 94ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 114 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 0 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:17:54] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:17:55] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:17:55] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:17:56] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:17:56] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:17:57] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:17:58] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:17:59] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:18:00] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:18:09] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 41188 ms
[2023-03-15 09:18:09] [INFO ] After 41300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:18:09] [INFO ] After 41514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 09:18:09] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:18:09] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 09:18:10] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-15 09:18:10] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:18:10] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 09:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:10] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-15 09:18:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 09:18:10] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:18:10] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 09:18:10] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5182 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:11] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:18:11] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-15 09:18:11] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2023-03-15 09:18:11] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:18:11] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:18:11] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:18:11] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:11] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:18:23] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:31] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:32] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:18:32] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2023-03-15 09:18:32] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:32] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:18:33] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 0 ms to minimize.
[2023-03-15 09:18:33] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:33] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:18:34] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:18:36] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:18:36] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:18:37] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 40974 ms
[2023-03-15 09:18:52] [INFO ] After 41088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:18:52] [INFO ] After 41288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 531 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 858464 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :{}
Probabilistic random walk after 858464 steps, saw 268805 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:55] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:18:55] [INFO ] Computed 57 place invariants in 12 ms
[2023-03-15 09:18:55] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:18:55] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:18:55] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-15 09:18:55] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:18:56] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:56] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 1 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 3 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:19:01] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:19:01] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2023-03-15 09:19:02] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 105 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 0 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 24749 ms
[2023-03-15 09:19:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:19:20] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 09:19:20] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:19:20] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 09:19:21] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 10000 steps, including 513 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 863624 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 863624 steps, saw 270572 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:19:24] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:19:24] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-15 09:19:24] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:19:24] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:19:24] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:19:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-15 09:19:24] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:19:24] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:24] [INFO ] After 44ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:24] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:19:24] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:19:24] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:27] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:29] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:29] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 104 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 101 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:19:45] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:46] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:19:46] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:19:47] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Trap strengthening (SAT) tested/added 62/62 trap constraints in 24750 ms
[2023-03-15 09:19:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:19:49] [INFO ] After 25006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 15 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 09:19:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:19:49] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 09:19:49] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-15 09:19:49] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:19:49] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 09:19:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:50] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-03-15 09:19:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 09:19:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 09:19:50] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 09:19:50] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 43 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2023-03-15 09:19:50] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 09:19:50] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:19:50] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:19:50] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:19:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 09:19:50] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 09:19:50] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:50] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 0 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 1 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 1 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 1 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 105 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 0 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:19:57] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:19:58] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:19:58] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:19:59] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:19:59] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:20:00] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:20:00] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:20:00] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2023-03-15 09:20:01] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2023-03-15 09:20:01] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:20:10] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 19277 ms
[2023-03-15 09:20:10] [INFO ] After 19552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:10] [INFO ] After 19628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:10] [INFO ] Flatten gal took : 266 ms
[2023-03-15 09:20:10] [INFO ] Flatten gal took : 50 ms
[2023-03-15 09:20:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17288539621124245914.gal : 28 ms
[2023-03-15 09:20:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12073019195380333045.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5966153698890795150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17288539621124245914.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12073019195380333045.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12073019195380333045.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35 after 62
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62 after 635
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :635 after 794
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :794 after 1110
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1110 after 1721
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1721 after 28545
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28545 after 46567
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :46567 after 74829
Detected timeout of ITS tools.
[2023-03-15 09:20:25] [INFO ] Flatten gal took : 38 ms
[2023-03-15 09:20:25] [INFO ] Applying decomposition
[2023-03-15 09:20:25] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12964592627363377031.txt' '-o' '/tmp/graph12964592627363377031.bin' '-w' '/tmp/graph12964592627363377031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12964592627363377031.bin' '-l' '-1' '-v' '-w' '/tmp/graph12964592627363377031.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:20:26] [INFO ] Decomposing Gal with order
[2023-03-15 09:20:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:20:26] [INFO ] Removed a total of 498 redundant transitions.
[2023-03-15 09:20:26] [INFO ] Flatten gal took : 155 ms
[2023-03-15 09:20:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 19 ms.
[2023-03-15 09:20:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7339537492272472328.gal : 24 ms
[2023-03-15 09:20:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3071444085384809134.prop : 32 ms
Invoking ITS tools like this :cd /tmp/redAtoms5966153698890795150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7339537492272472328.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3071444085384809134.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality3071444085384809134.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12044411128198967520
[2023-03-15 09:20:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12044411128198967520
Running compilation step : cd /tmp/ltsmin12044411128198967520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 794 ms.
Running link step : cd /tmp/ltsmin12044411128198967520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12044411128198967520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 39 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2023-03-15 09:20:56] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 09:20:56] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-15 09:20:56] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:20:56] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-15 09:20:56] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 09:20:56] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 5 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 1 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 0 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 0 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 0 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2023-03-15 09:21:03] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:21:04] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2023-03-15 09:21:05] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-15 09:21:05] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 0 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:21:07] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2023-03-15 09:21:07] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 19655 ms
[2023-03-15 09:21:16] [INFO ] After 19996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:21:16] [INFO ] After 20075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:21:16] [INFO ] Flatten gal took : 29 ms
[2023-03-15 09:21:16] [INFO ] Flatten gal took : 37 ms
[2023-03-15 09:21:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2955167755685054186.gal : 4 ms
[2023-03-15 09:21:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16074788224735749175.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2955167755685054186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16074788224735749175.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16074788224735749175.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35 after 62
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62 after 635
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :635 after 794
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :794 after 1110
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1110 after 1721
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1721 after 28545
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28545 after 46567
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :46567 after 74829
Detected timeout of ITS tools.
[2023-03-15 09:21:31] [INFO ] Flatten gal took : 29 ms
[2023-03-15 09:21:31] [INFO ] Applying decomposition
[2023-03-15 09:21:31] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6442977530743132270.txt' '-o' '/tmp/graph6442977530743132270.bin' '-w' '/tmp/graph6442977530743132270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6442977530743132270.bin' '-l' '-1' '-v' '-w' '/tmp/graph6442977530743132270.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:21:32] [INFO ] Decomposing Gal with order
[2023-03-15 09:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:21:32] [INFO ] Removed a total of 498 redundant transitions.
[2023-03-15 09:21:32] [INFO ] Flatten gal took : 58 ms
[2023-03-15 09:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 7 ms.
[2023-03-15 09:21:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17911512430506452967.gal : 5 ms
[2023-03-15 09:21:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16355407650994487188.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17911512430506452967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16355407650994487188.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality16355407650994487188.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1.4597e+06
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1.4597e+06 after 1.45973e+06
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1.45973e+06 after 1.45973e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.45973e+06 after 1.45973e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.45973e+06 after 1.45974e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.45974e+06 after 1.45975e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.45975e+06 after 1.46199e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.46199e+06 after 1.46218e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.46218e+06 after 1.6137e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.6137e+06 after 1.7704e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.7704e+06 after 1.94159e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.94159e+06 after 2.31772e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.31772e+06 after 3.09033e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1300815094542448932
[2023-03-15 09:21:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1300815094542448932
Running compilation step : cd /tmp/ltsmin1300815094542448932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 646 ms.
Running link step : cd /tmp/ltsmin1300815094542448932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1300815094542448932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:22:02] [INFO ] Flatten gal took : 42 ms
[2023-03-15 09:22:02] [INFO ] Flatten gal took : 34 ms
[2023-03-15 09:22:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16536507056137536731.gal : 3 ms
[2023-03-15 09:22:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15490885996069305292.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16536507056137536731.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15490885996069305292.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityFireability15490885996069305292.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
Detected timeout of ITS tools.
[2023-03-15 09:22:05] [INFO ] Flatten gal took : 20 ms
[2023-03-15 09:22:05] [INFO ] Applying decomposition
[2023-03-15 09:22:05] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17186044642588937870.txt' '-o' '/tmp/graph17186044642588937870.bin' '-w' '/tmp/graph17186044642588937870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17186044642588937870.bin' '-l' '-1' '-v' '-w' '/tmp/graph17186044642588937870.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:22:05] [INFO ] Decomposing Gal with order
[2023-03-15 09:22:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:22:05] [INFO ] Removed a total of 517 redundant transitions.
[2023-03-15 09:22:05] [INFO ] Flatten gal took : 64 ms
[2023-03-15 09:22:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 11 ms.
[2023-03-15 09:22:05] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10652761922931348535.gal : 5 ms
[2023-03-15 09:22:05] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2407528577749403368.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10652761922931348535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2407528577749403368.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability2407528577749403368.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15736506671260162370
[2023-03-15 09:22:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15736506671260162370
Running compilation step : cd /tmp/ltsmin15736506671260162370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 683 ms.
Running link step : cd /tmp/ltsmin15736506671260162370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15736506671260162370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:22:11] [INFO ] Flatten gal took : 28 ms
[2023-03-15 09:22:11] [INFO ] Flatten gal took : 19 ms
[2023-03-15 09:22:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2105076782561884934.gal : 2 ms
[2023-03-15 09:22:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7210484046800780026.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2105076782561884934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7210484046800780026.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability7210484046800780026.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31829 after 306848
Detected timeout of ITS tools.
[2023-03-15 09:22:41] [INFO ] Flatten gal took : 17 ms
[2023-03-15 09:22:41] [INFO ] Applying decomposition
[2023-03-15 09:22:41] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph421265502404352249.txt' '-o' '/tmp/graph421265502404352249.bin' '-w' '/tmp/graph421265502404352249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph421265502404352249.bin' '-l' '-1' '-v' '-w' '/tmp/graph421265502404352249.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:22:41] [INFO ] Decomposing Gal with order
[2023-03-15 09:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:22:41] [INFO ] Removed a total of 364 redundant transitions.
[2023-03-15 09:22:41] [INFO ] Flatten gal took : 63 ms
[2023-03-15 09:22:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2023-03-15 09:22:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10512070084899813530.gal : 3 ms
[2023-03-15 09:22:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2795476015771473787.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10512070084899813530.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2795476015771473787.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability2795476015771473787.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 81
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :81 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 261650
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :261650 after 261650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1376931166795744559
[2023-03-15 09:23:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1376931166795744559
Running compilation step : cd /tmp/ltsmin1376931166795744559;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 665 ms.
Running link step : cd /tmp/ltsmin1376931166795744559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1376931166795744559;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:23:42] [INFO ] Flatten gal took : 17 ms
[2023-03-15 09:23:42] [INFO ] Flatten gal took : 15 ms
[2023-03-15 09:23:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12998029568882678837.gal : 3 ms
[2023-03-15 09:23:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3758935415883014456.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability12998029568882678837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3758935415883014456.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability3758935415883014456.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31829 after 306848
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :306848 after 982056
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :982056 after 6.61264e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.61264e+06 after 2.13807e+07
Detected timeout of ITS tools.
[2023-03-15 09:28:42] [INFO ] Flatten gal took : 16 ms
[2023-03-15 09:28:42] [INFO ] Applying decomposition
[2023-03-15 09:28:42] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13460013101749140485.txt' '-o' '/tmp/graph13460013101749140485.bin' '-w' '/tmp/graph13460013101749140485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13460013101749140485.bin' '-l' '-1' '-v' '-w' '/tmp/graph13460013101749140485.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:28:42] [INFO ] Decomposing Gal with order
[2023-03-15 09:28:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:28:42] [INFO ] Removed a total of 577 redundant transitions.
[2023-03-15 09:28:42] [INFO ] Flatten gal took : 36 ms
[2023-03-15 09:28:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 6 ms.
[2023-03-15 09:28:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10512671563940565849.gal : 3 ms
[2023-03-15 09:28:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3687777214501913105.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10512671563940565849.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3687777214501913105.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability3687777214501913105.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1530
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1530 after 1590
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1590 after 1650
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1650 after 1710
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1710 after 1830
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1830 after 3054
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3054 after 3270
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3270 after 4914
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4914 after 5550
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5550 after 299906
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :299906 after 310722
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :310722 after 1.64165e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.64165e+07 after 1.69406e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.69406e+07 after 1.76563e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.76563e+07 after 1.95548e+07
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.95548e+07 after 2.64411e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin887649164759011221
[2023-03-15 09:33:42] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin887649164759011221
Running compilation step : cd /tmp/ltsmin887649164759011221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 631 ms.
Running link step : cd /tmp/ltsmin887649164759011221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin887649164759011221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.370: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.377: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.390: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.390: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.391: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.392: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.392: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.391: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.397: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.397: There are 407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.397: State length is 290, there are 406 groups
pins2lts-mc-linux64( 0/ 8), 0.397: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.397: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.397: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.397: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.397: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.396: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.396: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.396: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.397: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.396: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.397: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.453: ~5 levels ~960 states ~2688 transitions
pins2lts-mc-linux64( 1/ 8), 0.469: ~6 levels ~1920 states ~6432 transitions
pins2lts-mc-linux64( 1/ 8), 0.490: ~7 levels ~3840 states ~13032 transitions
pins2lts-mc-linux64( 1/ 8), 0.518: ~9 levels ~7680 states ~23568 transitions
pins2lts-mc-linux64( 6/ 8), 0.768: ~12 levels ~15360 states ~46344 transitions
pins2lts-mc-linux64( 6/ 8), 0.938: ~13 levels ~30720 states ~65856 transitions
pins2lts-mc-linux64( 7/ 8), 1.312: ~32 levels ~61440 states ~152472 transitions
pins2lts-mc-linux64( 6/ 8), 1.871: ~20 levels ~122880 states ~301984 transitions
pins2lts-mc-linux64( 5/ 8), 2.956: ~32 levels ~245760 states ~729040 transitions
pins2lts-mc-linux64( 5/ 8), 4.498: ~34 levels ~491520 states ~1357584 transitions
pins2lts-mc-linux64( 5/ 8), 7.147: ~39 levels ~983040 states ~2028952 transitions
pins2lts-mc-linux64( 5/ 8), 12.656: ~53 levels ~1966080 states ~4554712 transitions
pins2lts-mc-linux64( 6/ 8), 24.122: ~32 levels ~3932160 states ~10829264 transitions
pins2lts-mc-linux64( 6/ 8), 45.547: ~38 levels ~7864320 states ~17794800 transitions
pins2lts-mc-linux64( 5/ 8), 90.150: ~59 levels ~15728640 states ~41752480 transitions
pins2lts-mc-linux64( 2/ 8), 176.015: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 176.289:
pins2lts-mc-linux64( 0/ 8), 176.289: mean standard work distribution: 14.2% (states) 55.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 176.289:
pins2lts-mc-linux64( 0/ 8), 176.289: Explored 26325365 states 115079703 transitions, fanout: 4.371
pins2lts-mc-linux64( 0/ 8), 176.289: Total exploration time 175.890 sec (175.620 sec minimum, 175.669 sec on average)
pins2lts-mc-linux64( 0/ 8), 176.289: States per second: 149669, Transitions per second: 654271
pins2lts-mc-linux64( 0/ 8), 176.289:
pins2lts-mc-linux64( 0/ 8), 176.289: Queue width: 8B, total height: 13693536, memory: 104.47MB
pins2lts-mc-linux64( 0/ 8), 176.289: Tree memory: 548.2MB, 15.0 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 176.289: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 176.289: Stored 408 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 176.289: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 176.289: Est. total memory use: 652.7MB (~1128.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin887649164759011221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin887649164759011221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2023-03-15 09:36:39] [INFO ] Flatten gal took : 16 ms
[2023-03-15 09:36:39] [INFO ] Flatten gal took : 16 ms
[2023-03-15 09:36:39] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2618399778489122039.gal : 3 ms
[2023-03-15 09:36:39] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8659912074681984343.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2618399778489122039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8659912074681984343.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability8659912074681984343.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31829 after 306848
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :306848 after 982056
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :982056 after 6.61264e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.61264e+06 after 2.13807e+07

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-COL-S05J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r320-tall-167873970500397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;