Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-6B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K May 18 16:43 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 NoC3x3-PT-6B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716693926964

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 03:25:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:25:28] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-26 03:25:28] [INFO ] Transformed 1544 places.
[2024-05-26 03:25:28] [INFO ] Transformed 2229 transitions.
[2024-05-26 03:25:28] [INFO ] Found NUPN structural information;
[2024-05-26 03:25:29] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 363 places :
Symmetric choice reduction at 0 with 363 rule applications. Total rules 363 place count 1181 transition count 1866
Iterating global reduction 0 with 363 rules applied. Total rules applied 726 place count 1181 transition count 1866
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 832 place count 1075 transition count 1660
Iterating global reduction 0 with 106 rules applied. Total rules applied 938 place count 1075 transition count 1660
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 1027 place count 986 transition count 1513
Iterating global reduction 0 with 89 rules applied. Total rules applied 1116 place count 986 transition count 1513
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1135 place count 967 transition count 1475
Iterating global reduction 0 with 19 rules applied. Total rules applied 1154 place count 967 transition count 1475
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1167 place count 954 transition count 1445
Iterating global reduction 0 with 13 rules applied. Total rules applied 1180 place count 954 transition count 1445
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 1192 place count 942 transition count 1433
Iterating global reduction 0 with 12 rules applied. Total rules applied 1204 place count 942 transition count 1433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1207 place count 939 transition count 1427
Iterating global reduction 0 with 3 rules applied. Total rules applied 1210 place count 939 transition count 1427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1213 place count 936 transition count 1421
Iterating global reduction 0 with 3 rules applied. Total rules applied 1216 place count 936 transition count 1421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1219 place count 933 transition count 1418
Iterating global reduction 0 with 3 rules applied. Total rules applied 1222 place count 933 transition count 1418
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1230 place count 933 transition count 1410
Applied a total of 1230 rules in 604 ms. Remains 933 /1544 variables (removed 611) and now considering 1410/2229 (removed 819) transitions.
// Phase 1: matrix 1410 rows 933 cols
[2024-05-26 03:25:29] [INFO ] Computed 66 invariants in 30 ms
[2024-05-26 03:25:30] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-26 03:25:30] [INFO ] Invariant cache hit.
[2024-05-26 03:25:30] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-05-26 03:25:30] [INFO ] Invariant cache hit.
[2024-05-26 03:25:31] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 933/1544 places, 1410/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2249 ms. Remains : 933/1544 places, 1410/2229 transitions.
Support contains 47 out of 933 places after structural reductions.
[2024-05-26 03:25:31] [INFO ] Flatten gal took : 118 ms
[2024-05-26 03:25:31] [INFO ] Flatten gal took : 74 ms
[2024-05-26 03:25:31] [INFO ] Input system was already deterministic with 1410 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 34) seen :28
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-26 03:25:32] [INFO ] Invariant cache hit.
[2024-05-26 03:25:32] [INFO ] [Real]Absence check using 66 positive place invariants in 40 ms returned sat
[2024-05-26 03:25:32] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 03:25:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 32 ms returned sat
[2024-05-26 03:25:33] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 03:25:34] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 9 ms to minimize.
[2024-05-26 03:25:34] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 1 ms to minimize.
[2024-05-26 03:25:34] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2024-05-26 03:25:34] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 0 ms to minimize.
[2024-05-26 03:25:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 911 ms
[2024-05-26 03:25:35] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-05-26 03:25:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-26 03:25:35] [INFO ] After 2088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 220 ms.
[2024-05-26 03:25:35] [INFO ] After 2574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 41 ms.
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 933 transition count 1373
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 896 transition count 1373
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 74 place count 896 transition count 1277
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 266 place count 800 transition count 1277
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 300 place count 766 transition count 1109
Iterating global reduction 2 with 34 rules applied. Total rules applied 334 place count 766 transition count 1109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 766 transition count 1108
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 765 transition count 1108
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 759 transition count 1091
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 759 transition count 1091
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 759 transition count 1090
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 351 place count 757 transition count 1085
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 757 transition count 1085
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 709 place count 579 transition count 907
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 710 place count 578 transition count 905
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 578 transition count 905
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 913 place count 477 transition count 935
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 993 place count 437 transition count 957
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1017 place count 437 transition count 933
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 1040 place count 437 transition count 910
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1077 place count 414 transition count 896
Applied a total of 1077 rules in 342 ms. Remains 414 /933 variables (removed 519) and now considering 896/1410 (removed 514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 414/933 places, 896/1410 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 896 rows 414 cols
[2024-05-26 03:25:36] [INFO ] Computed 66 invariants in 21 ms
[2024-05-26 03:25:36] [INFO ] [Real]Absence check using 66 positive place invariants in 11 ms returned sat
[2024-05-26 03:25:36] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:25:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 14 ms returned sat
[2024-05-26 03:25:36] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:25:36] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:25:36] [INFO ] After 64ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 03:25:36] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-26 03:25:36] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 49 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 4 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1389
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 123 ms. Remains 901 /933 variables (removed 32) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2024-05-26 03:25:37] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 03:25:37] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-26 03:25:37] [INFO ] Invariant cache hit.
[2024-05-26 03:25:38] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2024-05-26 03:25:38] [INFO ] Invariant cache hit.
[2024-05-26 03:25:39] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1802 ms. Remains : 901/933 places, 1353/1410 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 306 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s431 0) (EQ s496 0)), p1:(AND (EQ s577 1) (EQ s662 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45160 steps with 99 reset in 209 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 2368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(p1||X(p2)))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 909 transition count 1363
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 909 transition count 1363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 905 transition count 1358
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 905 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 905 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 904 transition count 1356
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 904 transition count 1356
Applied a total of 59 rules in 124 ms. Remains 904 /933 variables (removed 29) and now considering 1356/1410 (removed 54) transitions.
// Phase 1: matrix 1356 rows 904 cols
[2024-05-26 03:25:39] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 03:25:40] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-26 03:25:40] [INFO ] Invariant cache hit.
[2024-05-26 03:25:41] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2024-05-26 03:25:41] [INFO ] Invariant cache hit.
[2024-05-26 03:25:41] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/933 places, 1356/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1874 ms. Remains : 904/933 places, 1356/1410 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s266 0), p2:(EQ s183 0), p0:(OR (EQ s654 1) (EQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1925 reset in 261 ms.
Stack based approach found an accepted trace after 87637 steps with 1693 reset with depth 32 and stack size 32 in 241 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 2531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((G(p1)&&F(p2)))))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1375
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1375
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1359
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1354
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1352
Applied a total of 65 rules in 97 ms. Remains 901 /933 variables (removed 32) and now considering 1352/1410 (removed 58) transitions.
// Phase 1: matrix 1352 rows 901 cols
[2024-05-26 03:25:42] [INFO ] Computed 66 invariants in 14 ms
[2024-05-26 03:25:42] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-26 03:25:42] [INFO ] Invariant cache hit.
[2024-05-26 03:25:43] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2024-05-26 03:25:43] [INFO ] Invariant cache hit.
[2024-05-26 03:25:44] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1352/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1849 ms. Remains : 901/933 places, 1352/1410 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(OR (EQ s401 0) (EQ s453 0)), p0:(AND (EQ s401 1) (EQ s453 1)), p2:(OR (EQ s421 0) (EQ s567 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 228 reset in 357 ms.
Product exploration explored 100000 steps with 223 reset in 331 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Finished random walk after 6022 steps, including 12 resets, run visited all 3 properties in 93 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Applied a total of 0 rules in 15 ms. Remains 901 /901 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
[2024-05-26 03:25:46] [INFO ] Invariant cache hit.
[2024-05-26 03:25:46] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-26 03:25:46] [INFO ] Invariant cache hit.
[2024-05-26 03:25:47] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2024-05-26 03:25:47] [INFO ] Invariant cache hit.
[2024-05-26 03:25:47] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1752 ms. Remains : 901/901 places, 1352/1352 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:25:48] [INFO ] Invariant cache hit.
[2024-05-26 03:25:48] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:25:48] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2024-05-26 03:25:48] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:25:49] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 1 ms to minimize.
[2024-05-26 03:25:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2024-05-26 03:25:49] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-26 03:25:49] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 1352/1352 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 901 transition count 1325
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 874 transition count 1325
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 874 transition count 1228
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 777 transition count 1228
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 273 place count 752 transition count 1077
Iterating global reduction 2 with 25 rules applied. Total rules applied 298 place count 752 transition count 1077
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 654 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 856 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 934 place count 434 transition count 951
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 958 place count 434 transition count 927
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 981 place count 434 transition count 904
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1018 place count 411 transition count 890
Applied a total of 1018 rules in 122 ms. Remains 411 /901 variables (removed 490) and now considering 890/1352 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 411/901 places, 890/1352 transitions.
Finished random walk after 8439 steps, including 58 resets, run visited all 1 properties in 43 ms. (steps per millisecond=196 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Entered a terminal (fully accepting) state of product in 69783 steps with 155 reset in 175 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 8287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 301 place count 765 transition count 1109
Iterating global reduction 2 with 33 rules applied. Total rules applied 334 place count 765 transition count 1109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 765 transition count 1108
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 764 transition count 1108
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 759 transition count 1093
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 759 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 757 transition count 1087
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 757 transition count 1087
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 709 place count 578 transition count 908
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 711 place count 576 transition count 904
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 576 transition count 904
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 575 transition count 902
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 575 transition count 902
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 474 transition count 932
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 995 place count 435 transition count 947
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1019 place count 435 transition count 923
Applied a total of 1019 rules in 189 ms. Remains 435 /933 variables (removed 498) and now considering 923/1410 (removed 487) transitions.
// Phase 1: matrix 923 rows 435 cols
[2024-05-26 03:25:50] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 03:25:50] [INFO ] Implicit Places using invariants in 218 ms returned [10, 45, 93, 132, 193, 275, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 221 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/933 places, 923/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 899
Applied a total of 48 rules in 20 ms. Remains 402 /426 variables (removed 24) and now considering 899/923 (removed 24) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 03:25:50] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:25:51] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-26 03:25:51] [INFO ] Invariant cache hit.
[2024-05-26 03:25:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:25:51] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/933 places, 899/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1181 ms. Remains : 402/933 places, 899/1410 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s131 0)), p1:(EQ s203 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 684 reset in 410 ms.
Product exploration explored 100000 steps with 689 reset in 419 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:25:52] [INFO ] Invariant cache hit.
[2024-05-26 03:25:52] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:25:52] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 03:25:53] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:25:53] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:25:53] [INFO ] After 70ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:25:53] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-26 03:25:53] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 26 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 397442 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397442 steps, saw 103230 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2024-05-26 03:25:56] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 03:25:56] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:25:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 03:25:56] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:25:56] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:25:56] [INFO ] After 45ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:25:56] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-26 03:25:56] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 15 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-26 03:25:56] [INFO ] Invariant cache hit.
[2024-05-26 03:25:57] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-26 03:25:57] [INFO ] Invariant cache hit.
[2024-05-26 03:25:57] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:25:57] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-26 03:25:57] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-26 03:25:57] [INFO ] Invariant cache hit.
[2024-05-26 03:25:58] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1190 ms. Remains : 377/377 places, 860/860 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 29 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2024-05-26 03:25:58] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:25:58] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:25:58] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 03:25:58] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:25:58] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-26 03:25:58] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 03:25:58] [INFO ] Computed 57 invariants in 10 ms
[2024-05-26 03:25:58] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 03:25:58] [INFO ] Invariant cache hit.
[2024-05-26 03:25:59] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:25:59] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2024-05-26 03:25:59] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-26 03:25:59] [INFO ] Invariant cache hit.
[2024-05-26 03:25:59] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1113 ms. Remains : 402/402 places, 899/899 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:26:00] [INFO ] Invariant cache hit.
[2024-05-26 03:26:00] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:26:00] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 03:26:00] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:26:00] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:26:00] [INFO ] After 67ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:26:00] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-26 03:26:00] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 20 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 407786 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407786 steps, saw 105030 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2024-05-26 03:26:03] [INFO ] Computed 57 invariants in 11 ms
[2024-05-26 03:26:03] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:26:03] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 03:26:04] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:26:04] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:26:04] [INFO ] After 52ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:26:04] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-26 03:26:04] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 14 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-26 03:26:04] [INFO ] Invariant cache hit.
[2024-05-26 03:26:04] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-26 03:26:04] [INFO ] Invariant cache hit.
[2024-05-26 03:26:04] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:26:04] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2024-05-26 03:26:04] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-26 03:26:04] [INFO ] Invariant cache hit.
[2024-05-26 03:26:05] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1052 ms. Remains : 377/377 places, 860/860 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 24 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2024-05-26 03:26:05] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 03:26:05] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:26:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 03:26:05] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:26:05] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-26 03:26:05] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 689 reset in 380 ms.
Product exploration explored 100000 steps with 677 reset in 426 ms.
Built C files in :
/tmp/ltsmin1433415388802837208
[2024-05-26 03:26:06] [INFO ] Computing symmetric may disable matrix : 899 transitions.
[2024-05-26 03:26:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:26:06] [INFO ] Computing symmetric may enable matrix : 899 transitions.
[2024-05-26 03:26:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:26:06] [INFO ] Computing Do-Not-Accords matrix : 899 transitions.
[2024-05-26 03:26:06] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:26:06] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1433415388802837208
Running compilation step : cd /tmp/ltsmin1433415388802837208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2516 ms.
Running link step : cd /tmp/ltsmin1433415388802837208;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin1433415388802837208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12841533185531740242.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 03:26:21] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:26:22] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-26 03:26:22] [INFO ] Invariant cache hit.
[2024-05-26 03:26:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:26:22] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-26 03:26:22] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 03:26:22] [INFO ] Invariant cache hit.
[2024-05-26 03:26:22] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1080 ms. Remains : 402/402 places, 899/899 transitions.
Built C files in :
/tmp/ltsmin4496001981866634596
[2024-05-26 03:26:22] [INFO ] Computing symmetric may disable matrix : 899 transitions.
[2024-05-26 03:26:22] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:26:22] [INFO ] Computing symmetric may enable matrix : 899 transitions.
[2024-05-26 03:26:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:26:23] [INFO ] Computing Do-Not-Accords matrix : 899 transitions.
[2024-05-26 03:26:23] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:26:23] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4496001981866634596
Running compilation step : cd /tmp/ltsmin4496001981866634596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2298 ms.
Running link step : cd /tmp/ltsmin4496001981866634596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4496001981866634596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14240394278782518432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 03:26:38] [INFO ] Flatten gal took : 51 ms
[2024-05-26 03:26:38] [INFO ] Flatten gal took : 43 ms
[2024-05-26 03:26:38] [INFO ] Time to serialize gal into /tmp/LTL11353075553718220367.gal : 7 ms
[2024-05-26 03:26:38] [INFO ] Time to serialize properties into /tmp/LTL16952911071996014702.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11353075553718220367.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18403458781874118516.hoa' '-atoms' '/tmp/LTL16952911071996014702.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16952911071996014702.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18403458781874118516.hoa
Detected timeout of ITS tools.
[2024-05-26 03:26:53] [INFO ] Flatten gal took : 50 ms
[2024-05-26 03:26:53] [INFO ] Flatten gal took : 37 ms
[2024-05-26 03:26:53] [INFO ] Time to serialize gal into /tmp/LTL12230195927517969876.gal : 6 ms
[2024-05-26 03:26:53] [INFO ] Time to serialize properties into /tmp/LTL1420029335683245479.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12230195927517969876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1420029335683245479.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p436==0)||(p521==0))"))||(X(("(p808==0)")&&(G(F("(p808==0)"))))))))
Formula 0 simplified : G(F!"((p436==0)||(p521==0))" & X(!"(p808==0)" | FG!"(p808==0)"))
Detected timeout of ITS tools.
[2024-05-26 03:27:08] [INFO ] Flatten gal took : 35 ms
[2024-05-26 03:27:08] [INFO ] Applying decomposition
[2024-05-26 03:27:08] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1092854600654441492.txt' '-o' '/tmp/graph1092854600654441492.bin' '-w' '/tmp/graph1092854600654441492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1092854600654441492.bin' '-l' '-1' '-v' '-w' '/tmp/graph1092854600654441492.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:27:08] [INFO ] Decomposing Gal with order
[2024-05-26 03:27:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:27:08] [INFO ] Removed a total of 690 redundant transitions.
[2024-05-26 03:27:08] [INFO ] Flatten gal took : 133 ms
[2024-05-26 03:27:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 51 ms.
[2024-05-26 03:27:08] [INFO ] Time to serialize gal into /tmp/LTL16265423674447220875.gal : 11 ms
[2024-05-26 03:27:08] [INFO ] Time to serialize properties into /tmp/LTL1965046202101146135.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16265423674447220875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1965046202101146135.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.u10.p436==0)||(i3.u10.p521==0))"))||(X(("(i4.i0.u15.p808==0)")&&(G(F("(i4.i0.u15.p808==0)"))))))))
Formula 0 simplified : G(F!"((i3.u10.p436==0)||(i3.u10.p521==0))" & X(!"(i4.i0.u15.p808==0)" | FG!"(i4.i0.u15.p808==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14744566947846845183
[2024-05-26 03:27:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14744566947846845183
Running compilation step : cd /tmp/ltsmin14744566947846845183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1478 ms.
Running link step : cd /tmp/ltsmin14744566947846845183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14744566947846845183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 108531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1389
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 100 ms. Remains 901 /933 variables (removed 32) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2024-05-26 03:27:39] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 03:27:39] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-26 03:27:39] [INFO ] Invariant cache hit.
[2024-05-26 03:27:40] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-26 03:27:40] [INFO ] Invariant cache hit.
[2024-05-26 03:27:40] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 901/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), p2, (NOT p1), (AND p0 p2), (AND p2 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 8}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (EQ s136 1) (EQ s224 1)), p1:(NEQ s372 1), p2:(AND (EQ s83 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99512 steps with 227 reset in 306 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 2476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 299 place count 767 transition count 1117
Iterating global reduction 2 with 31 rules applied. Total rules applied 330 place count 767 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 334 place count 763 transition count 1109
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 763 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 763 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 762 transition count 1106
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 762 transition count 1106
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 701 place count 582 transition count 926
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 703 place count 580 transition count 922
Iterating global reduction 3 with 2 rules applied. Total rules applied 705 place count 580 transition count 922
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 706 place count 579 transition count 920
Iterating global reduction 3 with 1 rules applied. Total rules applied 707 place count 579 transition count 920
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 909 place count 478 transition count 952
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 987 place count 439 transition count 968
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 1012 place count 439 transition count 943
Applied a total of 1012 rules in 152 ms. Remains 439 /933 variables (removed 494) and now considering 943/1410 (removed 467) transitions.
[2024-05-26 03:27:41] [INFO ] Flow matrix only has 941 transitions (discarded 2 similar events)
// Phase 1: matrix 941 rows 439 cols
[2024-05-26 03:27:41] [INFO ] Computed 66 invariants in 2 ms
[2024-05-26 03:27:41] [INFO ] Implicit Places using invariants in 231 ms returned [12, 47, 95, 134, 194, 274, 324, 365, 417]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 233 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/933 places, 943/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 406 transition count 919
Applied a total of 48 rules in 16 ms. Remains 406 /430 variables (removed 24) and now considering 919/943 (removed 24) transitions.
[2024-05-26 03:27:41] [INFO ] Flow matrix only has 917 transitions (discarded 2 similar events)
// Phase 1: matrix 917 rows 406 cols
[2024-05-26 03:27:41] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:27:42] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-26 03:27:42] [INFO ] Flow matrix only has 917 transitions (discarded 2 similar events)
[2024-05-26 03:27:42] [INFO ] Invariant cache hit.
[2024-05-26 03:27:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 03:27:42] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 406/933 places, 919/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1303 ms. Remains : 406/933 places, 919/1410 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p1:(AND (EQ s337 1) (EQ s360 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-05 finished in 1431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1||G(p2)))))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 907 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 907 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 903 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 903 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1353
Applied a total of 63 rules in 81 ms. Remains 902 /933 variables (removed 31) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 902 cols
[2024-05-26 03:27:43] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 03:27:43] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-26 03:27:43] [INFO ] Invariant cache hit.
[2024-05-26 03:27:44] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2024-05-26 03:27:44] [INFO ] Invariant cache hit.
[2024-05-26 03:27:44] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1718 ms. Remains : 902/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s387 1), p2:(OR (EQ s141 0) (EQ s192 0)), p0:(OR (EQ s692 0) (EQ s724 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2218 steps with 4 reset in 8 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-06 finished in 1961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)||(X(G(p3))&&p2))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 920 transition count 1387
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 920 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 912 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 912 transition count 1374
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 905 transition count 1358
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 905 transition count 1358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 901 transition count 1353
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 901 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 901 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 900 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 93 ms. Remains 900 /933 variables (removed 33) and now considering 1351/1410 (removed 59) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2024-05-26 03:27:45] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 03:27:45] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-26 03:27:45] [INFO ] Invariant cache hit.
[2024-05-26 03:27:46] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-26 03:27:46] [INFO ] Invariant cache hit.
[2024-05-26 03:27:46] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/933 places, 1351/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1769 ms. Remains : 900/933 places, 1351/1410 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s827 1), p2:(AND (EQ s143 1) (EQ s225 1)), p0:(EQ s509 1), p3:(AND (EQ s143 1) (EQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9349 reset in 247 ms.
Product exploration explored 100000 steps with 9389 reset in 251 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 133 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p1)), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 25 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2024-05-26 03:27:47] [INFO ] Invariant cache hit.
[2024-05-26 03:27:48] [INFO ] [Real]Absence check using 66 positive place invariants in 56 ms returned sat
[2024-05-26 03:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:27:51] [INFO ] [Real]Absence check using state equation in 3124 ms returned sat
[2024-05-26 03:27:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:27:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 162 ms returned sat
[2024-05-26 03:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 03:28:05] [INFO ] [Nat]Absence check using state equation in 13231 ms returned sat
[2024-05-26 03:28:05] [INFO ] Computed and/alt/rep : 1289/3840/1289 causal constraints (skipped 61 transitions) in 69 ms.
[2024-05-26 03:28:06] [INFO ] Added : 15 causal constraints over 3 iterations in 1063 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 1 out of 900 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1351/1351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 899 transition count 1323
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 872 transition count 1323
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 872 transition count 1226
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 775 transition count 1226
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 272 place count 751 transition count 1076
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 751 transition count 1076
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 646 place count 576 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 475 transition count 930
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 437 transition count 943
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 948 place count 437 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 949 place count 436 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 950 place count 435 transition count 918
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 954 place count 433 transition count 916
Applied a total of 954 rules in 122 ms. Remains 433 /900 variables (removed 467) and now considering 916/1351 (removed 435) transitions.
// Phase 1: matrix 916 rows 433 cols
[2024-05-26 03:28:06] [INFO ] Computed 65 invariants in 3 ms
[2024-05-26 03:28:06] [INFO ] Implicit Places using invariants in 244 ms returned [11, 47, 95, 134, 194, 275, 325, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 256 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/900 places, 916/1351 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 403 transition count 894
Applied a total of 44 rules in 15 ms. Remains 403 /425 variables (removed 22) and now considering 894/916 (removed 22) transitions.
// Phase 1: matrix 894 rows 403 cols
[2024-05-26 03:28:06] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:28:07] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-26 03:28:07] [INFO ] Invariant cache hit.
[2024-05-26 03:28:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:28:07] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 403/900 places, 894/1351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1158 ms. Remains : 403/900 places, 894/1351 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-26 03:28:08] [INFO ] Invariant cache hit.
[2024-05-26 03:28:08] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-26 03:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:28:09] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-05-26 03:28:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:28:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 49 ms returned sat
[2024-05-26 03:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 03:28:10] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-26 03:28:10] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:28:10] [INFO ] [Nat]Added 51 Read/Feed constraints in 139 ms returned sat
[2024-05-26 03:28:10] [INFO ] Computed and/alt/rep : 590/4099/590 causal constraints (skipped 298 transitions) in 57 ms.
[2024-05-26 03:28:16] [INFO ] Added : 384 causal constraints over 77 iterations in 6313 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 40335 reset in 993 ms.
Product exploration explored 100000 steps with 40129 reset in 995 ms.
Built C files in :
/tmp/ltsmin11755482728789582090
[2024-05-26 03:28:18] [INFO ] Computing symmetric may disable matrix : 894 transitions.
[2024-05-26 03:28:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:28:18] [INFO ] Computing symmetric may enable matrix : 894 transitions.
[2024-05-26 03:28:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:28:18] [INFO ] Computing Do-Not-Accords matrix : 894 transitions.
[2024-05-26 03:28:18] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:28:18] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11755482728789582090
Running compilation step : cd /tmp/ltsmin11755482728789582090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2405 ms.
Running link step : cd /tmp/ltsmin11755482728789582090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin11755482728789582090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16474977636188286491.hoa' '--buchi-type=spotba'
LTSmin run took 12200 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 48541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 893 transition count 1274
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 797 transition count 1274
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 303 place count 764 transition count 1108
Iterating global reduction 2 with 33 rules applied. Total rules applied 336 place count 764 transition count 1108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 336 place count 764 transition count 1107
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 763 transition count 1107
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 344 place count 757 transition count 1090
Iterating global reduction 2 with 6 rules applied. Total rules applied 350 place count 757 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 757 transition count 1089
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 353 place count 755 transition count 1084
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 755 transition count 1084
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 709 place count 578 transition count 907
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 711 place count 576 transition count 903
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 576 transition count 903
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 575 transition count 901
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 575 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 474 transition count 931
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 991 place count 437 transition count 943
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1015 place count 437 transition count 919
Applied a total of 1015 rules in 152 ms. Remains 437 /933 variables (removed 496) and now considering 919/1410 (removed 491) transitions.
// Phase 1: matrix 919 rows 437 cols
[2024-05-26 03:28:33] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 03:28:33] [INFO ] Implicit Places using invariants in 241 ms returned [11, 46, 94, 134, 196, 276, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 243 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/933 places, 919/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 895
Applied a total of 48 rules in 15 ms. Remains 404 /428 variables (removed 24) and now considering 895/919 (removed 24) transitions.
// Phase 1: matrix 895 rows 404 cols
[2024-05-26 03:28:33] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:28:34] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-26 03:28:34] [INFO ] Invariant cache hit.
[2024-05-26 03:28:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:28:34] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/933 places, 895/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1191 ms. Remains : 404/933 places, 895/1410 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s256 1) (EQ s284 1)), p1:(OR (EQ s107 0) (EQ s132 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 1343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 920 transition count 1387
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 920 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 912 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 912 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 906 transition count 1364
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 906 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 903 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 903 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1358
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1358
Applied a total of 63 rules in 97 ms. Remains 902 /933 variables (removed 31) and now considering 1358/1410 (removed 52) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2024-05-26 03:28:34] [INFO ] Computed 66 invariants in 15 ms
[2024-05-26 03:28:35] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-26 03:28:35] [INFO ] Invariant cache hit.
[2024-05-26 03:28:36] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2024-05-26 03:28:36] [INFO ] Invariant cache hit.
[2024-05-26 03:28:36] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1838 ms. Remains : 902/933 places, 1358/1410 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s400 1) (EQ s558 1)), p0:(AND (EQ s847 1) (EQ s897 1) (NOT (AND (EQ s761 1) (EQ s821 1)))), p2:(AND (EQ s761 1) (EQ s821 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 242 reset in 250 ms.
Product exploration explored 100000 steps with 250 reset in 274 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:28:37] [INFO ] Invariant cache hit.
[2024-05-26 03:28:37] [INFO ] [Real]Absence check using 66 positive place invariants in 29 ms returned sat
[2024-05-26 03:28:38] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-26 03:28:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2024-05-26 03:28:38] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-26 03:28:39] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-26 03:28:39] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 902 transition count 1330
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 874 transition count 1330
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 874 transition count 1235
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 779 transition count 1235
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 756 transition count 1087
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 756 transition count 1087
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 652 place count 576 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 854 place count 475 transition count 937
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 932 place count 436 transition count 957
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 958 place count 436 transition count 931
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 982 place count 436 transition count 907
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1018 place count 412 transition count 895
Applied a total of 1018 rules in 111 ms. Remains 412 /902 variables (removed 490) and now considering 895/1358 (removed 463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 412/902 places, 895/1358 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 397960 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397960 steps, saw 111569 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 412 cols
[2024-05-26 03:28:42] [INFO ] Computed 66 invariants in 3 ms
[2024-05-26 03:28:42] [INFO ] [Real]Absence check using 66 positive place invariants in 10 ms returned sat
[2024-05-26 03:28:42] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:28:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 10 ms returned sat
[2024-05-26 03:28:42] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:28:42] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 03:28:42] [INFO ] After 32ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:28:42] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-26 03:28:42] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 8 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 412/412 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 8 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-26 03:28:43] [INFO ] Invariant cache hit.
[2024-05-26 03:28:43] [INFO ] Implicit Places using invariants in 221 ms returned [10, 45, 89, 128, 184, 257, 303, 344, 392]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 223 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/412 places, 895/895 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 379 transition count 871
Applied a total of 48 rules in 14 ms. Remains 379 /403 variables (removed 24) and now considering 871/895 (removed 24) transitions.
// Phase 1: matrix 871 rows 379 cols
[2024-05-26 03:28:43] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:28:43] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 03:28:43] [INFO ] Invariant cache hit.
[2024-05-26 03:28:43] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 03:28:43] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/412 places, 871/895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 988 ms. Remains : 379/412 places, 871/895 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 344485 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344485 steps, saw 106374 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 03:28:47] [INFO ] Invariant cache hit.
[2024-05-26 03:28:47] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 03:28:47] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:28:47] [INFO ] [Nat]Absence check using 57 positive place invariants in 14 ms returned sat
[2024-05-26 03:28:47] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 03:28:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 03:28:47] [INFO ] After 59ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:28:47] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-26 03:28:47] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 64 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p2 p1 p0)))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 273 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 118 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 901 transition count 1329
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 873 transition count 1329
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 873 transition count 1234
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 778 transition count 1234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 755 transition count 1086
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 755 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 646 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 439 transition count 959
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 950 place count 439 transition count 933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 951 place count 438 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 952 place count 437 transition count 932
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 956 place count 435 transition count 930
Applied a total of 956 rules in 109 ms. Remains 435 /902 variables (removed 467) and now considering 930/1358 (removed 428) transitions.
// Phase 1: matrix 930 rows 435 cols
[2024-05-26 03:28:48] [INFO ] Computed 65 invariants in 6 ms
[2024-05-26 03:28:48] [INFO ] Implicit Places using invariants in 224 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 225 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/902 places, 930/1358 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 908
Applied a total of 44 rules in 14 ms. Remains 405 /427 variables (removed 22) and now considering 908/930 (removed 22) transitions.
// Phase 1: matrix 908 rows 405 cols
[2024-05-26 03:28:48] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:28:48] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-26 03:28:48] [INFO ] Invariant cache hit.
[2024-05-26 03:28:49] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 03:28:49] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/902 places, 908/1358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1119 ms. Remains : 405/902 places, 908/1358 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 1428 steps, including 8 resets, run visited all 3 properties in 25 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 123 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 105 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 697 reset in 382 ms.
Product exploration explored 100000 steps with 695 reset in 401 ms.
Built C files in :
/tmp/ltsmin6518879707732142420
[2024-05-26 03:28:51] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-26 03:28:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:28:51] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-26 03:28:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:28:51] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-26 03:28:51] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:28:51] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6518879707732142420
Running compilation step : cd /tmp/ltsmin6518879707732142420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2472 ms.
Running link step : cd /tmp/ltsmin6518879707732142420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6518879707732142420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13520809182667498978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 12 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2024-05-26 03:29:06] [INFO ] Invariant cache hit.
[2024-05-26 03:29:06] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 03:29:06] [INFO ] Invariant cache hit.
[2024-05-26 03:29:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 03:29:06] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2024-05-26 03:29:06] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-26 03:29:06] [INFO ] Invariant cache hit.
[2024-05-26 03:29:07] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1117 ms. Remains : 405/405 places, 908/908 transitions.
Built C files in :
/tmp/ltsmin9335667209450813320
[2024-05-26 03:29:07] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-26 03:29:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:29:07] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-26 03:29:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:29:07] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-26 03:29:07] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:29:07] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9335667209450813320
Running compilation step : cd /tmp/ltsmin9335667209450813320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2378 ms.
Running link step : cd /tmp/ltsmin9335667209450813320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9335667209450813320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1411369233856906219.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 03:29:22] [INFO ] Flatten gal took : 38 ms
[2024-05-26 03:29:22] [INFO ] Flatten gal took : 36 ms
[2024-05-26 03:29:22] [INFO ] Time to serialize gal into /tmp/LTL12546577058148537790.gal : 5 ms
[2024-05-26 03:29:22] [INFO ] Time to serialize properties into /tmp/LTL3985433827175587635.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12546577058148537790.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5134366461728015080.hoa' '-atoms' '/tmp/LTL3985433827175587635.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3985433827175587635.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5134366461728015080.hoa
Detected timeout of ITS tools.
[2024-05-26 03:29:37] [INFO ] Flatten gal took : 32 ms
[2024-05-26 03:29:37] [INFO ] Flatten gal took : 32 ms
[2024-05-26 03:29:37] [INFO ] Time to serialize gal into /tmp/LTL168141284240439405.gal : 5 ms
[2024-05-26 03:29:37] [INFO ] Time to serialize properties into /tmp/LTL18016573038030871327.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL168141284240439405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18016573038030871327.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))")))||(((F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))"))&&(G...220
Formula 0 simplified : G(FG!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" & (G!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" | F!"((p615=...204
Detected timeout of ITS tools.
[2024-05-26 03:29:52] [INFO ] Flatten gal took : 31 ms
[2024-05-26 03:29:52] [INFO ] Applying decomposition
[2024-05-26 03:29:52] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1726760011164603351.txt' '-o' '/tmp/graph1726760011164603351.bin' '-w' '/tmp/graph1726760011164603351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1726760011164603351.bin' '-l' '-1' '-v' '-w' '/tmp/graph1726760011164603351.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:29:52] [INFO ] Decomposing Gal with order
[2024-05-26 03:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:29:52] [INFO ] Removed a total of 693 redundant transitions.
[2024-05-26 03:29:52] [INFO ] Flatten gal took : 70 ms
[2024-05-26 03:29:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 525 labels/synchronizations in 30 ms.
[2024-05-26 03:29:52] [INFO ] Time to serialize gal into /tmp/LTL2640053741386861388.gal : 10 ms
[2024-05-26 03:29:52] [INFO ] Time to serialize properties into /tmp/LTL13094377576124939128.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2640053741386861388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13094377576124939128.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((i8.u32.p1468!=1)||(i8.u32.p1537!=1))||((i7.u31.p1306==1)&&(i7.u30.p1407==1)))")))||(((F("(((i8.u32.p1468!=1)||(i8.u32.p1...304
Formula 0 simplified : G(FG!"(((i8.u32.p1468!=1)||(i8.u32.p1537!=1))||((i7.u31.p1306==1)&&(i7.u30.p1407==1)))" & (G!"(((i8.u32.p1468!=1)||(i8.u32.p1537!=1)...288
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18028351707582175470
[2024-05-26 03:30:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18028351707582175470
Running compilation step : cd /tmp/ltsmin18028351707582175470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1395 ms.
Running link step : cd /tmp/ltsmin18028351707582175470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18028351707582175470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true))&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 108254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1377
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 907 transition count 1361
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 907 transition count 1361
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 903 transition count 1356
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 903 transition count 1356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 97 ms. Remains 902 /933 variables (removed 31) and now considering 1354/1410 (removed 56) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2024-05-26 03:30:23] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 03:30:23] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-26 03:30:23] [INFO ] Invariant cache hit.
[2024-05-26 03:30:24] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2024-05-26 03:30:24] [INFO ] Invariant cache hit.
[2024-05-26 03:30:24] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1354/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 902/933 places, 1354/1410 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s299 1) (EQ s350 1)), p0:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 224 reset in 237 ms.
Product exploration explored 100000 steps with 226 reset in 270 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:30:26] [INFO ] Invariant cache hit.
[2024-05-26 03:30:26] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:30:26] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2024-05-26 03:30:26] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:30:27] [INFO ] After 688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-26 03:30:27] [INFO ] After 952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 875 transition count 1327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 54 place count 875 transition count 1231
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 246 place count 779 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 755 transition count 1081
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 755 transition count 1081
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 650 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 852 place count 476 transition count 933
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 932 place count 436 transition count 955
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 956 place count 436 transition count 931
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 979 place count 436 transition count 908
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1016 place count 413 transition count 894
Applied a total of 1016 rules in 116 ms. Remains 413 /902 variables (removed 489) and now considering 894/1354 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 413/902 places, 894/1354 transitions.
Finished random walk after 1619 steps, including 11 resets, run visited all 2 properties in 24 ms. (steps per millisecond=67 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 13 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2024-05-26 03:30:27] [INFO ] Invariant cache hit.
[2024-05-26 03:30:28] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-26 03:30:28] [INFO ] Invariant cache hit.
[2024-05-26 03:30:29] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-26 03:30:29] [INFO ] Invariant cache hit.
[2024-05-26 03:30:29] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1710 ms. Remains : 902/902 places, 1354/1354 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:30:30] [INFO ] Invariant cache hit.
[2024-05-26 03:30:30] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:30:30] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2024-05-26 03:30:31] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:30:31] [INFO ] After 704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-26 03:30:31] [INFO ] After 985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 875 transition count 1327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 54 place count 875 transition count 1231
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 246 place count 779 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 755 transition count 1081
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 755 transition count 1081
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 650 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 852 place count 476 transition count 933
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 932 place count 436 transition count 955
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 956 place count 436 transition count 931
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 979 place count 436 transition count 908
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1016 place count 413 transition count 894
Applied a total of 1016 rules in 92 ms. Remains 413 /902 variables (removed 489) and now considering 894/1354 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 413/902 places, 894/1354 transitions.
Finished random walk after 1059 steps, including 7 resets, run visited all 2 properties in 10 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 228 reset in 231 ms.
Product exploration explored 100000 steps with 224 reset in 251 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1354
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 27 place count 902 transition count 1406
Deduced a syphon composed of 79 places in 5 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 79 place count 902 transition count 1406
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 1 with 222 rules applied. Total rules applied 301 place count 902 transition count 1406
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 382 place count 821 transition count 1199
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 463 place count 821 transition count 1199
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 487 place count 797 transition count 1175
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 511 place count 797 transition count 1175
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -308
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 612 place count 797 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 613 place count 796 transition count 1481
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 614 place count 796 transition count 1481
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 358 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 652 place count 796 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 653 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 654 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 678 place count 795 transition count 1568
Deduced a syphon composed of 357 places in 0 ms
Applied a total of 678 rules in 264 ms. Remains 795 /902 variables (removed 107) and now considering 1568/1354 (removed -214) transitions.
[2024-05-26 03:30:33] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1568 rows 795 cols
[2024-05-26 03:30:33] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 03:30:34] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 795/902 places, 1568/1354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 973 ms. Remains : 795/902 places, 1568/1354 transitions.
Built C files in :
/tmp/ltsmin1564827310898901190
[2024-05-26 03:30:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1564827310898901190
Running compilation step : cd /tmp/ltsmin1564827310898901190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2202 ms.
Running link step : cd /tmp/ltsmin1564827310898901190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1564827310898901190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18361483333490149988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 23 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2024-05-26 03:30:49] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 03:30:49] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-26 03:30:49] [INFO ] Invariant cache hit.
[2024-05-26 03:30:50] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2024-05-26 03:30:50] [INFO ] Invariant cache hit.
[2024-05-26 03:30:50] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1668 ms. Remains : 902/902 places, 1354/1354 transitions.
Built C files in :
/tmp/ltsmin16892704167561982997
[2024-05-26 03:30:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16892704167561982997
Running compilation step : cd /tmp/ltsmin16892704167561982997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2147 ms.
Running link step : cd /tmp/ltsmin16892704167561982997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16892704167561982997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15591717873456643359.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 03:31:06] [INFO ] Flatten gal took : 29 ms
[2024-05-26 03:31:06] [INFO ] Flatten gal took : 31 ms
[2024-05-26 03:31:06] [INFO ] Time to serialize gal into /tmp/LTL378557773494155883.gal : 16 ms
[2024-05-26 03:31:06] [INFO ] Time to serialize properties into /tmp/LTL10555051381628134641.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL378557773494155883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1030035326536196472.hoa' '-atoms' '/tmp/LTL10555051381628134641.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10555051381628134641.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1030035326536196472.hoa
Detected timeout of ITS tools.
[2024-05-26 03:31:21] [INFO ] Flatten gal took : 31 ms
[2024-05-26 03:31:21] [INFO ] Flatten gal took : 32 ms
[2024-05-26 03:31:21] [INFO ] Time to serialize gal into /tmp/LTL9149403155313812909.gal : 6 ms
[2024-05-26 03:31:21] [INFO ] Time to serialize properties into /tmp/LTL7623422502144455440.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9149403155313812909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7623422502144455440.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(p231==0)")))||(G("((p433==1)&&(p521==1))")))))))
Formula 0 simplified : XXX(FG!"(p231==0)" & F!"((p433==1)&&(p521==1))")
Detected timeout of ITS tools.
[2024-05-26 03:31:36] [INFO ] Flatten gal took : 30 ms
[2024-05-26 03:31:36] [INFO ] Applying decomposition
[2024-05-26 03:31:36] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16255802461793152961.txt' '-o' '/tmp/graph16255802461793152961.bin' '-w' '/tmp/graph16255802461793152961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16255802461793152961.bin' '-l' '-1' '-v' '-w' '/tmp/graph16255802461793152961.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:31:36] [INFO ] Decomposing Gal with order
[2024-05-26 03:31:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:31:36] [INFO ] Removed a total of 1276 redundant transitions.
[2024-05-26 03:31:36] [INFO ] Flatten gal took : 65 ms
[2024-05-26 03:31:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 24 ms.
[2024-05-26 03:31:36] [INFO ] Time to serialize gal into /tmp/LTL18048240197676706058.gal : 10 ms
[2024-05-26 03:31:36] [INFO ] Time to serialize properties into /tmp/LTL2105714999415834951.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18048240197676706058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2105714999415834951.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(i1.i1.u27.p231==0)")))||(G("((i5.i4.u108.p433==1)&&(i5.i3.u126.p521==1))")))))))
Formula 0 simplified : XXX(FG!"(i1.i1.u27.p231==0)" & F!"((i5.i4.u108.p433==1)&&(i5.i3.u126.p521==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17494079347764182188
[2024-05-26 03:31:51] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17494079347764182188
Running compilation step : cd /tmp/ltsmin17494079347764182188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2515 ms.
Running link step : cd /tmp/ltsmin17494079347764182188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17494079347764182188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 103661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F((!p0&&X(G(p1))))||G(p0))))))'
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1377
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 908 transition count 1363
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 908 transition count 1363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 905 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 905 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 904 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 904 transition count 1358
Applied a total of 58 rules in 111 ms. Remains 904 /933 variables (removed 29) and now considering 1358/1410 (removed 52) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2024-05-26 03:32:06] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 03:32:07] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-26 03:32:07] [INFO ] Invariant cache hit.
[2024-05-26 03:32:08] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2024-05-26 03:32:08] [INFO ] Invariant cache hit.
[2024-05-26 03:32:08] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/933 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1883 ms. Remains : 904/933 places, 1358/1410 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s646 1), p1:(EQ s667 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 2098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||X(p1))))&&F(p2)))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 922 transition count 1390
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 922 transition count 1390
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 916 transition count 1380
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 916 transition count 1380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 911 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 911 transition count 1368
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 909 transition count 1366
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 909 transition count 1366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 909 transition count 1365
Applied a total of 49 rules in 84 ms. Remains 909 /933 variables (removed 24) and now considering 1365/1410 (removed 45) transitions.
// Phase 1: matrix 1365 rows 909 cols
[2024-05-26 03:32:08] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 03:32:09] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-26 03:32:09] [INFO ] Invariant cache hit.
[2024-05-26 03:32:10] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2024-05-26 03:32:10] [INFO ] Invariant cache hit.
[2024-05-26 03:32:10] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 909/933 places, 1365/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1835 ms. Remains : 909/933 places, 1365/1410 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s627 1), p0:(AND (EQ s322 1) (EQ s386 1)), p1:(OR (EQ s577 0) (EQ s639 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 487 steps with 1 reset in 5 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-15 finished in 2032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Found a Shortening insensitive property : NoC3x3-PT-6B-LTLFireability-10
Stuttering acceptance computed with spot in 142 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 78 place count 893 transition count 1276
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 266 place count 799 transition count 1276
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 299 place count 766 transition count 1113
Iterating global reduction 2 with 33 rules applied. Total rules applied 332 place count 766 transition count 1113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 766 transition count 1112
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 765 transition count 1112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 340 place count 759 transition count 1095
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 759 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 348 place count 758 transition count 1092
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 758 transition count 1092
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 703 place count 581 transition count 915
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 705 place count 579 transition count 911
Iterating global reduction 3 with 2 rules applied. Total rules applied 707 place count 579 transition count 911
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 708 place count 578 transition count 909
Iterating global reduction 3 with 1 rules applied. Total rules applied 709 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 911 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 987 place count 439 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 988 place count 438 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 989 place count 437 transition count 958
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 4 with 4 rules applied. Total rules applied 993 place count 435 transition count 956
Applied a total of 993 rules in 155 ms. Remains 435 /933 variables (removed 498) and now considering 956/1410 (removed 454) transitions.
// Phase 1: matrix 956 rows 435 cols
[2024-05-26 03:32:11] [INFO ] Computed 65 invariants in 6 ms
[2024-05-26 03:32:11] [INFO ] Implicit Places using invariants in 240 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 243 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 427/933 places, 956/1410 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
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 405 transition count 934
Applied a total of 44 rules in 14 ms. Remains 405 /427 variables (removed 22) and now considering 934/956 (removed 22) transitions.
// Phase 1: matrix 934 rows 405 cols
[2024-05-26 03:32:11] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:32:11] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-26 03:32:11] [INFO ] Invariant cache hit.
[2024-05-26 03:32:12] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 03:32:12] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 405/933 places, 934/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1216 ms. Remains : 405/933 places, 934/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s229 1)), p0:(AND (EQ s374 1) (EQ s401 1) (NOT (AND (EQ s335 1) (EQ s359 1)))), p2:(AND (EQ s335 1) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 689 reset in 378 ms.
Product exploration explored 100000 steps with 694 reset in 406 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-26 03:32:13] [INFO ] Invariant cache hit.
[2024-05-26 03:32:13] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND p2 p1 p0)))]
False Knowledge obtained : [(F (AND p2 p1)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 284 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 106 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 934/934 transitions.
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 405 transition count 908
Applied a total of 26 rules in 22 ms. Remains 405 /405 variables (removed 0) and now considering 908/934 (removed 26) transitions.
// Phase 1: matrix 908 rows 405 cols
[2024-05-26 03:32:14] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:32:14] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-26 03:32:14] [INFO ] Invariant cache hit.
[2024-05-26 03:32:14] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 03:32:14] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2024-05-26 03:32:14] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-26 03:32:14] [INFO ] Invariant cache hit.
[2024-05-26 03:32:15] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/405 places, 908/934 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1109 ms. Remains : 405/405 places, 908/934 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 992 steps, including 6 resets, run visited all 3 properties in 24 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 103 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 104 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 687 reset in 364 ms.
Product exploration explored 100000 steps with 680 reset in 397 ms.
Built C files in :
/tmp/ltsmin8309324475374399100
[2024-05-26 03:32:16] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-26 03:32:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:32:16] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-26 03:32:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:32:16] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-26 03:32:16] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:32:16] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8309324475374399100
Running compilation step : cd /tmp/ltsmin8309324475374399100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2428 ms.
Running link step : cd /tmp/ltsmin8309324475374399100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8309324475374399100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14464249585948881913.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 15 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2024-05-26 03:32:31] [INFO ] Invariant cache hit.
[2024-05-26 03:32:32] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-26 03:32:32] [INFO ] Invariant cache hit.
[2024-05-26 03:32:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 03:32:32] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2024-05-26 03:32:32] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-26 03:32:32] [INFO ] Invariant cache hit.
[2024-05-26 03:32:32] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1138 ms. Remains : 405/405 places, 908/908 transitions.
Built C files in :
/tmp/ltsmin4620719396974875034
[2024-05-26 03:32:32] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2024-05-26 03:32:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:32:32] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2024-05-26 03:32:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:32:33] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2024-05-26 03:32:33] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:32:33] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4620719396974875034
Running compilation step : cd /tmp/ltsmin4620719396974875034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2540 ms.
Running link step : cd /tmp/ltsmin4620719396974875034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4620719396974875034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9806710502399054742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 03:32:48] [INFO ] Flatten gal took : 32 ms
[2024-05-26 03:32:48] [INFO ] Flatten gal took : 32 ms
[2024-05-26 03:32:48] [INFO ] Time to serialize gal into /tmp/LTL8268979386806558328.gal : 4 ms
[2024-05-26 03:32:48] [INFO ] Time to serialize properties into /tmp/LTL18415144663362600331.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8268979386806558328.gal' '-t' 'CGAL' '-hoa' '/tmp/aut174091427544771445.hoa' '-atoms' '/tmp/LTL18415144663362600331.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL18415144663362600331.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut174091427544771445.hoa
Detected timeout of ITS tools.
[2024-05-26 03:33:03] [INFO ] Flatten gal took : 27 ms
[2024-05-26 03:33:03] [INFO ] Flatten gal took : 28 ms
[2024-05-26 03:33:03] [INFO ] Time to serialize gal into /tmp/LTL18077931004422517674.gal : 5 ms
[2024-05-26 03:33:03] [INFO ] Time to serialize properties into /tmp/LTL4163168488001302379.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18077931004422517674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4163168488001302379.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))")))||(((F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))"))&&(G...220
Formula 0 simplified : G(FG!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" & (G!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" | F!"((p615=...204
Detected timeout of ITS tools.
[2024-05-26 03:33:18] [INFO ] Flatten gal took : 28 ms
[2024-05-26 03:33:18] [INFO ] Applying decomposition
[2024-05-26 03:33:18] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14197287971800000144.txt' '-o' '/tmp/graph14197287971800000144.bin' '-w' '/tmp/graph14197287971800000144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14197287971800000144.bin' '-l' '-1' '-v' '-w' '/tmp/graph14197287971800000144.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:33:18] [INFO ] Decomposing Gal with order
[2024-05-26 03:33:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:33:18] [INFO ] Removed a total of 734 redundant transitions.
[2024-05-26 03:33:18] [INFO ] Flatten gal took : 51 ms
[2024-05-26 03:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 644 labels/synchronizations in 33 ms.
[2024-05-26 03:33:18] [INFO ] Time to serialize gal into /tmp/LTL1271217071076104395.gal : 7 ms
[2024-05-26 03:33:18] [INFO ] Time to serialize properties into /tmp/LTL14008300167720966657.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1271217071076104395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14008300167720966657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((i8.u36.p1468!=1)||(i8.u37.p1537!=1))||((i7.u35.p1306==1)&&(i7.u34.p1407==1)))")))||(((F("(((i8.u36.p1468!=1)||(i8.u37.p1...310
Formula 0 simplified : G(FG!"(((i8.u36.p1468!=1)||(i8.u37.p1537!=1))||((i7.u35.p1306==1)&&(i7.u34.p1407==1)))" & (G!"(((i8.u36.p1468!=1)||(i8.u37.p1537!=1)...294
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3159867791413138680
[2024-05-26 03:33:33] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3159867791413138680
Running compilation step : cd /tmp/ltsmin3159867791413138680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1485 ms.
Running link step : cd /tmp/ltsmin3159867791413138680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3159867791413138680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true))&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 97766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-12
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 301 place count 765 transition count 1108
Iterating global reduction 2 with 33 rules applied. Total rules applied 334 place count 765 transition count 1108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 765 transition count 1107
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 336 place count 764 transition count 1107
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 759 transition count 1092
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 759 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1091
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 757 transition count 1086
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 757 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 705 place count 580 transition count 909
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 707 place count 578 transition count 905
Iterating global reduction 3 with 2 rules applied. Total rules applied 709 place count 578 transition count 905
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 710 place count 577 transition count 903
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 913 place count 476 transition count 933
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 991 place count 437 transition count 945
Applied a total of 991 rules in 135 ms. Remains 437 /933 variables (removed 496) and now considering 945/1410 (removed 465) transitions.
// Phase 1: matrix 945 rows 437 cols
[2024-05-26 03:33:49] [INFO ] Computed 66 invariants in 4 ms
[2024-05-26 03:33:49] [INFO ] Implicit Places using invariants in 241 ms returned [11, 46, 96, 136, 197, 277, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 242 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/933 places, 945/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 921
Applied a total of 48 rules in 12 ms. Remains 404 /428 variables (removed 24) and now considering 921/945 (removed 24) transitions.
// Phase 1: matrix 921 rows 404 cols
[2024-05-26 03:33:49] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:33:49] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-26 03:33:49] [INFO ] Invariant cache hit.
[2024-05-26 03:33:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 03:33:50] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 404/933 places, 921/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1202 ms. Remains : 404/933 places, 921/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s109 1) (EQ s135 1)), p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 686 reset in 355 ms.
Stack based approach found an accepted trace after 89550 steps with 623 reset with depth 76 and stack size 76 in 353 ms.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 2242 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-26 03:33:50] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15420569340989390658
[2024-05-26 03:33:51] [INFO ] Computing symmetric may disable matrix : 1410 transitions.
[2024-05-26 03:33:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:33:51] [INFO ] Computing symmetric may enable matrix : 1410 transitions.
[2024-05-26 03:33:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:33:51] [INFO ] Applying decomposition
[2024-05-26 03:33:51] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11464318153284885293.txt' '-o' '/tmp/graph11464318153284885293.bin' '-w' '/tmp/graph11464318153284885293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11464318153284885293.bin' '-l' '-1' '-v' '-w' '/tmp/graph11464318153284885293.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:33:51] [INFO ] Decomposing Gal with order
[2024-05-26 03:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:33:51] [INFO ] Removed a total of 1371 redundant transitions.
[2024-05-26 03:33:51] [INFO ] Flatten gal took : 59 ms
[2024-05-26 03:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 18 ms.
[2024-05-26 03:33:51] [INFO ] Time to serialize gal into /tmp/LTLFireability16204195506478172482.gal : 10 ms
[2024-05-26 03:33:51] [INFO ] Time to serialize properties into /tmp/LTLFireability13014502020629990227.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16204195506478172482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13014502020629990227.ltl' '-c' '-stutter-deadlock'
[2024-05-26 03:33:51] [INFO ] Computing Do-Not-Accords matrix : 1410 transitions.

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
[2024-05-26 03:33:51] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:33:51] [INFO ] Built C files in 354ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15420569340989390658
Running compilation step : cd /tmp/ltsmin15420569340989390658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F((G("((i3.i1.i2.u112.p436==0)||(i6.i1.i2.u130.p521==0))"))||(X(("(i6.i0.i2.u187.p808==0)")&&(G(F("(i6.i0.i2.u187.p808==0)"))))))))
Formula 0 simplified : G(F!"((i3.i1.i2.u112.p436==0)||(i6.i1.i2.u130.p521==0))" & X(!"(i6.i0.i2.u187.p808==0)" | FG!"(i6.i0.i2.u187.p808==0)"))
Compilation finished in 4614 ms.
Running link step : cd /tmp/ltsmin15420569340989390658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin15420569340989390658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 03:56:41] [INFO ] Applying decomposition
[2024-05-26 03:56:41] [INFO ] Flatten gal took : 228 ms
[2024-05-26 03:56:41] [INFO ] Decomposing Gal with order
[2024-05-26 03:56:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:56:42] [INFO ] Removed a total of 936 redundant transitions.
[2024-05-26 03:56:43] [INFO ] Flatten gal took : 467 ms
[2024-05-26 03:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2129 labels/synchronizations in 1252 ms.
[2024-05-26 03:56:44] [INFO ] Time to serialize gal into /tmp/LTLFireability8102869496713410360.gal : 39 ms
[2024-05-26 03:56:44] [INFO ] Time to serialize properties into /tmp/LTLFireability11328159492999119407.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8102869496713410360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11328159492999119407.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....552
Formula 0 simplified : G(F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...540
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15420569340989390658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15420569340989390658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(!(LTLAPp2==true)))||(<>(!(LTLAPp2==true))&&[]((LTLAPp3==true))&&X(!(LTLAPp4==true)))))' '--buchi-type=spotba'
LTSmin run took 1934 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin15420569340989390658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 04:19:34] [INFO ] Flatten gal took : 1030 ms
[2024-05-26 04:19:35] [INFO ] Input system was already deterministic with 1410 transitions.
[2024-05-26 04:19:35] [INFO ] Transformed 933 places.
[2024-05-26 04:19:35] [INFO ] Transformed 1410 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 04:19:36] [INFO ] Time to serialize gal into /tmp/LTLFireability5963256676889672330.gal : 15 ms
[2024-05-26 04:19:36] [INFO ] Time to serialize properties into /tmp/LTLFireability3417357000623938803.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5963256676889672330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3417357000623938803.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p436==0)||(p521==0))"))||(X(("(p808==0)")&&(G(F("(p808==0)"))))))))
Formula 0 simplified : G(F!"((p436==0)||(p521==0))" & X(!"(p808==0)" | FG!"(p808==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11331768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15942792 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="NoC3x3-PT-6B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-6B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372700403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;