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-171654372600362.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-2B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372600362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 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 548K 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-2B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-2B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716689737048

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 02:15:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:15:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:15:38] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-26 02:15:38] [INFO ] Transformed 2003 places.
[2024-05-26 02:15:38] [INFO ] Transformed 2292 transitions.
[2024-05-26 02:15:38] [INFO ] Found NUPN structural information;
[2024-05-26 02:15:38] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-2B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1994 transition count 2292
Discarding 503 places :
Symmetric choice reduction at 1 with 503 rule applications. Total rules 512 place count 1491 transition count 1789
Iterating global reduction 1 with 503 rules applied. Total rules applied 1015 place count 1491 transition count 1789
Discarding 175 places :
Symmetric choice reduction at 1 with 175 rule applications. Total rules 1190 place count 1316 transition count 1614
Iterating global reduction 1 with 175 rules applied. Total rules applied 1365 place count 1316 transition count 1614
Discarding 182 places :
Symmetric choice reduction at 1 with 182 rule applications. Total rules 1547 place count 1134 transition count 1418
Iterating global reduction 1 with 182 rules applied. Total rules applied 1729 place count 1134 transition count 1418
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 1775 place count 1088 transition count 1332
Iterating global reduction 1 with 46 rules applied. Total rules applied 1821 place count 1088 transition count 1332
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 1837 place count 1086 transition count 1318
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1868 place count 1055 transition count 1287
Iterating global reduction 2 with 31 rules applied. Total rules applied 1899 place count 1055 transition count 1287
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 1901 place count 1053 transition count 1287
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1923 place count 1031 transition count 1243
Iterating global reduction 3 with 22 rules applied. Total rules applied 1945 place count 1031 transition count 1243
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1967 place count 1009 transition count 1221
Iterating global reduction 3 with 22 rules applied. Total rules applied 1989 place count 1009 transition count 1221
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 1992 place count 1006 transition count 1221
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2014 place count 984 transition count 1199
Iterating global reduction 4 with 22 rules applied. Total rules applied 2036 place count 984 transition count 1199
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2058 place count 984 transition count 1177
Applied a total of 2058 rules in 711 ms. Remains 984 /2003 variables (removed 1019) and now considering 1177/2292 (removed 1115) transitions.
// Phase 1: matrix 1177 rows 984 cols
[2024-05-26 02:15:39] [INFO ] Computed 53 invariants in 28 ms
[2024-05-26 02:15:40] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-26 02:15:40] [INFO ] Invariant cache hit.
[2024-05-26 02:15:41] [INFO ] Implicit Places using invariants and state equation in 857 ms returned [72, 80, 133, 136, 140, 141, 150, 153, 250, 254, 255, 306, 307, 318, 321, 325, 416, 417, 418, 419, 423, 424, 425, 433, 436, 439, 447, 450, 453, 628, 629, 633, 634, 635, 639, 640, 641, 741, 749, 798, 799, 800, 804, 814, 817, 925, 926, 930, 931]
Discarding 49 places :
Implicit Place search using SMT with State Equation took 1372 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 935/2003 places, 1177/2292 transitions.
Applied a total of 0 rules in 20 ms. Remains 935 /935 variables (removed 0) and now considering 1177/1177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2104 ms. Remains : 935/2003 places, 1177/2292 transitions.
Support contains 16 out of 935 places after structural reductions.
[2024-05-26 02:15:41] [INFO ] Flatten gal took : 161 ms
[2024-05-26 02:15:41] [INFO ] Flatten gal took : 76 ms
[2024-05-26 02:15:41] [INFO ] Input system was already deterministic with 1177 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1177 rows 935 cols
[2024-05-26 02:15:42] [INFO ] Computed 42 invariants in 10 ms
[2024-05-26 02:15:42] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2024-05-26 02:15:42] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:15:43] [INFO ] [Nat]Absence check using 42 positive place invariants in 28 ms returned sat
[2024-05-26 02:15:43] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:15:43] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-26 02:15:44] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 12 ms.
Support contains 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Graph (trivial) has 745 edges and 935 vertex of which 72 / 935 are part of one of the 9 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 872 transition count 1000
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 767 transition count 1000
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 211 place count 767 transition count 915
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 381 place count 682 transition count 915
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 408 place count 655 transition count 854
Iterating global reduction 2 with 27 rules applied. Total rules applied 435 place count 655 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 435 place count 655 transition count 852
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 439 place count 653 transition count 852
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 443 place count 649 transition count 845
Iterating global reduction 2 with 4 rules applied. Total rules applied 447 place count 649 transition count 845
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 450 place count 646 transition count 841
Iterating global reduction 2 with 3 rules applied. Total rules applied 453 place count 646 transition count 841
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 454 place count 646 transition count 840
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 455 place count 645 transition count 839
Iterating global reduction 3 with 1 rules applied. Total rules applied 456 place count 645 transition count 839
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 457 place count 645 transition count 838
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 4 with 680 rules applied. Total rules applied 1137 place count 305 transition count 498
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1147 place count 295 transition count 480
Iterating global reduction 4 with 10 rules applied. Total rules applied 1157 place count 295 transition count 480
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1159 place count 293 transition count 476
Iterating global reduction 4 with 2 rules applied. Total rules applied 1161 place count 293 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1163 place count 291 transition count 472
Iterating global reduction 4 with 2 rules applied. Total rules applied 1165 place count 291 transition count 472
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1197 place count 275 transition count 503
Free-agglomeration rule applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1223 place count 275 transition count 477
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1256 place count 249 transition count 470
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1257 place count 249 transition count 469
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 5 with 45 rules applied. Total rules applied 1302 place count 249 transition count 435
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 1359 place count 204 transition count 423
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1360 place count 204 transition count 423
Applied a total of 1360 rules in 259 ms. Remains 204 /935 variables (removed 731) and now considering 423/1177 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 204/935 places, 423/1177 transitions.
Finished random walk after 3847 steps, including 52 resets, run visited all 1 properties in 24 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 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(X(X(X((p0||G(F(p1)))))))))'
Support contains 3 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 925 transition count 1166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 925 transition count 1166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 919 transition count 1157
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 919 transition count 1157
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 914 transition count 1150
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 914 transition count 1150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 910 transition count 1145
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 910 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 910 transition count 1144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 908 transition count 1142
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 908 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 908 transition count 1141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 907 transition count 1140
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 907 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 907 transition count 1139
Applied a total of 59 rules in 165 ms. Remains 907 /935 variables (removed 28) and now considering 1139/1177 (removed 38) transitions.
// Phase 1: matrix 1139 rows 907 cols
[2024-05-26 02:15:44] [INFO ] Computed 42 invariants in 10 ms
[2024-05-26 02:15:45] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-26 02:15:45] [INFO ] Invariant cache hit.
[2024-05-26 02:15:45] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2024-05-26 02:15:45] [INFO ] Invariant cache hit.
[2024-05-26 02:15:46] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 907/935 places, 1139/1177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1605 ms. Remains : 907/935 places, 1139/1177 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 440 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-02 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=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s185 1), p1:(OR (EQ s358 0) (EQ s483 1))], 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 179 reset in 332 ms.
Product exploration explored 100000 steps with 175 reset in 305 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 p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 345 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 907/907 places, 1139/1139 transitions.
Applied a total of 0 rules in 25 ms. Remains 907 /907 variables (removed 0) and now considering 1139/1139 (removed 0) transitions.
[2024-05-26 02:15:48] [INFO ] Invariant cache hit.
[2024-05-26 02:15:48] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-26 02:15:48] [INFO ] Invariant cache hit.
[2024-05-26 02:15:49] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2024-05-26 02:15:49] [INFO ] Invariant cache hit.
[2024-05-26 02:15:49] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1343 ms. Remains : 907/907 places, 1139/1139 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 p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 6571 steps, including 9 resets, run visited all 3 properties in 61 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 169 reset in 249 ms.
Product exploration explored 100000 steps with 176 reset in 273 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 3 out of 907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 907/907 places, 1139/1139 transitions.
Graph (trivial) has 720 edges and 907 vertex of which 72 / 907 are part of one of the 9 SCC in 3 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 844 transition count 1076
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 45 Pre rules applied. Total rules applied 97 place count 844 transition count 1118
Deduced a syphon composed of 141 places in 4 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 142 place count 844 transition count 1118
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 161 place count 825 transition count 1074
Deduced a syphon composed of 141 places in 2 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 180 place count 825 transition count 1074
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 180 place count 825 transition count 1080
Deduced a syphon composed of 144 places in 2 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 183 place count 825 transition count 1080
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 202 place count 806 transition count 1033
Deduced a syphon composed of 125 places in 2 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 221 place count 806 transition count 1033
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 221 place count 806 transition count 1039
Deduced a syphon composed of 131 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 227 place count 806 transition count 1039
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: -209
Deduced a syphon composed of 480 places in 0 ms
Iterating global reduction 1 with 349 rules applied. Total rules applied 576 place count 806 transition count 1248
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 631 place count 751 transition count 1162
Deduced a syphon composed of 436 places in 0 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 686 place count 751 transition count 1162
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 691 place count 746 transition count 1155
Deduced a syphon composed of 433 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 696 place count 746 transition count 1155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 698 place count 744 transition count 1150
Deduced a syphon composed of 433 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 700 place count 744 transition count 1150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 434 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 701 place count 744 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 702 place count 743 transition count 1149
Deduced a syphon composed of 433 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 703 place count 743 transition count 1149
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -210
Deduced a syphon composed of 465 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 735 place count 743 transition count 1359
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 755 place count 723 transition count 1278
Deduced a syphon composed of 445 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 775 place count 723 transition count 1278
Deduced a syphon composed of 445 places in 1 ms
Applied a total of 775 rules in 348 ms. Remains 723 /907 variables (removed 184) and now considering 1278/1139 (removed -139) transitions.
[2024-05-26 02:15:53] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-26 02:15:53] [INFO ] Flow matrix only has 1270 transitions (discarded 8 similar events)
// Phase 1: matrix 1270 rows 723 cols
[2024-05-26 02:15:53] [INFO ] Computed 42 invariants in 11 ms
[2024-05-26 02:15:53] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 723/907 places, 1278/1139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 900 ms. Remains : 723/907 places, 1278/1139 transitions.
Built C files in :
/tmp/ltsmin1162570134755313429
[2024-05-26 02:15:53] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1162570134755313429
Running compilation step : cd /tmp/ltsmin1162570134755313429;'/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 1851 ms.
Running link step : cd /tmp/ltsmin1162570134755313429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1162570134755313429;'/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/stateBased10275026382050828572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 907/907 places, 1139/1139 transitions.
Applied a total of 0 rules in 18 ms. Remains 907 /907 variables (removed 0) and now considering 1139/1139 (removed 0) transitions.
// Phase 1: matrix 1139 rows 907 cols
[2024-05-26 02:16:08] [INFO ] Computed 42 invariants in 9 ms
[2024-05-26 02:16:08] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-26 02:16:08] [INFO ] Invariant cache hit.
[2024-05-26 02:16:09] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-26 02:16:09] [INFO ] Invariant cache hit.
[2024-05-26 02:16:09] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1301 ms. Remains : 907/907 places, 1139/1139 transitions.
Built C files in :
/tmp/ltsmin393531000694610066
[2024-05-26 02:16:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin393531000694610066
Running compilation step : cd /tmp/ltsmin393531000694610066;'/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 1743 ms.
Running link step : cd /tmp/ltsmin393531000694610066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin393531000694610066;'/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/stateBased2987309175759300389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:16:25] [INFO ] Flatten gal took : 38 ms
[2024-05-26 02:16:25] [INFO ] Flatten gal took : 37 ms
[2024-05-26 02:16:25] [INFO ] Time to serialize gal into /tmp/LTL3838266056282624668.gal : 11 ms
[2024-05-26 02:16:25] [INFO ] Time to serialize properties into /tmp/LTL11828688816344232941.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/LTL3838266056282624668.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8573357278983707730.hoa' '-atoms' '/tmp/LTL11828688816344232941.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/LTL11828688816344232941.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8573357278983707730.hoa
Detected timeout of ITS tools.
[2024-05-26 02:16:40] [INFO ] Flatten gal took : 31 ms
[2024-05-26 02:16:40] [INFO ] Flatten gal took : 32 ms
[2024-05-26 02:16:40] [INFO ] Time to serialize gal into /tmp/LTL9917060677330996739.gal : 6 ms
[2024-05-26 02:16:40] [INFO ] Time to serialize properties into /tmp/LTL1601863434649588709.ltl : 2 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/LTL9917060677330996739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1601863434649588709.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(X(X(("(p291==1)")||(G(F("((p614==0)||(p938==1))"))))))))))
Formula 0 simplified : XXXXX(!"(p291==1)" & FG!"((p614==0)||(p938==1))")
Detected timeout of ITS tools.
[2024-05-26 02:16:55] [INFO ] Flatten gal took : 30 ms
[2024-05-26 02:16:55] [INFO ] Applying decomposition
[2024-05-26 02:16:55] [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/graph13209666340720594659.txt' '-o' '/tmp/graph13209666340720594659.bin' '-w' '/tmp/graph13209666340720594659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13209666340720594659.bin' '-l' '-1' '-v' '-w' '/tmp/graph13209666340720594659.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:16:55] [INFO ] Decomposing Gal with order
[2024-05-26 02:16:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:16:55] [INFO ] Removed a total of 459 redundant transitions.
[2024-05-26 02:16:55] [INFO ] Flatten gal took : 87 ms
[2024-05-26 02:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 20 ms.
[2024-05-26 02:16:55] [INFO ] Time to serialize gal into /tmp/LTL7785200111947351349.gal : 17 ms
[2024-05-26 02:16:55] [INFO ] Time to serialize properties into /tmp/LTL11948671310493694635.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/LTL7785200111947351349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11948671310493694635.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(X(X(("(i2.i0.i2.u72.p291==1)")||(G(F("((i4.u141.p614==0)||(i8.u193.p938==1))"))))))))))
Formula 0 simplified : XXXXX(!"(i2.i0.i2.u72.p291==1)" & FG!"((i4.u141.p614==0)||(i8.u193.p938==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5642382672673904237
[2024-05-26 02:17:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5642382672673904237
Running compilation step : cd /tmp/ltsmin5642382672673904237;'/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 1716 ms.
Running link step : cd /tmp/ltsmin5642382672673904237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5642382672673904237;'/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(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-2B-LTLCardinality-02 finished in 101514 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(p1)||p0)))'
Support contains 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 926 transition count 1167
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 926 transition count 1167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 920 transition count 1158
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 920 transition count 1158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 916 transition count 1153
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 916 transition count 1153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 913 transition count 1149
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 913 transition count 1149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 913 transition count 1148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 911 transition count 1146
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 911 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 911 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 910 transition count 1144
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 910 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 910 transition count 1143
Applied a total of 53 rules in 109 ms. Remains 910 /935 variables (removed 25) and now considering 1143/1177 (removed 34) transitions.
// Phase 1: matrix 1143 rows 910 cols
[2024-05-26 02:17:26] [INFO ] Computed 42 invariants in 9 ms
[2024-05-26 02:17:26] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-26 02:17:26] [INFO ] Invariant cache hit.
[2024-05-26 02:17:27] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2024-05-26 02:17:27] [INFO ] Invariant cache hit.
[2024-05-26 02:17:27] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 910/935 places, 1143/1177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1437 ms. Remains : 910/935 places, 1143/1177 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s554 0) (EQ s583 1)), p0:(OR (EQ s554 0) (EQ s583 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 50000 reset in 754 ms.
Product exploration explored 100000 steps with 50000 reset in 753 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 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-2B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-2B-LTLCardinality-04 finished in 3110 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)))'
Support contains 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Graph (trivial) has 746 edges and 935 vertex of which 72 / 935 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 871 transition count 1006
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 764 transition count 1006
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 215 place count 764 transition count 929
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 369 place count 687 transition count 929
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 394 place count 662 transition count 871
Iterating global reduction 2 with 25 rules applied. Total rules applied 419 place count 662 transition count 871
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 419 place count 662 transition count 870
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 421 place count 661 transition count 870
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 423 place count 659 transition count 866
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 659 transition count 866
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 426 place count 658 transition count 865
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 658 transition count 865
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1125 place count 309 transition count 516
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1136 place count 298 transition count 496
Iterating global reduction 2 with 11 rules applied. Total rules applied 1147 place count 298 transition count 496
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1150 place count 295 transition count 490
Iterating global reduction 2 with 3 rules applied. Total rules applied 1153 place count 295 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1154 place count 295 transition count 489
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1156 place count 293 transition count 485
Iterating global reduction 3 with 2 rules applied. Total rules applied 1158 place count 293 transition count 485
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1186 place count 279 transition count 484
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1187 place count 279 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1188 place count 278 transition count 483
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1197 place count 269 transition count 483
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 4 with 48 rules applied. Total rules applied 1245 place count 245 transition count 459
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1265 place count 245 transition count 439
Applied a total of 1265 rules in 140 ms. Remains 245 /935 variables (removed 690) and now considering 439/1177 (removed 738) transitions.
[2024-05-26 02:17:29] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 245 cols
[2024-05-26 02:17:29] [INFO ] Computed 33 invariants in 1 ms
[2024-05-26 02:17:29] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-26 02:17:29] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-26 02:17:29] [INFO ] Invariant cache hit.
[2024-05-26 02:17:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:17:29] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-26 02:17:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 02:17:29] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-26 02:17:29] [INFO ] Invariant cache hit.
[2024-05-26 02:17:29] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/935 places, 439/1177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 833 ms. Remains : 245/935 places, 439/1177 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s224 0) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-06 finished in 877 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(p0)||G(p1)))'
Support contains 4 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Graph (trivial) has 744 edges and 935 vertex of which 72 / 935 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 871 transition count 1008
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 766 transition count 1008
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 211 place count 766 transition count 931
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 365 place count 689 transition count 931
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 391 place count 663 transition count 871
Iterating global reduction 2 with 26 rules applied. Total rules applied 417 place count 663 transition count 871
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 419 place count 661 transition count 868
Iterating global reduction 2 with 2 rules applied. Total rules applied 421 place count 661 transition count 868
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 423 place count 659 transition count 865
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 659 transition count 865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 659 transition count 864
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 427 place count 658 transition count 863
Iterating global reduction 3 with 1 rules applied. Total rules applied 428 place count 658 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 658 transition count 862
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 4 with 694 rules applied. Total rules applied 1123 place count 311 transition count 515
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1134 place count 300 transition count 495
Iterating global reduction 4 with 11 rules applied. Total rules applied 1145 place count 300 transition count 495
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1148 place count 297 transition count 489
Iterating global reduction 4 with 3 rules applied. Total rules applied 1151 place count 297 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1152 place count 297 transition count 488
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1154 place count 295 transition count 484
Iterating global reduction 5 with 2 rules applied. Total rules applied 1156 place count 295 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1158 place count 294 transition count 483
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1184 place count 281 transition count 482
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1186 place count 281 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1187 place count 280 transition count 481
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1196 place count 271 transition count 481
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 6 with 48 rules applied. Total rules applied 1244 place count 247 transition count 457
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1264 place count 247 transition count 437
Applied a total of 1264 rules in 151 ms. Remains 247 /935 variables (removed 688) and now considering 437/1177 (removed 740) transitions.
[2024-05-26 02:17:30] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
// Phase 1: matrix 429 rows 247 cols
[2024-05-26 02:17:30] [INFO ] Computed 33 invariants in 3 ms
[2024-05-26 02:17:30] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-26 02:17:30] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
[2024-05-26 02:17:30] [INFO ] Invariant cache hit.
[2024-05-26 02:17:30] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:17:30] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-26 02:17:30] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-26 02:17:30] [INFO ] Flow matrix only has 429 transitions (discarded 8 similar events)
[2024-05-26 02:17:30] [INFO ] Invariant cache hit.
[2024-05-26 02:17:30] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/935 places, 437/1177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 247/935 places, 437/1177 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s122 0) (EQ s25 1)), p1:(OR (EQ s149 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 130 steps with 1 reset in 7 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-08 finished in 766 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 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Graph (trivial) has 743 edges and 935 vertex of which 72 / 935 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 871 transition count 1009
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 767 transition count 1009
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 209 place count 767 transition count 932
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 363 place count 690 transition count 932
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 389 place count 664 transition count 872
Iterating global reduction 2 with 26 rules applied. Total rules applied 415 place count 664 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 415 place count 664 transition count 871
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 417 place count 663 transition count 871
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 421 place count 659 transition count 864
Iterating global reduction 2 with 4 rules applied. Total rules applied 425 place count 659 transition count 864
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 428 place count 656 transition count 860
Iterating global reduction 2 with 3 rules applied. Total rules applied 431 place count 656 transition count 860
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 656 transition count 859
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 433 place count 655 transition count 858
Iterating global reduction 3 with 1 rules applied. Total rules applied 434 place count 655 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 655 transition count 857
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 4 with 694 rules applied. Total rules applied 1129 place count 308 transition count 510
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1139 place count 298 transition count 492
Iterating global reduction 4 with 10 rules applied. Total rules applied 1149 place count 298 transition count 492
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1151 place count 296 transition count 488
Iterating global reduction 4 with 2 rules applied. Total rules applied 1153 place count 296 transition count 488
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1155 place count 294 transition count 484
Iterating global reduction 4 with 2 rules applied. Total rules applied 1157 place count 294 transition count 484
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 1181 place count 282 transition count 483
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1185 place count 282 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1186 place count 281 transition count 482
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1195 place count 272 transition count 482
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 5 with 48 rules applied. Total rules applied 1243 place count 248 transition count 458
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1262 place count 248 transition count 439
Applied a total of 1262 rules in 131 ms. Remains 248 /935 variables (removed 687) and now considering 439/1177 (removed 738) transitions.
[2024-05-26 02:17:30] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
// Phase 1: matrix 431 rows 248 cols
[2024-05-26 02:17:30] [INFO ] Computed 33 invariants in 3 ms
[2024-05-26 02:17:31] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-26 02:17:31] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-26 02:17:31] [INFO ] Invariant cache hit.
[2024-05-26 02:17:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-26 02:17:31] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-26 02:17:31] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 02:17:31] [INFO ] Flow matrix only has 431 transitions (discarded 8 similar events)
[2024-05-26 02:17:31] [INFO ] Invariant cache hit.
[2024-05-26 02:17:31] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 248/935 places, 439/1177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 248/935 places, 439/1177 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-10 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:(OR (EQ s109 0) (EQ s159 1)), p1:(OR (EQ s197 0) (EQ s148 1))], 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 3424 steps with 42 reset in 23 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-10 finished in 842 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)))'
Support contains 1 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 1177/1177 transitions.
Graph (trivial) has 749 edges and 935 vertex of which 72 / 935 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 871 transition count 1006
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 764 transition count 1006
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 215 place count 764 transition count 929
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 369 place count 687 transition count 929
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 396 place count 660 transition count 868
Iterating global reduction 2 with 27 rules applied. Total rules applied 423 place count 660 transition count 868
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 423 place count 660 transition count 867
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 425 place count 659 transition count 867
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 429 place count 655 transition count 860
Iterating global reduction 2 with 4 rules applied. Total rules applied 433 place count 655 transition count 860
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 436 place count 652 transition count 856
Iterating global reduction 2 with 3 rules applied. Total rules applied 439 place count 652 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 440 place count 652 transition count 855
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 441 place count 651 transition count 854
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 651 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 651 transition count 853
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 4 with 698 rules applied. Total rules applied 1141 place count 302 transition count 504
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1152 place count 291 transition count 484
Iterating global reduction 4 with 11 rules applied. Total rules applied 1163 place count 291 transition count 484
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1166 place count 288 transition count 478
Iterating global reduction 4 with 3 rules applied. Total rules applied 1169 place count 288 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1170 place count 288 transition count 477
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1172 place count 286 transition count 473
Iterating global reduction 5 with 2 rules applied. Total rules applied 1174 place count 286 transition count 473
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1200 place count 273 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1201 place count 272 transition count 471
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1210 place count 263 transition count 471
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 6 with 48 rules applied. Total rules applied 1258 place count 239 transition count 447
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1278 place count 239 transition count 427
Applied a total of 1278 rules in 128 ms. Remains 239 /935 variables (removed 696) and now considering 427/1177 (removed 750) transitions.
[2024-05-26 02:17:31] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 239 cols
[2024-05-26 02:17:31] [INFO ] Computed 33 invariants in 4 ms
[2024-05-26 02:17:31] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-26 02:17:31] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2024-05-26 02:17:31] [INFO ] Invariant cache hit.
[2024-05-26 02:17:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-26 02:17:32] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-26 02:17:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 02:17:32] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2024-05-26 02:17:32] [INFO ] Invariant cache hit.
[2024-05-26 02:17:32] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/935 places, 427/1177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 661 ms. Remains : 239/935 places, 427/1177 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2B-LTLCardinality-14 finished in 721 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(X(X((p0||G(F(p1)))))))))'
[2024-05-26 02:17:32] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7853083066049515918
[2024-05-26 02:17:32] [INFO ] Computing symmetric may disable matrix : 1177 transitions.
[2024-05-26 02:17:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:17:32] [INFO ] Computing symmetric may enable matrix : 1177 transitions.
[2024-05-26 02:17:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:17:32] [INFO ] Applying decomposition
[2024-05-26 02:17:32] [INFO ] Flatten gal took : 32 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/graph12144557869608075667.txt' '-o' '/tmp/graph12144557869608075667.bin' '-w' '/tmp/graph12144557869608075667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12144557869608075667.bin' '-l' '-1' '-v' '-w' '/tmp/graph12144557869608075667.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:17:32] [INFO ] Decomposing Gal with order
[2024-05-26 02:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:17:32] [INFO ] Removed a total of 486 redundant transitions.
[2024-05-26 02:17:32] [INFO ] Flatten gal took : 65 ms
[2024-05-26 02:17:32] [INFO ] Computing Do-Not-Accords matrix : 1177 transitions.
[2024-05-26 02:17:32] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:17:32] [INFO ] Built C files in 337ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7853083066049515918
Running compilation step : cd /tmp/ltsmin7853083066049515918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-26 02:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 27 ms.
[2024-05-26 02:17:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality6238085218131597907.gal : 25 ms
[2024-05-26 02:17:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality12711521315730624581.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/LTLCardinality6238085218131597907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12711521315730624581.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 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(("(i3.i0.i2.u70.p291==1)")||(G(F("((i5.u143.p614==0)||(i9.u195.p938==1))"))))))))))
Formula 0 simplified : XXXXX(!"(i3.i0.i2.u70.p291==1)" & FG!"((i5.u143.p614==0)||(i9.u195.p938==1))")
Compilation finished in 3380 ms.
Running link step : cd /tmp/ltsmin7853083066049515918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7853083066049515918;'/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(X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 02:38:10] [INFO ] Applying decomposition
[2024-05-26 02:38:10] [INFO ] Flatten gal took : 80 ms
[2024-05-26 02:38:10] [INFO ] Decomposing Gal with order
[2024-05-26 02:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:38:11] [INFO ] Removed a total of 263 redundant transitions.
[2024-05-26 02:38:11] [INFO ] Flatten gal took : 94 ms
[2024-05-26 02:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 944 labels/synchronizations in 247 ms.
[2024-05-26 02:38:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality8966480600867461570.gal : 7 ms
[2024-05-26 02:38:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality4457632837765624233.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/LTLCardinality8966480600867461570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4457632837765624233.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(("(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.i...470
Formula 0 simplified : XXXXX(!"(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....454
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.140: LTL layer: formula: X(X(X(X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))))))
pins2lts-mc-linux64( 0/ 8), 0.140: "X(X(X(X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.141: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.143: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.153: buchi has 8 states
pins2lts-mc-linux64( 1/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.189: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.197: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.197: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.201: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.205: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.472: DFS-FIFO for weak LTL, using special progress label 1180
pins2lts-mc-linux64( 0/ 8), 0.472: There are 1181 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.472: State length is 936, there are 1187 groups
pins2lts-mc-linux64( 0/ 8), 0.472: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.472: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.472: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.472: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.592: ~1 levels ~960 states ~3800 transitions
pins2lts-mc-linux64( 0/ 8), 0.666: ~1 levels ~1920 states ~9944 transitions
pins2lts-mc-linux64( 0/ 8), 0.802: ~1 levels ~3840 states ~22368 transitions
pins2lts-mc-linux64( 0/ 8), 1.071: ~1 levels ~7680 states ~47320 transitions
pins2lts-mc-linux64( 5/ 8), 1.609: ~1 levels ~15360 states ~88728 transitions
pins2lts-mc-linux64( 4/ 8), 2.614: ~1 levels ~30720 states ~214824 transitions
pins2lts-mc-linux64( 2/ 8), 4.500: ~1 levels ~61440 states ~390240 transitions
pins2lts-mc-linux64( 2/ 8), 8.239: ~1 levels ~122880 states ~804312 transitions
pins2lts-mc-linux64( 2/ 8), 15.217: ~1 levels ~245760 states ~1644824 transitions
pins2lts-mc-linux64( 2/ 8), 28.388: ~1 levels ~491520 states ~3362784 transitions
pins2lts-mc-linux64( 2/ 8), 59.552: ~1 levels ~983040 states ~6965368 transitions
pins2lts-mc-linux64( 2/ 8), 127.709: ~1 levels ~1966080 states ~14847064 transitions
pins2lts-mc-linux64( 2/ 8), 235.969: ~1 levels ~3932160 states ~31128720 transitions
pins2lts-mc-linux64( 2/ 8), 459.085: ~1 levels ~7864320 states ~64806792 transitions
pins2lts-mc-linux64( 2/ 8), 916.181: ~1 levels ~15728640 states ~137162200 transitions
pins2lts-mc-linux64( 6/ 8), 1316.349: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1316.396:
pins2lts-mc-linux64( 0/ 8), 1316.396: mean standard work distribution: 5.6% (states) 6.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 1316.396:
pins2lts-mc-linux64( 0/ 8), 1316.396: Explored 19664509 states 213286487 transitions, fanout: 10.846
pins2lts-mc-linux64( 0/ 8), 1316.396: Total exploration time 1315.910 sec (1315.850 sec minimum, 1315.881 sec on average)
pins2lts-mc-linux64( 0/ 8), 1316.396: States per second: 14944, Transitions per second: 162083
pins2lts-mc-linux64( 0/ 8), 1316.396:
pins2lts-mc-linux64( 0/ 8), 1316.396: Progress states detected: 32568969
pins2lts-mc-linux64( 0/ 8), 1316.396: Redundant explorations: -39.6221
pins2lts-mc-linux64( 0/ 8), 1316.396:
pins2lts-mc-linux64( 0/ 8), 1316.396: Queue width: 8B, total height: 22223298, memory: 169.55MB
pins2lts-mc-linux64( 0/ 8), 1316.396: Tree memory: 504.5MB, 16.2 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1316.396: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1316.396: Stored 1206 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1316.396: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1316.396: Est. total memory use: 674.0MB (~1193.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7853083066049515918;'/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(X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7853083066049515918;'/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(X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-26 02:58:51] [INFO ] Flatten gal took : 417 ms
[2024-05-26 02:59:07] [INFO ] Input system was already deterministic with 1177 transitions.
[2024-05-26 02:59:07] [INFO ] Transformed 935 places.
[2024-05-26 02:59:07] [INFO ] Transformed 1177 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 02:59:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality10633358171560048292.gal : 9 ms
[2024-05-26 02:59:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality9840131820439086563.ltl : 2 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/LTLCardinality10633358171560048292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9840131820439086563.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(X(X(("(p291==1)")||(G(F("((p614==0)||(p938==1))"))))))))))
Formula 0 simplified : XXXXX(!"(p291==1)" & FG!"((p614==0)||(p938==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 137324 kB
After kill :
MemTotal: 16393232 kB
MemFree: 11369164 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -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-2B"
export BK_EXAMINATION="LTLCardinality"
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-2B, examination is LTLCardinality"
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-171654372600362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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