About the Execution of ITS-Tools for PolyORBNT-COL-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.012 | 3600000.00 | 2675965.00 | 593932.60 | ??T????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017200770.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S10J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200770
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.3K Apr 30 04:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652940880764
Running Version 202205111006
[2022-05-19 06:14:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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, 3600]
[2022-05-19 06:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 06:14:42] [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.
[2022-05-19 06:14:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 06:14:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2022-05-19 06:14:42] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2022-05-19 06:14:42] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2022-05-19 06:14:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 572 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 40) seen :5
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 35) seen :23
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 06:14:43] [INFO ] Computed 13 place invariants in 10 ms
[2022-05-19 06:14:44] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-19 06:14:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 06:14:44] [INFO ] After 1158ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:2
[2022-05-19 06:14:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-19 06:14:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 06:14:44] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2022-05-19 06:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:14:44] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :8 sat :1
[2022-05-19 06:14:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
[2022-05-19 06:14:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2022-05-19 06:14:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2022-05-19 06:14:44] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-19 06:14:44] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 21 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2022-05-19 06:14:44] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-19 06:14:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 736 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 298 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 11 ms. (steps per millisecond=126 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 5 ms. (steps per millisecond=278 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2022-05-19 06:14:45] [INFO ] Flatten gal took : 20 ms
[2022-05-19 06:14:45] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 06:14:45] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 257 ms.
[2022-05-19 06:14:45] [INFO ] Unfolded 16 HLPN properties in 3 ms.
[2022-05-19 06:14:45] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-19 06:14:45] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-19 06:14:45] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-19 06:14:45] [INFO ] Reduced 9285 identical enabling conditions.
Deduced a syphon composed of 20 places in 28 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 472 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 32 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
[2022-05-19 06:14:45] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-19 06:14:45] [INFO ] Computed 72 place invariants in 70 ms
[2022-05-19 06:14:46] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 06:14:46] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:14:46] [INFO ] Computed 72 place invariants in 34 ms
[2022-05-19 06:14:46] [INFO ] Implicit Places using invariants in 122 ms returned []
[2022-05-19 06:14:46] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:14:46] [INFO ] Computed 72 place invariants in 26 ms
[2022-05-19 06:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:14:46] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 15 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1035/1650 transitions.
Support contains 472 out of 474 places after structural reductions.
[2022-05-19 06:14:47] [INFO ] Flatten gal took : 161 ms
[2022-05-19 06:14:47] [INFO ] Flatten gal took : 135 ms
[2022-05-19 06:14:48] [INFO ] Input system was already deterministic with 1035 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 925 ms. (steps per millisecond=10 ) properties (out of 53) seen :9
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 44) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-05-19 06:14:49] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:14:49] [INFO ] Computed 72 place invariants in 29 ms
[2022-05-19 06:14:50] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2022-05-19 06:14:50] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-19 06:14:50] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:6
[2022-05-19 06:14:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-19 06:14:50] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-19 06:14:52] [INFO ] After 1715ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :5
[2022-05-19 06:14:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:14:53] [INFO ] After 1104ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :8 sat :5
[2022-05-19 06:14:55] [INFO ] Deduced a trap composed of 213 places in 256 ms of which 1 ms to minimize.
[2022-05-19 06:14:55] [INFO ] Deduced a trap composed of 221 places in 251 ms of which 1 ms to minimize.
[2022-05-19 06:14:55] [INFO ] Deduced a trap composed of 213 places in 244 ms of which 0 ms to minimize.
[2022-05-19 06:14:55] [INFO ] Deduced a trap composed of 219 places in 249 ms of which 1 ms to minimize.
[2022-05-19 06:14:56] [INFO ] Deduced a trap composed of 215 places in 246 ms of which 1 ms to minimize.
[2022-05-19 06:14:56] [INFO ] Deduced a trap composed of 219 places in 243 ms of which 1 ms to minimize.
[2022-05-19 06:14:56] [INFO ] Deduced a trap composed of 219 places in 244 ms of which 1 ms to minimize.
[2022-05-19 06:14:57] [INFO ] Deduced a trap composed of 217 places in 244 ms of which 1 ms to minimize.
[2022-05-19 06:14:57] [INFO ] Deduced a trap composed of 215 places in 241 ms of which 0 ms to minimize.
[2022-05-19 06:14:57] [INFO ] Deduced a trap composed of 213 places in 253 ms of which 0 ms to minimize.
[2022-05-19 06:14:58] [INFO ] Deduced a trap composed of 215 places in 282 ms of which 1 ms to minimize.
[2022-05-19 06:14:58] [INFO ] Deduced a trap composed of 219 places in 248 ms of which 0 ms to minimize.
[2022-05-19 06:14:58] [INFO ] Deduced a trap composed of 217 places in 242 ms of which 1 ms to minimize.
[2022-05-19 06:14:59] [INFO ] Deduced a trap composed of 211 places in 252 ms of which 0 ms to minimize.
[2022-05-19 06:14:59] [INFO ] Deduced a trap composed of 219 places in 240 ms of which 0 ms to minimize.
[2022-05-19 06:14:59] [INFO ] Deduced a trap composed of 221 places in 241 ms of which 0 ms to minimize.
[2022-05-19 06:14:59] [INFO ] Deduced a trap composed of 219 places in 241 ms of which 0 ms to minimize.
[2022-05-19 06:15:00] [INFO ] Deduced a trap composed of 215 places in 244 ms of which 0 ms to minimize.
[2022-05-19 06:15:00] [INFO ] Deduced a trap composed of 217 places in 245 ms of which 1 ms to minimize.
[2022-05-19 06:15:00] [INFO ] Deduced a trap composed of 213 places in 242 ms of which 1 ms to minimize.
[2022-05-19 06:15:01] [INFO ] Deduced a trap composed of 213 places in 246 ms of which 0 ms to minimize.
[2022-05-19 06:15:01] [INFO ] Deduced a trap composed of 211 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:15:01] [INFO ] Deduced a trap composed of 223 places in 240 ms of which 1 ms to minimize.
[2022-05-19 06:15:02] [INFO ] Deduced a trap composed of 217 places in 242 ms of which 0 ms to minimize.
[2022-05-19 06:15:02] [INFO ] Deduced a trap composed of 221 places in 242 ms of which 0 ms to minimize.
[2022-05-19 06:15:02] [INFO ] Deduced a trap composed of 217 places in 237 ms of which 0 ms to minimize.
[2022-05-19 06:15:02] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:15:03] [INFO ] Deduced a trap composed of 219 places in 236 ms of which 1 ms to minimize.
[2022-05-19 06:15:03] [INFO ] Deduced a trap composed of 215 places in 217 ms of which 1 ms to minimize.
[2022-05-19 06:15:03] [INFO ] Deduced a trap composed of 211 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:15:04] [INFO ] Deduced a trap composed of 213 places in 216 ms of which 1 ms to minimize.
[2022-05-19 06:15:04] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:15:04] [INFO ] Deduced a trap composed of 219 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:15:04] [INFO ] Deduced a trap composed of 213 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:15:05] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 0 ms to minimize.
[2022-05-19 06:15:05] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:15:05] [INFO ] Deduced a trap composed of 217 places in 235 ms of which 1 ms to minimize.
[2022-05-19 06:15:06] [INFO ] Deduced a trap composed of 219 places in 240 ms of which 1 ms to minimize.
[2022-05-19 06:15:06] [INFO ] Deduced a trap composed of 215 places in 244 ms of which 1 ms to minimize.
[2022-05-19 06:15:06] [INFO ] Deduced a trap composed of 219 places in 247 ms of which 0 ms to minimize.
[2022-05-19 06:15:07] [INFO ] Deduced a trap composed of 219 places in 252 ms of which 0 ms to minimize.
[2022-05-19 06:15:07] [INFO ] Deduced a trap composed of 217 places in 257 ms of which 1 ms to minimize.
[2022-05-19 06:15:07] [INFO ] Deduced a trap composed of 217 places in 249 ms of which 1 ms to minimize.
[2022-05-19 06:15:08] [INFO ] Deduced a trap composed of 213 places in 241 ms of which 1 ms to minimize.
[2022-05-19 06:15:08] [INFO ] Deduced a trap composed of 215 places in 263 ms of which 1 ms to minimize.
[2022-05-19 06:15:08] [INFO ] Deduced a trap composed of 219 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:15:09] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 0 ms to minimize.
[2022-05-19 06:15:09] [INFO ] Deduced a trap composed of 223 places in 254 ms of which 1 ms to minimize.
[2022-05-19 06:15:09] [INFO ] Deduced a trap composed of 211 places in 232 ms of which 1 ms to minimize.
[2022-05-19 06:15:10] [INFO ] Deduced a trap composed of 221 places in 242 ms of which 0 ms to minimize.
[2022-05-19 06:15:10] [INFO ] Deduced a trap composed of 219 places in 231 ms of which 1 ms to minimize.
[2022-05-19 06:15:10] [INFO ] Deduced a trap composed of 211 places in 237 ms of which 1 ms to minimize.
[2022-05-19 06:15:11] [INFO ] Deduced a trap composed of 225 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:15:11] [INFO ] Deduced a trap composed of 211 places in 217 ms of which 0 ms to minimize.
[2022-05-19 06:15:11] [INFO ] Deduced a trap composed of 219 places in 220 ms of which 1 ms to minimize.
[2022-05-19 06:15:12] [INFO ] Deduced a trap composed of 219 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:15:12] [INFO ] Deduced a trap composed of 219 places in 250 ms of which 1 ms to minimize.
[2022-05-19 06:15:12] [INFO ] Deduced a trap composed of 211 places in 227 ms of which 0 ms to minimize.
[2022-05-19 06:15:13] [INFO ] Deduced a trap composed of 219 places in 240 ms of which 1 ms to minimize.
[2022-05-19 06:15:13] [INFO ] Deduced a trap composed of 219 places in 217 ms of which 1 ms to minimize.
[2022-05-19 06:15:13] [INFO ] Deduced a trap composed of 215 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:15:14] [INFO ] Deduced a trap composed of 215 places in 247 ms of which 1 ms to minimize.
[2022-05-19 06:15:15] [INFO ] Deduced a trap composed of 223 places in 244 ms of which 1 ms to minimize.
[2022-05-19 06:15:15] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 20533 ms
[2022-05-19 06:15:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:15:15] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0 real:6
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 279 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 460 transition count 1030
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 459 transition count 1030
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 20 place count 459 transition count 1006
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 68 place count 435 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 434 transition count 1005
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 434 transition count 1005
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 3 with 4 rules applied. Total rules applied 74 place count 432 transition count 1003
Applied a total of 74 rules in 116 ms. Remains 432 /474 variables (removed 42) and now considering 1003/1035 (removed 32) transitions.
[2022-05-19 06:15:15] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2022-05-19 06:15:15] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:15:15] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/474 places, 1003/1035 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 06:15:16] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2022-05-19 06:15:16] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-19 06:15:16] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-19 06:15:16] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-19 06:15:16] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:15:16] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-19 06:15:16] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-19 06:15:16] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:15:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:15:16] [INFO ] After 225ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 06:15:17] [INFO ] Deduced a trap composed of 190 places in 225 ms of which 3 ms to minimize.
[2022-05-19 06:15:17] [INFO ] Deduced a trap composed of 194 places in 232 ms of which 5 ms to minimize.
[2022-05-19 06:15:17] [INFO ] Deduced a trap composed of 192 places in 214 ms of which 1 ms to minimize.
[2022-05-19 06:15:17] [INFO ] Deduced a trap composed of 196 places in 207 ms of which 1 ms to minimize.
[2022-05-19 06:15:18] [INFO ] Deduced a trap composed of 194 places in 207 ms of which 0 ms to minimize.
[2022-05-19 06:15:18] [INFO ] Deduced a trap composed of 188 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:15:18] [INFO ] Deduced a trap composed of 188 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:15:18] [INFO ] Deduced a trap composed of 194 places in 214 ms of which 0 ms to minimize.
[2022-05-19 06:15:19] [INFO ] Deduced a trap composed of 198 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:15:19] [INFO ] Deduced a trap composed of 188 places in 207 ms of which 0 ms to minimize.
[2022-05-19 06:15:19] [INFO ] Deduced a trap composed of 190 places in 210 ms of which 0 ms to minimize.
[2022-05-19 06:15:19] [INFO ] Deduced a trap composed of 198 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:15:20] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 1 ms to minimize.
[2022-05-19 06:15:20] [INFO ] Deduced a trap composed of 192 places in 235 ms of which 2 ms to minimize.
[2022-05-19 06:15:20] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 0 ms to minimize.
[2022-05-19 06:15:21] [INFO ] Deduced a trap composed of 186 places in 230 ms of which 1 ms to minimize.
[2022-05-19 06:15:21] [INFO ] Deduced a trap composed of 188 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:15:21] [INFO ] Deduced a trap composed of 194 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:15:22] [INFO ] Deduced a trap composed of 192 places in 212 ms of which 1 ms to minimize.
[2022-05-19 06:15:22] [INFO ] Deduced a trap composed of 190 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:15:22] [INFO ] Deduced a trap composed of 188 places in 232 ms of which 1 ms to minimize.
[2022-05-19 06:15:23] [INFO ] Deduced a trap composed of 190 places in 225 ms of which 1 ms to minimize.
[2022-05-19 06:15:23] [INFO ] Deduced a trap composed of 190 places in 229 ms of which 1 ms to minimize.
[2022-05-19 06:15:23] [INFO ] Deduced a trap composed of 190 places in 231 ms of which 0 ms to minimize.
[2022-05-19 06:15:23] [INFO ] Deduced a trap composed of 192 places in 231 ms of which 1 ms to minimize.
[2022-05-19 06:15:24] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 1 ms to minimize.
[2022-05-19 06:15:24] [INFO ] Deduced a trap composed of 194 places in 230 ms of which 1 ms to minimize.
[2022-05-19 06:15:25] [INFO ] Deduced a trap composed of 194 places in 233 ms of which 0 ms to minimize.
[2022-05-19 06:15:26] [INFO ] Deduced a trap composed of 188 places in 229 ms of which 0 ms to minimize.
[2022-05-19 06:15:26] [INFO ] Deduced a trap composed of 192 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:15:29] [INFO ] Deduced a trap composed of 186 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:15:30] [INFO ] Deduced a trap composed of 196 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:15:31] [INFO ] Deduced a trap composed of 196 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:15:31] [INFO ] Deduced a trap composed of 194 places in 234 ms of which 0 ms to minimize.
[2022-05-19 06:15:32] [INFO ] Deduced a trap composed of 190 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:15:32] [INFO ] Deduced a trap composed of 186 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:15:32] [INFO ] Deduced a trap composed of 192 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:15:32] [INFO ] Deduced a trap composed of 188 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:15:33] [INFO ] Deduced a trap composed of 184 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:15:33] [INFO ] Deduced a trap composed of 190 places in 218 ms of which 0 ms to minimize.
[2022-05-19 06:15:33] [INFO ] Deduced a trap composed of 190 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:15:34] [INFO ] Deduced a trap composed of 188 places in 210 ms of which 0 ms to minimize.
[2022-05-19 06:15:34] [INFO ] Deduced a trap composed of 190 places in 212 ms of which 1 ms to minimize.
[2022-05-19 06:15:34] [INFO ] Deduced a trap composed of 194 places in 240 ms of which 1 ms to minimize.
[2022-05-19 06:15:35] [INFO ] Deduced a trap composed of 192 places in 200 ms of which 1 ms to minimize.
[2022-05-19 06:15:35] [INFO ] Deduced a trap composed of 192 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:15:35] [INFO ] Deduced a trap composed of 192 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:15:37] [INFO ] Deduced a trap composed of 192 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:15:37] [INFO ] Deduced a trap composed of 194 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:15:38] [INFO ] Deduced a trap composed of 190 places in 210 ms of which 1 ms to minimize.
[2022-05-19 06:15:38] [INFO ] Deduced a trap composed of 190 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:15:39] [INFO ] Deduced a trap composed of 188 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:15:40] [INFO ] Deduced a trap composed of 186 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:15:40] [INFO ] Deduced a trap composed of 192 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:15:41] [INFO ] Deduced a trap composed of 187 places in 211 ms of which 0 ms to minimize.
[2022-05-19 06:15:41] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 24454 ms
[2022-05-19 06:15:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:15:41] [INFO ] After 25009ms 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 432 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 432/432 places, 1003/1003 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 432 transition count 981
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 410 transition count 981
Applied a total of 44 rules in 44 ms. Remains 410 /432 variables (removed 22) and now considering 981/1003 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/432 places, 981/1003 transitions.
Incomplete random walk after 10000 steps, including 724 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 523697 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 523697 steps, saw 85221 distinct states, run finished after 3003 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 06:15:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:15:44] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 06:15:44] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:15:44] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:15:44] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:15:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-19 06:15:44] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:15:44] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:15:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:15:44] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 06:15:45] [INFO ] Deduced a trap composed of 86 places in 239 ms of which 0 ms to minimize.
[2022-05-19 06:15:45] [INFO ] Deduced a trap composed of 177 places in 240 ms of which 1 ms to minimize.
[2022-05-19 06:15:45] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2022-05-19 06:15:46] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2022-05-19 06:15:46] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 1 ms to minimize.
[2022-05-19 06:15:46] [INFO ] Deduced a trap composed of 170 places in 232 ms of which 0 ms to minimize.
[2022-05-19 06:15:46] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 1 ms to minimize.
[2022-05-19 06:15:47] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:15:47] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:15:47] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:15:48] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:15:48] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:15:48] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2022-05-19 06:15:48] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:15:49] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:15:49] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:15:49] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2022-05-19 06:15:50] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 1 ms to minimize.
[2022-05-19 06:15:50] [INFO ] Deduced a trap composed of 167 places in 228 ms of which 0 ms to minimize.
[2022-05-19 06:15:50] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 1 ms to minimize.
[2022-05-19 06:15:50] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 0 ms to minimize.
[2022-05-19 06:15:51] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:15:51] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:15:51] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 0 ms to minimize.
[2022-05-19 06:15:52] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2022-05-19 06:15:53] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 1 ms to minimize.
[2022-05-19 06:15:54] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:15:54] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 0 ms to minimize.
[2022-05-19 06:15:55] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 0 ms to minimize.
[2022-05-19 06:15:55] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:15:55] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:15:55] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:15:56] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 0 ms to minimize.
[2022-05-19 06:15:56] [INFO ] Deduced a trap composed of 168 places in 278 ms of which 0 ms to minimize.
[2022-05-19 06:15:56] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:15:57] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 1 ms to minimize.
[2022-05-19 06:15:57] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:15:57] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:15:58] [INFO ] Deduced a trap composed of 179 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:15:58] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:15:58] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:15:59] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:15:59] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2022-05-19 06:15:59] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:16:00] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2022-05-19 06:16:00] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-19 06:16:00] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:16:01] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:16:01] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 1 ms to minimize.
[2022-05-19 06:16:01] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:16:02] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 1 ms to minimize.
[2022-05-19 06:16:02] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:16:02] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:16:02] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:16:03] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2022-05-19 06:16:03] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2022-05-19 06:16:04] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:16:04] [INFO ] Deduced a trap composed of 177 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:16:04] [INFO ] Deduced a trap composed of 175 places in 215 ms of which 1 ms to minimize.
[2022-05-19 06:16:05] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:16:05] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2022-05-19 06:16:06] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 1 ms to minimize.
[2022-05-19 06:16:06] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:16:06] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:16:07] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2022-05-19 06:16:07] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:16:07] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2022-05-19 06:16:08] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:16:08] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:16:09] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:16:09] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:16:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:16:09] [INFO ] After 25125ms 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 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 33 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 21 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 06:16:09] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:16:09] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 06:16:10] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-05-19 06:16:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:16:10] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:16:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:16:11] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
[2022-05-19 06:16:11] [INFO ] Redundant transitions in 66 ms returned []
[2022-05-19 06:16:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:16:11] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-19 06:16:12] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
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 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 105 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2022-05-19 06:16:12] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:16:12] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:16:12] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-19 06:16:12] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:16:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:16:12] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:16:12] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:16:12] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2022-05-19 06:16:12] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:16:13] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2022-05-19 06:16:13] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2022-05-19 06:16:13] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 0 ms to minimize.
[2022-05-19 06:16:13] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:14] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2022-05-19 06:16:14] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2022-05-19 06:16:14] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:14] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:14] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:15] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2022-05-19 06:16:15] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 1 ms to minimize.
[2022-05-19 06:16:15] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2022-05-19 06:16:15] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:15] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:16] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2022-05-19 06:16:16] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2022-05-19 06:16:16] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-19 06:16:16] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:16:16] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-19 06:16:17] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2022-05-19 06:16:17] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2022-05-19 06:16:17] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2022-05-19 06:16:17] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2022-05-19 06:16:18] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2022-05-19 06:16:18] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 1 ms to minimize.
[2022-05-19 06:16:18] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 0 ms to minimize.
[2022-05-19 06:16:18] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 1 ms to minimize.
[2022-05-19 06:16:18] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 0 ms to minimize.
[2022-05-19 06:16:19] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:16:19] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:19] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2022-05-19 06:16:19] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:20] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2022-05-19 06:16:20] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:20] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 1 ms to minimize.
[2022-05-19 06:16:20] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2022-05-19 06:16:20] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:21] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 1 ms to minimize.
[2022-05-19 06:16:21] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:21] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2022-05-19 06:16:21] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 0 ms to minimize.
[2022-05-19 06:16:22] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 0 ms to minimize.
[2022-05-19 06:16:22] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2022-05-19 06:16:23] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 0 ms to minimize.
[2022-05-19 06:16:23] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 1 ms to minimize.
[2022-05-19 06:16:23] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2022-05-19 06:16:23] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:23] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:24] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2022-05-19 06:16:24] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:16:24] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 1 ms to minimize.
[2022-05-19 06:16:24] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:16:24] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:16:25] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 2 ms to minimize.
[2022-05-19 06:16:25] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 1 ms to minimize.
[2022-05-19 06:16:25] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2022-05-19 06:16:25] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 1 ms to minimize.
[2022-05-19 06:16:26] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:16:26] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2022-05-19 06:16:26] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2022-05-19 06:16:26] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2022-05-19 06:16:27] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2022-05-19 06:16:27] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:16:27] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2022-05-19 06:16:27] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2022-05-19 06:16:27] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 1 ms to minimize.
[2022-05-19 06:16:28] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:28] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 1 ms to minimize.
[2022-05-19 06:16:28] [INFO ] Deduced a trap composed of 166 places in 176 ms of which 0 ms to minimize.
[2022-05-19 06:16:28] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 0 ms to minimize.
[2022-05-19 06:16:28] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 0 ms to minimize.
[2022-05-19 06:16:29] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2022-05-19 06:16:29] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:29] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 0 ms to minimize.
[2022-05-19 06:16:29] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:30] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:30] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 1 ms to minimize.
[2022-05-19 06:16:30] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 0 ms to minimize.
[2022-05-19 06:16:30] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 1 ms to minimize.
[2022-05-19 06:16:30] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 0 ms to minimize.
[2022-05-19 06:16:31] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2022-05-19 06:16:31] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 0 ms to minimize.
[2022-05-19 06:16:31] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 0 ms to minimize.
[2022-05-19 06:16:31] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:32] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2022-05-19 06:16:32] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:32] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2022-05-19 06:16:32] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2022-05-19 06:16:32] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:16:33] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2022-05-19 06:16:33] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:16:33] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2022-05-19 06:16:33] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2022-05-19 06:16:33] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:34] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2022-05-19 06:16:34] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:35] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:36] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2022-05-19 06:16:38] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 1 ms to minimize.
[2022-05-19 06:16:39] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2022-05-19 06:16:39] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2022-05-19 06:16:39] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:40] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:40] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 0 ms to minimize.
[2022-05-19 06:16:40] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2022-05-19 06:16:40] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 0 ms to minimize.
[2022-05-19 06:16:40] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2022-05-19 06:16:41] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 0 ms to minimize.
[2022-05-19 06:16:41] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2022-05-19 06:16:41] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2022-05-19 06:16:41] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2022-05-19 06:16:41] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:42] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:42] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:42] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2022-05-19 06:16:42] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 0 ms to minimize.
[2022-05-19 06:16:43] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2022-05-19 06:16:43] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:16:43] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 1 ms to minimize.
[2022-05-19 06:16:43] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2022-05-19 06:16:43] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:16:44] [INFO ] Deduced a trap composed of 159 places in 188 ms of which 0 ms to minimize.
[2022-05-19 06:16:44] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2022-05-19 06:16:44] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2022-05-19 06:16:45] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2022-05-19 06:16:45] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2022-05-19 06:16:45] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 0 ms to minimize.
[2022-05-19 06:16:46] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2022-05-19 06:16:46] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 1 ms to minimize.
[2022-05-19 06:16:46] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2022-05-19 06:16:46] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 1 ms to minimize.
[2022-05-19 06:16:46] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 0 ms to minimize.
[2022-05-19 06:16:47] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 1 ms to minimize.
[2022-05-19 06:16:47] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:47] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:47] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:47] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2022-05-19 06:16:48] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:48] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2022-05-19 06:16:48] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 1 ms to minimize.
[2022-05-19 06:16:48] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:49] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:49] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2022-05-19 06:16:49] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2022-05-19 06:16:49] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2022-05-19 06:16:49] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 1 ms to minimize.
[2022-05-19 06:16:50] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:16:50] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 1 ms to minimize.
[2022-05-19 06:16:50] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:16:50] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 1 ms to minimize.
[2022-05-19 06:16:50] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2022-05-19 06:16:51] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:51] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 0 ms to minimize.
[2022-05-19 06:16:51] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:16:51] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 0 ms to minimize.
[2022-05-19 06:16:51] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 0 ms to minimize.
[2022-05-19 06:16:52] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 0 ms to minimize.
[2022-05-19 06:16:52] [INFO ] Deduced a trap composed of 170 places in 184 ms of which 0 ms to minimize.
[2022-05-19 06:16:52] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2022-05-19 06:16:52] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 0 ms to minimize.
[2022-05-19 06:16:53] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 1 ms to minimize.
[2022-05-19 06:16:53] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2022-05-19 06:16:53] [INFO ] Deduced a trap composed of 154 places in 184 ms of which 0 ms to minimize.
[2022-05-19 06:16:53] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 1 ms to minimize.
[2022-05-19 06:16:53] [INFO ] Deduced a trap composed of 152 places in 184 ms of which 0 ms to minimize.
[2022-05-19 06:16:54] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 0 ms to minimize.
[2022-05-19 06:16:54] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:16:54] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 1 ms to minimize.
[2022-05-19 06:16:54] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2022-05-19 06:16:55] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 0 ms to minimize.
[2022-05-19 06:16:55] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 1 ms to minimize.
[2022-05-19 06:16:55] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2022-05-19 06:16:55] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 1 ms to minimize.
[2022-05-19 06:16:56] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2022-05-19 06:16:56] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 0 ms to minimize.
[2022-05-19 06:16:57] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2022-05-19 06:16:57] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:16:57] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2022-05-19 06:16:58] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2022-05-19 06:16:58] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2022-05-19 06:16:58] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:16:58] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-19 06:16:59] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2022-05-19 06:16:59] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:16:59] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 1 ms to minimize.
[2022-05-19 06:16:59] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:17:00] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 0 ms to minimize.
[2022-05-19 06:17:00] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:17:01] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-19 06:17:01] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2022-05-19 06:17:01] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:17:01] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:17:02] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2022-05-19 06:17:02] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-19 06:17:02] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 0 ms to minimize.
[2022-05-19 06:17:02] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2022-05-19 06:17:02] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 0 ms to minimize.
[2022-05-19 06:17:03] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2022-05-19 06:17:03] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 1 ms to minimize.
[2022-05-19 06:17:03] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2022-05-19 06:17:03] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:17:04] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:19:57] [INFO ] Trap strengthening (SAT) tested/added 204/204 trap constraints in 224713 ms
[2022-05-19 06:19:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:19:57] [INFO ] After 225016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
[2022-05-19 06:19:57] [INFO ] Flatten gal took : 60 ms
[2022-05-19 06:19:57] [INFO ] Flatten gal took : 55 ms
[2022-05-19 06:19:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17713368525216681049.gal : 26 ms
[2022-05-19 06:19:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15513006744795558237.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12589829620692479788;'/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/ReachabilityCardinality17713368525216681049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15513006744795558237.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/ReachabilityCardinality15513006744795558237.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 389
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :389 after 399
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :399 after 433
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :433 after 534
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :534 after 769
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :769 after 1262
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1262 after 2760
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2760 after 5148
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5148 after 230782
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :230782 after 235888
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235888 after 299019
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :299019 after 425613
Detected timeout of ITS tools.
[2022-05-19 06:20:12] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:20:12] [INFO ] Applying decomposition
[2022-05-19 06:20:12] [INFO ] Flatten gal took : 50 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/graph10062192834666445402.txt' '-o' '/tmp/graph10062192834666445402.bin' '-w' '/tmp/graph10062192834666445402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10062192834666445402.bin' '-l' '-1' '-v' '-w' '/tmp/graph10062192834666445402.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:20:12] [INFO ] Decomposing Gal with order
[2022-05-19 06:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:20:13] [INFO ] Removed a total of 2927 redundant transitions.
[2022-05-19 06:20:13] [INFO ] Flatten gal took : 247 ms
[2022-05-19 06:20:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 53 ms.
[2022-05-19 06:20:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15000160903245262167.gal : 14 ms
[2022-05-19 06:20:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17682865674971659273.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12589829620692479788;'/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/ReachabilityCardinality15000160903245262167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17682865674971659273.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/ReachabilityCardinality17682865674971659273.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3507163380087681145
[2022-05-19 06:20:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3507163380087681145
Running compilation step : cd /tmp/ltsmin3507163380087681145;'/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 2189 ms.
Running link step : cd /tmp/ltsmin3507163380087681145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3507163380087681145;'/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' 'AtomicPropp49==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2022-05-19 06:20:43] [INFO ] Flatten gal took : 83 ms
[2022-05-19 06:20:43] [INFO ] Flatten gal took : 97 ms
[2022-05-19 06:20:44] [INFO ] Input system was already deterministic with 1035 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 464 transition count 1011
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 440 transition count 1010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 986
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 413 transition count 984
Applied a total of 102 rules in 92 ms. Remains 413 /474 variables (removed 61) and now considering 984/1035 (removed 51) transitions.
[2022-05-19 06:20:44] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 06:20:44] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-19 06:20:44] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
[2022-05-19 06:20:44] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 06:20:44] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:20:45] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-19 06:20:45] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 06:20:45] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:20:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:20:46] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2022-05-19 06:20:46] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-19 06:20:46] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2022-05-19 06:20:47] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 06:20:47] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 413/474 places, 984/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 413/474 places, 984/1035 transitions.
[2022-05-19 06:20:47] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:20:47] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:20:47] [INFO ] Input system was already deterministic with 984 transitions.
[2022-05-19 06:20:47] [INFO ] Flatten gal took : 51 ms
[2022-05-19 06:20:47] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:20:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12625102293646582697.gal : 6 ms
[2022-05-19 06:20:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7516848457220879609.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12625102293646582697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7516848457220879609.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:21:17] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:21:17] [INFO ] Applying decomposition
[2022-05-19 06:21:17] [INFO ] Flatten gal took : 50 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/graph860803472547070086.txt' '-o' '/tmp/graph860803472547070086.bin' '-w' '/tmp/graph860803472547070086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph860803472547070086.bin' '-l' '-1' '-v' '-w' '/tmp/graph860803472547070086.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:21:18] [INFO ] Decomposing Gal with order
[2022-05-19 06:21:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:21:18] [INFO ] Removed a total of 2737 redundant transitions.
[2022-05-19 06:21:18] [INFO ] Flatten gal took : 107 ms
[2022-05-19 06:21:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 31 ms.
[2022-05-19 06:21:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10027535661841378073.gal : 7 ms
[2022-05-19 06:21:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1775672498647413378.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10027535661841378073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1775672498647413378.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Applied a total of 0 rules in 9 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:21:48] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:21:48] [INFO ] Computed 72 place invariants in 14 ms
[2022-05-19 06:21:48] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
[2022-05-19 06:21:48] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:21:48] [INFO ] Computed 72 place invariants in 14 ms
[2022-05-19 06:21:49] [INFO ] Implicit Places using invariants in 235 ms returned []
[2022-05-19 06:21:49] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:21:49] [INFO ] Computed 72 place invariants in 16 ms
[2022-05-19 06:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:21:50] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2022-05-19 06:21:50] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2022-05-19 06:21:50] [INFO ] Computed 72 place invariants in 17 ms
[2022-05-19 06:21:50] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 1035/1035 transitions.
[2022-05-19 06:21:50] [INFO ] Flatten gal took : 59 ms
[2022-05-19 06:21:51] [INFO ] Flatten gal took : 58 ms
[2022-05-19 06:21:51] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 06:21:51] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:21:51] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:21:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1278397416982796860.gal : 6 ms
[2022-05-19 06:21:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11387393548958370476.ctl : 273 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1278397416982796860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11387393548958370476.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:22:21] [INFO ] Flatten gal took : 56 ms
[2022-05-19 06:22:21] [INFO ] Applying decomposition
[2022-05-19 06:22:21] [INFO ] Flatten gal took : 52 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/graph16165860174888404879.txt' '-o' '/tmp/graph16165860174888404879.bin' '-w' '/tmp/graph16165860174888404879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16165860174888404879.bin' '-l' '-1' '-v' '-w' '/tmp/graph16165860174888404879.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:22:21] [INFO ] Decomposing Gal with order
[2022-05-19 06:22:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:22:22] [INFO ] Removed a total of 861 redundant transitions.
[2022-05-19 06:22:22] [INFO ] Flatten gal took : 123 ms
[2022-05-19 06:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 23 ms.
[2022-05-19 06:22:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4525525802839689780.gal : 9 ms
[2022-05-19 06:22:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3065702773889472216.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4525525802839689780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3065702773889472216.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 986
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
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 104 place count 412 transition count 983
Applied a total of 104 rules in 62 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2022-05-19 06:22:52] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:22:52] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:22:52] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
[2022-05-19 06:22:52] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:22:52] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:52] [INFO ] Implicit Places using invariants in 256 ms returned []
[2022-05-19 06:22:52] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:22:52] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:22:54] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
[2022-05-19 06:22:54] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-19 06:22:54] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:22:54] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:22:54] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 412/474 places, 983/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/474 places, 983/1035 transitions.
[2022-05-19 06:22:54] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:22:54] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:22:54] [INFO ] Input system was already deterministic with 983 transitions.
Finished random walk after 387 steps, including 28 resets, run visited all 1 properties in 7 ms. (steps per millisecond=55 )
FORMULA PolyORBNT-COL-S10J20-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 8 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:22:54] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:54] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:22:55] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
[2022-05-19 06:22:55] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:55] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:22:55] [INFO ] Implicit Places using invariants in 263 ms returned []
[2022-05-19 06:22:55] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:55] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:22:57] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2022-05-19 06:22:57] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:22:57] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:22:58] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1035/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/474 places, 1035/1035 transitions.
[2022-05-19 06:22:58] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:22:58] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:22:58] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 06:22:58] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:22:58] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2641519694834996121.gal : 6 ms
[2022-05-19 06:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7930640927396901198.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2641519694834996121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7930640927396901198.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:23:28] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:23:28] [INFO ] Applying decomposition
[2022-05-19 06:23:28] [INFO ] Flatten gal took : 53 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/graph13569154461674250215.txt' '-o' '/tmp/graph13569154461674250215.bin' '-w' '/tmp/graph13569154461674250215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13569154461674250215.bin' '-l' '-1' '-v' '-w' '/tmp/graph13569154461674250215.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:23:28] [INFO ] Decomposing Gal with order
[2022-05-19 06:23:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:23:28] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-19 06:23:28] [INFO ] Flatten gal took : 98 ms
[2022-05-19 06:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 13 ms.
[2022-05-19 06:23:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17407233158166098629.gal : 10 ms
[2022-05-19 06:23:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11789188087929219807.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17407233158166098629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11789188087929219807.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 5 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:23:59] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:23:59] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:23:59] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
[2022-05-19 06:23:59] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:23:59] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:23:59] [INFO ] Implicit Places using invariants in 167 ms returned []
[2022-05-19 06:23:59] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:23:59] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 06:24:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:24:01] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
[2022-05-19 06:24:01] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:24:01] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:24:01] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1035/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/474 places, 1035/1035 transitions.
[2022-05-19 06:24:01] [INFO ] Flatten gal took : 51 ms
[2022-05-19 06:24:01] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:24:01] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 06:24:01] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:24:02] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:24:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2696651553553985021.gal : 5 ms
[2022-05-19 06:24:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14614963243171628013.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2696651553553985021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14614963243171628013.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:24:32] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:24:32] [INFO ] Applying decomposition
[2022-05-19 06:24:32] [INFO ] Flatten gal took : 70 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/graph12691028971222913648.txt' '-o' '/tmp/graph12691028971222913648.bin' '-w' '/tmp/graph12691028971222913648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12691028971222913648.bin' '-l' '-1' '-v' '-w' '/tmp/graph12691028971222913648.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:24:32] [INFO ] Decomposing Gal with order
[2022-05-19 06:24:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:24:32] [INFO ] Removed a total of 2733 redundant transitions.
[2022-05-19 06:24:32] [INFO ] Flatten gal took : 89 ms
[2022-05-19 06:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 17 ms.
[2022-05-19 06:24:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16924633128064761260.gal : 6 ms
[2022-05-19 06:24:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4379456198283287019.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16924633128064761260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4379456198283287019.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 23 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:25:02] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:25:02] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:25:03] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
[2022-05-19 06:25:03] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:25:03] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:25:03] [INFO ] Implicit Places using invariants in 314 ms returned []
[2022-05-19 06:25:03] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:25:03] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:25:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:25:05] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2022-05-19 06:25:05] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:25:05] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:25:05] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
[2022-05-19 06:25:05] [INFO ] Flatten gal took : 46 ms
[2022-05-19 06:25:05] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:25:05] [INFO ] Input system was already deterministic with 1034 transitions.
[2022-05-19 06:25:05] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:25:06] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:25:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11174869006370021325.gal : 5 ms
[2022-05-19 06:25:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8920396219586325464.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11174869006370021325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8920396219586325464.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:25:36] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:25:36] [INFO ] Applying decomposition
[2022-05-19 06:25:36] [INFO ] Flatten gal took : 49 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/graph5367364317778124923.txt' '-o' '/tmp/graph5367364317778124923.bin' '-w' '/tmp/graph5367364317778124923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5367364317778124923.bin' '-l' '-1' '-v' '-w' '/tmp/graph5367364317778124923.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:25:36] [INFO ] Decomposing Gal with order
[2022-05-19 06:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:25:36] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-19 06:25:36] [INFO ] Flatten gal took : 102 ms
[2022-05-19 06:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 10 ms.
[2022-05-19 06:25:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17541464196000338145.gal : 7 ms
[2022-05-19 06:25:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7154648719359931660.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17541464196000338145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7154648719359931660.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 52 place count 438 transition count 986
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 52 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2022-05-19 06:26:06] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:26:06] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 06:26:07] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
[2022-05-19 06:26:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:26:07] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:26:07] [INFO ] Implicit Places using invariants in 342 ms returned []
[2022-05-19 06:26:07] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:26:07] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:26:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:26:09] [INFO ] Implicit Places using invariants and state equation in 2126 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2022-05-19 06:26:09] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 06:26:09] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:26:09] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:26:09] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 412/474 places, 983/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/474 places, 983/1035 transitions.
[2022-05-19 06:26:09] [INFO ] Flatten gal took : 45 ms
[2022-05-19 06:26:10] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:26:10] [INFO ] Input system was already deterministic with 983 transitions.
[2022-05-19 06:26:10] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:26:10] [INFO ] Flatten gal took : 80 ms
[2022-05-19 06:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11866294908348778670.gal : 4 ms
[2022-05-19 06:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11825416015336314972.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11866294908348778670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11825416015336314972.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:26:40] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:26:40] [INFO ] Applying decomposition
[2022-05-19 06:26:40] [INFO ] Flatten gal took : 48 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/graph8782633441341578651.txt' '-o' '/tmp/graph8782633441341578651.bin' '-w' '/tmp/graph8782633441341578651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8782633441341578651.bin' '-l' '-1' '-v' '-w' '/tmp/graph8782633441341578651.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:26:40] [INFO ] Decomposing Gal with order
[2022-05-19 06:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:26:40] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-19 06:26:40] [INFO ] Flatten gal took : 85 ms
[2022-05-19 06:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 15 ms.
[2022-05-19 06:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9457849844855820799.gal : 6 ms
[2022-05-19 06:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14556647662739563282.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9457849844855820799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14556647662739563282.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 460 transition count 1031
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 8 place count 460 transition count 1006
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 58 place count 435 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 434 transition count 1005
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 434 transition count 1005
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 432 transition count 1003
Applied a total of 64 rules in 50 ms. Remains 432 /474 variables (removed 42) and now considering 1003/1035 (removed 32) transitions.
[2022-05-19 06:27:10] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2022-05-19 06:27:10] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 06:27:11] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
[2022-05-19 06:27:11] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2022-05-19 06:27:11] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:27:11] [INFO ] Implicit Places using invariants in 219 ms returned []
[2022-05-19 06:27:11] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2022-05-19 06:27:11] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 06:27:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:27:12] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2022-05-19 06:27:12] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-19 06:27:12] [INFO ] Flow matrix only has 994 transitions (discarded 9 similar events)
// Phase 1: matrix 994 rows 432 cols
[2022-05-19 06:27:12] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 06:27:12] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 432/474 places, 1003/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/474 places, 1003/1035 transitions.
[2022-05-19 06:27:12] [INFO ] Flatten gal took : 47 ms
[2022-05-19 06:27:12] [INFO ] Flatten gal took : 85 ms
[2022-05-19 06:27:13] [INFO ] Input system was already deterministic with 1003 transitions.
[2022-05-19 06:27:13] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:27:13] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:27:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13250467118294250140.gal : 4 ms
[2022-05-19 06:27:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4677593670873147828.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13250467118294250140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4677593670873147828.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:27:43] [INFO ] Flatten gal took : 66 ms
[2022-05-19 06:27:43] [INFO ] Applying decomposition
[2022-05-19 06:27:43] [INFO ] Flatten gal took : 51 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/graph18193433478153509671.txt' '-o' '/tmp/graph18193433478153509671.bin' '-w' '/tmp/graph18193433478153509671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18193433478153509671.bin' '-l' '-1' '-v' '-w' '/tmp/graph18193433478153509671.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:27:43] [INFO ] Decomposing Gal with order
[2022-05-19 06:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:27:43] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-19 06:27:43] [INFO ] Flatten gal took : 92 ms
[2022-05-19 06:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 267 labels/synchronizations in 13 ms.
[2022-05-19 06:27:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8615156917112326298.gal : 5 ms
[2022-05-19 06:27:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5012992473165329776.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8615156917112326298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5012992473165329776.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 23 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:28:13] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:28:13] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:28:14] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2022-05-19 06:28:14] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:28:14] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:28:14] [INFO ] Implicit Places using invariants in 321 ms returned []
[2022-05-19 06:28:14] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:28:14] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 06:28:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:28:16] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2022-05-19 06:28:16] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:28:16] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:28:16] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
[2022-05-19 06:28:16] [INFO ] Flatten gal took : 46 ms
[2022-05-19 06:28:16] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:28:17] [INFO ] Input system was already deterministic with 1034 transitions.
[2022-05-19 06:28:17] [INFO ] Flatten gal took : 77 ms
[2022-05-19 06:28:17] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability436203942504627971.gal : 4 ms
[2022-05-19 06:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16793684923704405169.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability436203942504627971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16793684923704405169.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:28:47] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:28:47] [INFO ] Applying decomposition
[2022-05-19 06:28:47] [INFO ] Flatten gal took : 49 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/graph11068703511191384106.txt' '-o' '/tmp/graph11068703511191384106.bin' '-w' '/tmp/graph11068703511191384106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11068703511191384106.bin' '-l' '-1' '-v' '-w' '/tmp/graph11068703511191384106.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:28:47] [INFO ] Decomposing Gal with order
[2022-05-19 06:28:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:28:47] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-19 06:28:47] [INFO ] Flatten gal took : 80 ms
[2022-05-19 06:28:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 6 ms.
[2022-05-19 06:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7995842549218219742.gal : 8 ms
[2022-05-19 06:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5109320417472767865.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7995842549218219742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5109320417472767865.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 15 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:29:17] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:29:17] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-19 06:29:18] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
[2022-05-19 06:29:18] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:29:18] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:29:18] [INFO ] Implicit Places using invariants in 314 ms returned []
[2022-05-19 06:29:18] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:29:18] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:29:20] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 2547 ms to find 0 implicit places.
[2022-05-19 06:29:20] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2022-05-19 06:29:20] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:29:21] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 463/474 places, 1034/1035 transitions.
[2022-05-19 06:29:21] [INFO ] Flatten gal took : 67 ms
[2022-05-19 06:29:21] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:29:21] [INFO ] Input system was already deterministic with 1034 transitions.
[2022-05-19 06:29:21] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:29:21] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:29:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14770112446259978240.gal : 5 ms
[2022-05-19 06:29:21] [INFO ] Time to serialize properties into /tmp/CTLFireability648256849282655649.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14770112446259978240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability648256849282655649.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:29:51] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:29:51] [INFO ] Applying decomposition
[2022-05-19 06:29:51] [INFO ] Flatten gal took : 49 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/graph17048567908714919809.txt' '-o' '/tmp/graph17048567908714919809.bin' '-w' '/tmp/graph17048567908714919809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17048567908714919809.bin' '-l' '-1' '-v' '-w' '/tmp/graph17048567908714919809.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:29:51] [INFO ] Decomposing Gal with order
[2022-05-19 06:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:29:51] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-19 06:29:51] [INFO ] Flatten gal took : 84 ms
[2022-05-19 06:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 227 labels/synchronizations in 6 ms.
[2022-05-19 06:29:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3788080655041974339.gal : 7 ms
[2022-05-19 06:29:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2871668272736592159.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3788080655041974339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2871668272736592159.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 8 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:30:21] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:30:21] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:30:22] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
[2022-05-19 06:30:22] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:30:22] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:30:22] [INFO ] Implicit Places using invariants in 234 ms returned []
[2022-05-19 06:30:22] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:30:22] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:30:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:30:24] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2022-05-19 06:30:24] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:30:24] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 06:30:25] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1035/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/474 places, 1035/1035 transitions.
[2022-05-19 06:30:25] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:30:25] [INFO ] Flatten gal took : 51 ms
[2022-05-19 06:30:25] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 06:30:25] [INFO ] Flatten gal took : 68 ms
[2022-05-19 06:30:25] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:30:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1739793836790802114.gal : 4 ms
[2022-05-19 06:30:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13356403573012931093.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1739793836790802114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13356403573012931093.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:30:55] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:30:55] [INFO ] Applying decomposition
[2022-05-19 06:30:55] [INFO ] Flatten gal took : 49 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/graph4390231721832207068.txt' '-o' '/tmp/graph4390231721832207068.bin' '-w' '/tmp/graph4390231721832207068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4390231721832207068.bin' '-l' '-1' '-v' '-w' '/tmp/graph4390231721832207068.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:30:55] [INFO ] Decomposing Gal with order
[2022-05-19 06:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:30:55] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-19 06:30:55] [INFO ] Flatten gal took : 91 ms
[2022-05-19 06:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 7 ms.
[2022-05-19 06:30:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14051132858084517888.gal : 7 ms
[2022-05-19 06:30:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16535114020020473132.ctl : 1421 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14051132858084517888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16535114020020473132.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1034
Applied a total of 2 rules in 19 ms. Remains 473 /474 variables (removed 1) and now considering 1034/1035 (removed 1) transitions.
[2022-05-19 06:31:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 06:31:27] [INFO ] Computed 72 place invariants in 17 ms
[2022-05-19 06:31:27] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
[2022-05-19 06:31:27] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 06:31:27] [INFO ] Computed 72 place invariants in 14 ms
[2022-05-19 06:31:28] [INFO ] Implicit Places using invariants in 242 ms returned []
[2022-05-19 06:31:28] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 06:31:28] [INFO ] Computed 72 place invariants in 10 ms
[2022-05-19 06:31:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:31:29] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2022-05-19 06:31:29] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 473 cols
[2022-05-19 06:31:29] [INFO ] Computed 72 place invariants in 19 ms
[2022-05-19 06:31:30] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/474 places, 1034/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/474 places, 1034/1035 transitions.
[2022-05-19 06:31:30] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:31:30] [INFO ] Flatten gal took : 82 ms
[2022-05-19 06:31:30] [INFO ] Input system was already deterministic with 1034 transitions.
[2022-05-19 06:31:30] [INFO ] Flatten gal took : 75 ms
[2022-05-19 06:31:30] [INFO ] Flatten gal took : 65 ms
[2022-05-19 06:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3520188526103349383.gal : 4 ms
[2022-05-19 06:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15954619382339656160.ctl : 5 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3520188526103349383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15954619382339656160.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:32:01] [INFO ] Flatten gal took : 65 ms
[2022-05-19 06:32:01] [INFO ] Applying decomposition
[2022-05-19 06:32:01] [INFO ] Flatten gal took : 65 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/graph11762415050480995452.txt' '-o' '/tmp/graph11762415050480995452.bin' '-w' '/tmp/graph11762415050480995452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11762415050480995452.bin' '-l' '-1' '-v' '-w' '/tmp/graph11762415050480995452.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:32:01] [INFO ] Decomposing Gal with order
[2022-05-19 06:32:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:32:01] [INFO ] Removed a total of 2923 redundant transitions.
[2022-05-19 06:32:01] [INFO ] Flatten gal took : 113 ms
[2022-05-19 06:32:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 375 labels/synchronizations in 14 ms.
[2022-05-19 06:32:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2900972018603643379.gal : 5 ms
[2022-05-19 06:32:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11837535939694533339.ctl : 6 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2900972018603643379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11837535939694533339.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 460 transition count 1031
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 8 place count 460 transition count 1006
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 58 place count 435 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 434 transition count 1005
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 434 transition count 1005
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 433 transition count 1004
Applied a total of 62 rules in 43 ms. Remains 433 /474 variables (removed 41) and now considering 1004/1035 (removed 31) transitions.
[2022-05-19 06:32:31] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 06:32:31] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:32:32] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2022-05-19 06:32:32] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 06:32:32] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:32:32] [INFO ] Implicit Places using invariants in 249 ms returned []
[2022-05-19 06:32:32] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 06:32:32] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 06:32:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:32:33] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2022-05-19 06:32:33] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-19 06:32:33] [INFO ] Flow matrix only has 995 transitions (discarded 9 similar events)
// Phase 1: matrix 995 rows 433 cols
[2022-05-19 06:32:33] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:32:33] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 433/474 places, 1004/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/474 places, 1004/1035 transitions.
[2022-05-19 06:32:33] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:32:33] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:32:33] [INFO ] Input system was already deterministic with 1004 transitions.
[2022-05-19 06:32:34] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:32:34] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:32:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6661528777716777059.gal : 5 ms
[2022-05-19 06:32:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6793025405407062392.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6661528777716777059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6793025405407062392.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:33:04] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:33:04] [INFO ] Applying decomposition
[2022-05-19 06:33:04] [INFO ] Flatten gal took : 50 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/graph17187450961736928845.txt' '-o' '/tmp/graph17187450961736928845.bin' '-w' '/tmp/graph17187450961736928845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17187450961736928845.bin' '-l' '-1' '-v' '-w' '/tmp/graph17187450961736928845.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:33:04] [INFO ] Decomposing Gal with order
[2022-05-19 06:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:33:04] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-19 06:33:04] [INFO ] Flatten gal took : 91 ms
[2022-05-19 06:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 11 ms.
[2022-05-19 06:33:04] [INFO ] Time to serialize gal into /tmp/CTLFireability718418971199355481.gal : 4 ms
[2022-05-19 06:33:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14145655603490791011.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability718418971199355481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14145655603490791011.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 439 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 52 place count 438 transition count 984
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 102 place count 413 transition count 984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 42 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2022-05-19 06:33:34] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:33:34] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:33:34] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
[2022-05-19 06:33:34] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:33:35] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:33:35] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-05-19 06:33:35] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:33:35] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-19 06:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:33:37] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
[2022-05-19 06:33:37] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-19 06:33:37] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2022-05-19 06:33:37] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:33:37] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 412/474 places, 983/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/474 places, 983/1035 transitions.
[2022-05-19 06:33:37] [INFO ] Flatten gal took : 44 ms
[2022-05-19 06:33:37] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:33:37] [INFO ] Input system was already deterministic with 983 transitions.
[2022-05-19 06:33:37] [INFO ] Flatten gal took : 46 ms
[2022-05-19 06:33:37] [INFO ] Flatten gal took : 59 ms
[2022-05-19 06:33:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17512045189306804304.gal : 6 ms
[2022-05-19 06:33:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2077987125011270831.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17512045189306804304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2077987125011270831.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:34:08] [INFO ] Flatten gal took : 51 ms
[2022-05-19 06:34:08] [INFO ] Applying decomposition
[2022-05-19 06:34:08] [INFO ] Flatten gal took : 48 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/graph12027147486195209965.txt' '-o' '/tmp/graph12027147486195209965.bin' '-w' '/tmp/graph12027147486195209965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12027147486195209965.bin' '-l' '-1' '-v' '-w' '/tmp/graph12027147486195209965.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:34:08] [INFO ] Decomposing Gal with order
[2022-05-19 06:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:34:08] [INFO ] Removed a total of 2736 redundant transitions.
[2022-05-19 06:34:08] [INFO ] Flatten gal took : 86 ms
[2022-05-19 06:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 12 ms.
[2022-05-19 06:34:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12742748589445140436.gal : 4 ms
[2022-05-19 06:34:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15351963105542202409.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12742748589445140436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15351963105542202409.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 1033
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 462 transition count 1033
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 4 place count 462 transition count 1007
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 56 place count 436 transition count 1007
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 434 transition count 1005
Applied a total of 60 rules in 28 ms. Remains 434 /474 variables (removed 40) and now considering 1005/1035 (removed 30) transitions.
[2022-05-19 06:34:38] [INFO ] Flow matrix only has 996 transitions (discarded 9 similar events)
// Phase 1: matrix 996 rows 434 cols
[2022-05-19 06:34:38] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:34:38] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
[2022-05-19 06:34:38] [INFO ] Flow matrix only has 996 transitions (discarded 9 similar events)
// Phase 1: matrix 996 rows 434 cols
[2022-05-19 06:34:38] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:34:39] [INFO ] Implicit Places using invariants in 223 ms returned []
[2022-05-19 06:34:39] [INFO ] Flow matrix only has 996 transitions (discarded 9 similar events)
// Phase 1: matrix 996 rows 434 cols
[2022-05-19 06:34:39] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:34:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:34:40] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2022-05-19 06:34:40] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-19 06:34:40] [INFO ] Flow matrix only has 996 transitions (discarded 9 similar events)
// Phase 1: matrix 996 rows 434 cols
[2022-05-19 06:34:40] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:34:40] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 434/474 places, 1005/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/474 places, 1005/1035 transitions.
[2022-05-19 06:34:40] [INFO ] Flatten gal took : 45 ms
[2022-05-19 06:34:40] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:34:40] [INFO ] Input system was already deterministic with 1005 transitions.
[2022-05-19 06:34:40] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:34:41] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:34:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1958297809882145307.gal : 4 ms
[2022-05-19 06:34:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17916445383370951259.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1958297809882145307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17916445383370951259.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:35:11] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:35:11] [INFO ] Applying decomposition
[2022-05-19 06:35:11] [INFO ] Flatten gal took : 49 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/graph15399514259495598915.txt' '-o' '/tmp/graph15399514259495598915.bin' '-w' '/tmp/graph15399514259495598915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15399514259495598915.bin' '-l' '-1' '-v' '-w' '/tmp/graph15399514259495598915.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:35:11] [INFO ] Decomposing Gal with order
[2022-05-19 06:35:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:35:11] [INFO ] Removed a total of 656 redundant transitions.
[2022-05-19 06:35:11] [INFO ] Flatten gal took : 82 ms
[2022-05-19 06:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 5 ms.
[2022-05-19 06:35:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6584964088166264141.gal : 7 ms
[2022-05-19 06:35:11] [INFO ] Time to serialize properties into /tmp/CTLFireability18222020433033821176.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6584964088166264141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18222020433033821176.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 8 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2022-05-19 06:35:41] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:35:41] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:35:41] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2022-05-19 06:35:41] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:35:41] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:35:42] [INFO ] Implicit Places using invariants in 293 ms returned []
[2022-05-19 06:35:42] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:35:42] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:35:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:35:44] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
[2022-05-19 06:35:44] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2022-05-19 06:35:44] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:35:44] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 464/474 places, 1035/1035 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/474 places, 1035/1035 transitions.
[2022-05-19 06:35:44] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:35:44] [INFO ] Flatten gal took : 51 ms
[2022-05-19 06:35:44] [INFO ] Input system was already deterministic with 1035 transitions.
[2022-05-19 06:35:44] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:35:44] [INFO ] Flatten gal took : 49 ms
[2022-05-19 06:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3759645138856841115.gal : 4 ms
[2022-05-19 06:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2346428997142762705.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3759645138856841115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2346428997142762705.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:36:14] [INFO ] Flatten gal took : 50 ms
[2022-05-19 06:36:14] [INFO ] Applying decomposition
[2022-05-19 06:36:15] [INFO ] Flatten gal took : 49 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/graph14031116685389000913.txt' '-o' '/tmp/graph14031116685389000913.bin' '-w' '/tmp/graph14031116685389000913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14031116685389000913.bin' '-l' '-1' '-v' '-w' '/tmp/graph14031116685389000913.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:36:15] [INFO ] Decomposing Gal with order
[2022-05-19 06:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:36:15] [INFO ] Removed a total of 671 redundant transitions.
[2022-05-19 06:36:15] [INFO ] Flatten gal took : 91 ms
[2022-05-19 06:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 227 labels/synchronizations in 6 ms.
[2022-05-19 06:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2478434891260020075.gal : 5 ms
[2022-05-19 06:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5429711070110907559.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2478434891260020075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5429711070110907559.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 06:36:45] [INFO ] Flatten gal took : 83 ms
[2022-05-19 06:36:45] [INFO ] Flatten gal took : 81 ms
[2022-05-19 06:36:46] [INFO ] Applying decomposition
[2022-05-19 06:36:46] [INFO ] Flatten gal took : 81 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/graph2840596266557363754.txt' '-o' '/tmp/graph2840596266557363754.bin' '-w' '/tmp/graph2840596266557363754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2840596266557363754.bin' '-l' '-1' '-v' '-w' '/tmp/graph2840596266557363754.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:36:46] [INFO ] Decomposing Gal with order
[2022-05-19 06:36:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:36:46] [INFO ] Removed a total of 2923 redundant transitions.
[2022-05-19 06:36:46] [INFO ] Flatten gal took : 130 ms
[2022-05-19 06:36:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 13 ms.
[2022-05-19 06:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3631830957037718730.gal : 5 ms
[2022-05-19 06:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10363450265383825427.ctl : 13 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3631830957037718730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10363450265383825427.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2022-05-19 07:04:19] [INFO ] Applying decomposition
[2022-05-19 07:04:20] [INFO ] Flatten gal took : 376 ms
[2022-05-19 07:04:20] [INFO ] Decomposing Gal with order
[2022-05-19 07:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:04:21] [INFO ] Removed a total of 5756 redundant transitions.
[2022-05-19 07:04:21] [INFO ] Flatten gal took : 654 ms
[2022-05-19 07:04:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 59 ms.
[2022-05-19 07:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17842574725527901792.gal : 31 ms
[2022-05-19 07:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15892138950597055441.ctl : 45 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17842574725527901792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15892138950597055441.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 CTLFireability -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 3600 -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-S10J20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017200770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;