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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 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 2.0M 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-7B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-7B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716694665921

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-7B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 03:37:47] [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 03:37:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:37:47] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2024-05-26 03:37:47] [INFO ] Transformed 7014 places.
[2024-05-26 03:37:47] [INFO ] Transformed 8833 transitions.
[2024-05-26 03:37:47] [INFO ] Found NUPN structural information;
[2024-05-26 03:37:47] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 534 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-7B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 7014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1852 places :
Symmetric choice reduction at 0 with 1852 rule applications. Total rules 1852 place count 5162 transition count 6981
Iterating global reduction 0 with 1852 rules applied. Total rules applied 3704 place count 5162 transition count 6981
Discarding 488 places :
Symmetric choice reduction at 0 with 488 rule applications. Total rules 4192 place count 4674 transition count 6493
Iterating global reduction 0 with 488 rules applied. Total rules applied 4680 place count 4674 transition count 6493
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4763 place count 4591 transition count 6327
Iterating global reduction 0 with 83 rules applied. Total rules applied 4846 place count 4591 transition count 6327
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 4929 place count 4508 transition count 6244
Iterating global reduction 0 with 83 rules applied. Total rules applied 5012 place count 4508 transition count 6244
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 5093 place count 4427 transition count 6163
Iterating global reduction 0 with 81 rules applied. Total rules applied 5174 place count 4427 transition count 6163
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 5254 place count 4347 transition count 6038
Iterating global reduction 0 with 80 rules applied. Total rules applied 5334 place count 4347 transition count 6038
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 5413 place count 4268 transition count 5880
Iterating global reduction 0 with 79 rules applied. Total rules applied 5492 place count 4268 transition count 5880
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 5511 place count 4268 transition count 5861
Applied a total of 5511 rules in 3929 ms. Remains 4268 /7014 variables (removed 2746) and now considering 5861/8833 (removed 2972) transitions.
// Phase 1: matrix 5861 rows 4268 cols
[2024-05-26 03:37:52] [INFO ] Computed 66 invariants in 50 ms
[2024-05-26 03:37:53] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2024-05-26 03:37:53] [INFO ] Invariant cache hit.
[2024-05-26 03:37:54] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2024-05-26 03:37:54] [INFO ] Invariant cache hit.
[2024-05-26 03:37:57] [INFO ] Dead Transitions using invariants and state equation in 3217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4268/7014 places, 5861/8833 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9040 ms. Remains : 4268/7014 places, 5861/8833 transitions.
Support contains 42 out of 4268 places after structural reductions.
[2024-05-26 03:37:57] [INFO ] Flatten gal took : 279 ms
[2024-05-26 03:37:57] [INFO ] Flatten gal took : 171 ms
[2024-05-26 03:37:58] [INFO ] Input system was already deterministic with 5861 transitions.
Support contains 40 out of 4268 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-26 03:37:58] [INFO ] Invariant cache hit.
[2024-05-26 03:38:00] [INFO ] After 1494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-26 03:38:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 03:38:07] [INFO ] After 4981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-26 03:38:08] [INFO ] Deduced a trap composed of 169 places in 243 ms of which 6 ms to minimize.
[2024-05-26 03:38:08] [INFO ] Deduced a trap composed of 126 places in 182 ms of which 1 ms to minimize.
[2024-05-26 03:38:08] [INFO ] Deduced a trap composed of 173 places in 128 ms of which 1 ms to minimize.
[2024-05-26 03:38:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1196 ms
[2024-05-26 03:38:13] [INFO ] After 11025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 2698 ms.
[2024-05-26 03:38:16] [INFO ] After 16111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 16 different solutions.
Finished Parikh walk after 3777 steps, including 2 resets, run visited all 1 properties in 19 ms. (steps per millisecond=198 )
Parikh walk visited 18 properties in 1034 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 67 stabilizing places and 67 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' '!(F(G(p0)))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Graph (trivial) has 5158 edges and 4268 vertex of which 3270 / 4268 are part of one of the 33 SCC in 10 ms
Free SCC test removed 3237 places
Ensure Unique test removed 4359 transitions
Reduce isomorphic transitions removed 4359 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1030 transition count 1500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1029 transition count 1500
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 3 place count 1029 transition count 1464
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 993 transition count 1464
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 354 place count 714 transition count 1051
Iterating global reduction 2 with 279 rules applied. Total rules applied 633 place count 714 transition count 1051
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 635 place count 714 transition count 1049
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 635 place count 714 transition count 1048
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 637 place count 713 transition count 1048
Discarding 202 places :
Symmetric choice reduction at 3 with 202 rule applications. Total rules 839 place count 511 transition count 799
Iterating global reduction 3 with 202 rules applied. Total rules applied 1041 place count 511 transition count 799
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 3 with 201 rules applied. Total rules applied 1242 place count 511 transition count 598
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1500 place count 382 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1501 place count 381 transition count 468
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 372 vertex of which 48 / 372 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 1511 place count 348 transition count 468
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1559 place count 348 transition count 420
Applied a total of 1559 rules in 257 ms. Remains 348 /4268 variables (removed 3920) and now considering 420/5861 (removed 5441) transitions.
[2024-05-26 03:38:18] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 348 cols
[2024-05-26 03:38:18] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:38:18] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-26 03:38:18] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-05-26 03:38:18] [INFO ] Invariant cache hit.
[2024-05-26 03:38:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:38:19] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-26 03:38:19] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-26 03:38:19] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-05-26 03:38:19] [INFO ] Invariant cache hit.
[2024-05-26 03:38:19] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/4268 places, 420/5861 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1344 ms. Remains : 348/4268 places, 420/5861 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 130 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s318 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 104 steps with 1 reset in 5 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLCardinality-00 finished in 1527 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)||G(p1))))'
Support contains 4 out of 4268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Graph (trivial) has 5152 edges and 4268 vertex of which 3262 / 4268 are part of one of the 33 SCC in 6 ms
Free SCC test removed 3229 places
Ensure Unique test removed 4347 transitions
Reduce isomorphic transitions removed 4347 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1038 transition count 1510
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1035 transition count 1509
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 1034 transition count 1507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 1033 transition count 1507
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 12 place count 1033 transition count 1471
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 84 place count 997 transition count 1471
Discarding 279 places :
Symmetric choice reduction at 4 with 279 rule applications. Total rules 363 place count 718 transition count 1058
Iterating global reduction 4 with 279 rules applied. Total rules applied 642 place count 718 transition count 1058
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 644 place count 718 transition count 1056
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 644 place count 718 transition count 1055
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 646 place count 717 transition count 1055
Discarding 201 places :
Symmetric choice reduction at 5 with 201 rule applications. Total rules 847 place count 516 transition count 807
Iterating global reduction 5 with 201 rules applied. Total rules applied 1048 place count 516 transition count 807
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 5 with 200 rules applied. Total rules applied 1248 place count 516 transition count 607
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 6 with 262 rules applied. Total rules applied 1510 place count 385 transition count 476
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1511 place count 385 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1512 place count 384 transition count 474
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 267 edges and 375 vertex of which 48 / 375 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 6 with 10 rules applied. Total rules applied 1522 place count 351 transition count 474
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1570 place count 351 transition count 426
Applied a total of 1570 rules in 189 ms. Remains 351 /4268 variables (removed 3917) and now considering 426/5861 (removed 5435) transitions.
[2024-05-26 03:38:19] [INFO ] Flow matrix only has 394 transitions (discarded 32 similar events)
// Phase 1: matrix 394 rows 351 cols
[2024-05-26 03:38:19] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 03:38:19] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 03:38:19] [INFO ] Flow matrix only has 394 transitions (discarded 32 similar events)
[2024-05-26 03:38:19] [INFO ] Invariant cache hit.
[2024-05-26 03:38:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 03:38:20] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-26 03:38:20] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-26 03:38:20] [INFO ] Flow matrix only has 394 transitions (discarded 32 similar events)
[2024-05-26 03:38:20] [INFO ] Invariant cache hit.
[2024-05-26 03:38:20] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/4268 places, 426/5861 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 828 ms. Remains : 351/4268 places, 426/5861 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s184 0) (EQ s187 1)), p1:(AND (EQ s300 0) (EQ s137 1))], nbAcceptance=2, 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 0 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLCardinality-01 finished in 882 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(G((G(F(p0)) U (p1 U p2)))))'
Support contains 4 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4246 transition count 5839
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4246 transition count 5839
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 4237 transition count 5826
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 4237 transition count 5826
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 4232 transition count 5818
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 4232 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 4229 transition count 5815
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 4229 transition count 5815
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 4226 transition count 5809
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 4226 transition count 5809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 4223 transition count 5804
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 4223 transition count 5804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 4223 transition count 5803
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 4222 transition count 5801
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 4222 transition count 5801
Applied a total of 93 rules in 2075 ms. Remains 4222 /4268 variables (removed 46) and now considering 5801/5861 (removed 60) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2024-05-26 03:38:22] [INFO ] Computed 66 invariants in 24 ms
[2024-05-26 03:38:23] [INFO ] Implicit Places using invariants in 804 ms returned []
[2024-05-26 03:38:23] [INFO ] Invariant cache hit.
[2024-05-26 03:38:24] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-26 03:38:24] [INFO ] Invariant cache hit.
[2024-05-26 03:38:27] [INFO ] Dead Transitions using invariants and state equation in 3149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4222/4268 places, 5801/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6821 ms. Remains : 4222/4268 places, 5801/5861 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s1827 0) (EQ s2807 1)), p1:(OR (EQ s2903 0) (EQ s1562 1)), p0:(OR (EQ s1827 0) (EQ s2807 1) (EQ s2903 0) (EQ s1562 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 38 reset in 574 ms.
Product exploration explored 100000 steps with 36 reset in 613 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 p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 166945 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166945 steps, saw 161378 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-26 03:38:32] [INFO ] Invariant cache hit.
[2024-05-26 03:38:33] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-26 03:38:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-05-26 03:38:36] [INFO ] After 3058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-26 03:38:37] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 1 ms to minimize.
[2024-05-26 03:38:37] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 1 ms to minimize.
[2024-05-26 03:38:37] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 1 ms to minimize.
[2024-05-26 03:38:38] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 0 ms to minimize.
[2024-05-26 03:38:38] [INFO ] Deduced a trap composed of 157 places in 99 ms of which 1 ms to minimize.
[2024-05-26 03:38:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1625 ms
[2024-05-26 03:38:39] [INFO ] After 5627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 596 ms.
[2024-05-26 03:38:40] [INFO ] After 7061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 320 ms.
Support contains 4 out of 4222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Graph (trivial) has 5102 edges and 4222 vertex of which 3130 / 4222 are part of one of the 32 SCC in 4 ms
Free SCC test removed 3098 places
Drop transitions removed 4056 transitions
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 4210 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 1124 transition count 1564
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 41 rules applied. Total rules applied 69 place count 1097 transition count 1550
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 78 place count 1088 transition count 1550
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 78 place count 1088 transition count 1492
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 194 place count 1030 transition count 1492
Discarding 261 places :
Symmetric choice reduction at 3 with 261 rule applications. Total rules 455 place count 769 transition count 1099
Iterating global reduction 3 with 261 rules applied. Total rules applied 716 place count 769 transition count 1099
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 907 place count 578 transition count 869
Iterating global reduction 3 with 191 rules applied. Total rules applied 1098 place count 578 transition count 869
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 3 with 191 rules applied. Total rules applied 1289 place count 578 transition count 678
Performed 161 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 4 with 322 rules applied. Total rules applied 1611 place count 417 transition count 515
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1615 place count 417 transition count 511
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 1617 place count 416 transition count 510
Performed 19 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1655 place count 397 transition count 625
Drop transitions removed 2 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 1719 place count 397 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1721 place count 396 transition count 572
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1729 place count 396 transition count 564
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 7 with 50 rules applied. Total rules applied 1779 place count 396 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1783 place count 394 transition count 547
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1787 place count 394 transition count 543
Free-agglomeration rule applied 196 times.
Iterating global reduction 7 with 196 rules applied. Total rules applied 1983 place count 394 transition count 347
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Graph (complete) has 630 edges and 198 vertex of which 92 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.1 ms
Discarding 106 places :
Also discarding 73 output transitions
Drop transitions removed 73 transitions
Iterating post reduction 7 with 231 rules applied. Total rules applied 2214 place count 92 transition count 240
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 8 with 49 rules applied. Total rules applied 2263 place count 92 transition count 191
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2268 place count 92 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2269 place count 92 transition count 185
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 344 edges and 91 vertex of which 83 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 9 with 2 rules applied. Total rules applied 2271 place count 83 transition count 181
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2276 place count 83 transition count 176
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2277 place count 83 transition count 176
Applied a total of 2277 rules in 197 ms. Remains 83 /4222 variables (removed 4139) and now considering 176/5801 (removed 5625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 83/4222 places, 176/5801 transitions.
Finished random walk after 106 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Support contains 4 out of 4222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4222/4222 places, 5801/5801 transitions.
Graph (trivial) has 5102 edges and 4222 vertex of which 3130 / 4222 are part of one of the 32 SCC in 2 ms
Free SCC test removed 3098 places
Ensure Unique test removed 4178 transitions
Reduce isomorphic transitions removed 4178 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 1123 transition count 1595
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 41 rules applied. Total rules applied 69 place count 1096 transition count 1581
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 78 place count 1087 transition count 1581
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 78 place count 1087 transition count 1523
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 194 place count 1029 transition count 1523
Discarding 261 places :
Symmetric choice reduction at 3 with 261 rule applications. Total rules 455 place count 768 transition count 1130
Iterating global reduction 3 with 261 rules applied. Total rules applied 716 place count 768 transition count 1130
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 907 place count 577 transition count 900
Iterating global reduction 3 with 191 rules applied. Total rules applied 1098 place count 577 transition count 900
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 3 with 191 rules applied. Total rules applied 1289 place count 577 transition count 709
Performed 160 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 320 rules applied. Total rules applied 1609 place count 417 transition count 547
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1613 place count 417 transition count 543
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 1615 place count 416 transition count 542
Performed 18 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1651 place count 398 transition count 640
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 1713 place count 398 transition count 578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1715 place count 397 transition count 589
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1723 place count 397 transition count 581
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 1764 place count 397 transition count 540
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1766 place count 396 transition count 559
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1770 place count 396 transition count 555
Applied a total of 1770 rules in 278 ms. Remains 396 /4222 variables (removed 3826) and now considering 555/5801 (removed 5246) transitions.
[2024-05-26 03:38:41] [INFO ] Flow matrix only has 524 transitions (discarded 31 similar events)
// Phase 1: matrix 524 rows 396 cols
[2024-05-26 03:38:41] [INFO ] Computed 66 invariants in 2 ms
[2024-05-26 03:38:41] [INFO ] Implicit Places using invariants in 374 ms returned [10, 44, 85, 121, 188, 250, 296, 333, 376]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 376 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 387/4222 places, 555/5801 transitions.
Graph (trivial) has 270 edges and 387 vertex of which 48 / 387 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 363 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 362 transition count 496
Applied a total of 13 rules in 33 ms. Remains 362 /387 variables (removed 25) and now considering 496/555 (removed 59) transitions.
[2024-05-26 03:38:41] [INFO ] Flow matrix only has 464 transitions (discarded 32 similar events)
// Phase 1: matrix 464 rows 362 cols
[2024-05-26 03:38:41] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:38:42] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-26 03:38:42] [INFO ] Flow matrix only has 464 transitions (discarded 32 similar events)
[2024-05-26 03:38:42] [INFO ] Invariant cache hit.
[2024-05-26 03:38:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-26 03:38:42] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 362/4222 places, 496/5801 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1373 ms. Remains : 362/4222 places, 496/5801 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 03:38:43] [INFO ] Flow matrix only has 464 transitions (discarded 32 similar events)
[2024-05-26 03:38:43] [INFO ] Invariant cache hit.
[2024-05-26 03:38:43] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 03:38:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 03:38:43] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 03:38:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-26 03:38:43] [INFO ] After 50ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 03:38:43] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-26 03:38:43] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 496/496 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 362 transition count 463
Free-agglomeration rule applied 181 times.
Iterating global reduction 1 with 181 rules applied. Total rules applied 214 place count 362 transition count 282
Reduce places removed 211 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 327 edges and 151 vertex of which 51 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 135 output transitions
Drop transitions removed 135 transitions
Graph (trivial) has 48 edges and 51 vertex of which 24 / 51 are part of one of the 5 SCC in 0 ms
Free SCC test removed 19 places
Iterating post reduction 1 with 225 rules applied. Total rules applied 439 place count 32 transition count 135
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 479 place count 32 transition count 95
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 489 place count 32 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 490 place count 32 transition count 84
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 116 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 492 place count 28 transition count 84
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 496 place count 28 transition count 80
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 499 place count 28 transition count 80
Applied a total of 499 rules in 22 ms. Remains 28 /362 variables (removed 334) and now considering 80/496 (removed 416) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 28/362 places, 80/496 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 261 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Stuttering criterion allowed to conclude after 22659 steps with 291 reset in 147 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLCardinality-02 finished in 24214 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(p0)||X(F((X((p2 U (p3||G(p2))))&&p1)))))'
Support contains 8 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4249 transition count 5842
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4249 transition count 5842
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 4242 transition count 5832
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 4242 transition count 5832
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 4238 transition count 5826
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 4238 transition count 5826
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 4236 transition count 5824
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 4236 transition count 5824
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 4234 transition count 5819
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 4234 transition count 5819
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 4232 transition count 5815
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 4232 transition count 5815
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 4232 transition count 5814
Applied a total of 73 rules in 1896 ms. Remains 4232 /4268 variables (removed 36) and now considering 5814/5861 (removed 47) transitions.
// Phase 1: matrix 5814 rows 4232 cols
[2024-05-26 03:38:46] [INFO ] Computed 66 invariants in 29 ms
[2024-05-26 03:38:47] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-26 03:38:47] [INFO ] Invariant cache hit.
[2024-05-26 03:38:48] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2024-05-26 03:38:48] [INFO ] Invariant cache hit.
[2024-05-26 03:38:51] [INFO ] Dead Transitions using invariants and state equation in 3141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4232/4268 places, 5814/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6573 ms. Remains : 4232/4268 places, 5814/5861 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p3) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3134 0) (EQ s4062 1)), p1:(AND (EQ s3872 0) (EQ s3077 1)), p3:(AND (NOT (OR (EQ s2506 0) (EQ s3764 1))) (OR (EQ s1874 0) (EQ s695 1))), p2:(O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2412 steps with 0 reset in 13 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLCardinality-03 finished in 6859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&((G(p2)&&X(p3))||p1))))'
Support contains 6 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4245 transition count 5838
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4245 transition count 5838
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 4236 transition count 5825
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 4236 transition count 5825
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 4231 transition count 5817
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 4231 transition count 5817
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 4228 transition count 5814
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 4228 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 4225 transition count 5808
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 4225 transition count 5808
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 4222 transition count 5803
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 4222 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 4222 transition count 5802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 4221 transition count 5800
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 4221 transition count 5800
Applied a total of 95 rules in 2152 ms. Remains 4221 /4268 variables (removed 47) and now considering 5800/5861 (removed 61) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2024-05-26 03:38:53] [INFO ] Computed 66 invariants in 29 ms
[2024-05-26 03:38:54] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-05-26 03:38:54] [INFO ] Invariant cache hit.
[2024-05-26 03:38:55] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2024-05-26 03:38:55] [INFO ] Invariant cache hit.
[2024-05-26 03:38:58] [INFO ] Dead Transitions using invariants and state equation in 3171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4268 places, 5800/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6866 ms. Remains : 4221/4268 places, 5800/5861 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p2), (AND p2 (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(OR (EQ s2702 0) (EQ s2944 1)), p2:(AND (EQ s267 0) (EQ s788 1)), p0:(AND (EQ s3450 0) (EQ s2873 1)), p3:(OR (EQ s2702 0) (EQ s2944 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2795 steps with 0 reset in 13 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLCardinality-04 finished in 7164 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((p0||X(p1))) U (p2&&X(p0))))'
Support contains 5 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4248 transition count 5841
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4248 transition count 5841
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 4240 transition count 5830
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 4240 transition count 5830
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 4236 transition count 5823
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 4236 transition count 5823
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 4234 transition count 5821
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 4234 transition count 5821
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 4232 transition count 5816
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 4232 transition count 5816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 4230 transition count 5813
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 4230 transition count 5813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 4229 transition count 5811
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 4229 transition count 5811
Applied a total of 78 rules in 2134 ms. Remains 4229 /4268 variables (removed 39) and now considering 5811/5861 (removed 50) transitions.
// Phase 1: matrix 5811 rows 4229 cols
[2024-05-26 03:39:00] [INFO ] Computed 66 invariants in 20 ms
[2024-05-26 03:39:01] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-26 03:39:01] [INFO ] Invariant cache hit.
[2024-05-26 03:39:02] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
[2024-05-26 03:39:02] [INFO ] Invariant cache hit.
[2024-05-26 03:39:05] [INFO ] Dead Transitions using invariants and state equation in 3159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4229/4268 places, 5811/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6817 ms. Remains : 4229/4268 places, 5811/5861 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=p2, acceptance={0} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s4134 0) (EQ s2207 1)), p0:(EQ s4166 1), p1:(OR (EQ s2159 0) (EQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30803 reset in 1601 ms.
Product exploration explored 100000 steps with 30838 reset in 1504 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 p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 168 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 03:39:09] [INFO ] Invariant cache hit.
[2024-05-26 03:39:10] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 03:39:10] [INFO ] [Nat]Absence check using 66 positive place invariants in 51 ms returned sat
[2024-05-26 03:39:13] [INFO ] After 2758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 03:39:13] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 1 ms to minimize.
[2024-05-26 03:39:14] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 0 ms to minimize.
[2024-05-26 03:39:14] [INFO ] Deduced a trap composed of 159 places in 91 ms of which 0 ms to minimize.
[2024-05-26 03:39:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 974 ms
[2024-05-26 03:39:14] [INFO ] After 4122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 299 ms.
[2024-05-26 03:39:15] [INFO ] After 5053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 612 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 19 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 343 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true]
[2024-05-26 03:39:16] [INFO ] Invariant cache hit.
[2024-05-26 03:39:18] [INFO ] [Real]Absence check using 66 positive place invariants in 20 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 14 factoid took 354 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLCardinality-07 finished in 20493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 4245 transition count 5838
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 4245 transition count 5838
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 4236 transition count 5825
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 4236 transition count 5825
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 4231 transition count 5817
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 4231 transition count 5817
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 4228 transition count 5814
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 4228 transition count 5814
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 4225 transition count 5808
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 4225 transition count 5808
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 4222 transition count 5803
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 4222 transition count 5803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 4222 transition count 5802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 4221 transition count 5800
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 4221 transition count 5800
Applied a total of 95 rules in 2108 ms. Remains 4221 /4268 variables (removed 47) and now considering 5800/5861 (removed 61) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2024-05-26 03:39:21] [INFO ] Computed 66 invariants in 18 ms
[2024-05-26 03:39:22] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-05-26 03:39:22] [INFO ] Invariant cache hit.
[2024-05-26 03:39:22] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2024-05-26 03:39:22] [INFO ] Invariant cache hit.
[2024-05-26 03:39:26] [INFO ] Dead Transitions using invariants and state equation in 3218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4268 places, 5800/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6853 ms. Remains : 4221/4268 places, 5800/5861 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2327 0) (EQ s504 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2168 ms.
Product exploration explored 100000 steps with 50000 reset in 2168 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLCardinality-11 finished in 11390 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)||X(X(F(p1)))))'
Support contains 4 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 4246 transition count 5839
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 4246 transition count 5839
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 4239 transition count 5829
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 4239 transition count 5829
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 4234 transition count 5821
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 4234 transition count 5821
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 4231 transition count 5818
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 4231 transition count 5818
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 4228 transition count 5812
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 4228 transition count 5812
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 4225 transition count 5807
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 4225 transition count 5807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 4225 transition count 5806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 4224 transition count 5804
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 4224 transition count 5804
Applied a total of 89 rules in 2121 ms. Remains 4224 /4268 variables (removed 44) and now considering 5804/5861 (removed 57) transitions.
// Phase 1: matrix 5804 rows 4224 cols
[2024-05-26 03:39:32] [INFO ] Computed 66 invariants in 21 ms
[2024-05-26 03:39:33] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-26 03:39:33] [INFO ] Invariant cache hit.
[2024-05-26 03:39:34] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2024-05-26 03:39:34] [INFO ] Invariant cache hit.
[2024-05-26 03:39:37] [INFO ] Dead Transitions using invariants and state equation in 3170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4224/4268 places, 5804/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6824 ms. Remains : 4224/4268 places, 5804/5861 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s2393 1), p1:(OR (EQ s2539 0) (EQ s2110 1) (EQ s4085 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 33333 reset in 1525 ms.
Product exploration explored 100000 steps with 33333 reset in 1524 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), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 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-7B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLCardinality-12 finished in 10109 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((X(X(p0)) U p1))))'
Support contains 4 out of 4268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4268/4268 places, 5861/5861 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 4247 transition count 5840
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 4247 transition count 5840
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 4238 transition count 5827
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 4238 transition count 5827
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 4233 transition count 5819
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 4233 transition count 5819
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 4230 transition count 5816
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 4230 transition count 5816
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 4227 transition count 5810
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 4227 transition count 5810
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 4224 transition count 5805
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 4224 transition count 5805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 4224 transition count 5804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 4223 transition count 5802
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 4223 transition count 5802
Applied a total of 91 rules in 2102 ms. Remains 4223 /4268 variables (removed 45) and now considering 5802/5861 (removed 59) transitions.
// Phase 1: matrix 5802 rows 4223 cols
[2024-05-26 03:39:42] [INFO ] Computed 66 invariants in 18 ms
[2024-05-26 03:39:43] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-26 03:39:43] [INFO ] Invariant cache hit.
[2024-05-26 03:39:44] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2024-05-26 03:39:44] [INFO ] Invariant cache hit.
[2024-05-26 03:39:47] [INFO ] Dead Transitions using invariants and state equation in 3192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4223/4268 places, 5802/5861 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6848 ms. Remains : 4223/4268 places, 5802/5861 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2264 0) (EQ s714 1)), p0:(OR (EQ s2798 0) (EQ s2576 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 36 reset in 436 ms.
Product exploration explored 100000 steps with 36 reset in 479 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 p1), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 205618 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205618 steps, saw 198746 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-26 03:39:52] [INFO ] Invariant cache hit.
[2024-05-26 03:39:52] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 03:39:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 03:39:56] [INFO ] After 2905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 03:39:56] [INFO ] Deduced a trap composed of 157 places in 102 ms of which 1 ms to minimize.
[2024-05-26 03:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2024-05-26 03:39:57] [INFO ] After 3970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 441 ms.
[2024-05-26 03:39:57] [INFO ] After 5156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 753 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=150 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 4223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4223/4223 places, 5802/5802 transitions.
Applied a total of 0 rules in 320 ms. Remains 4223 /4223 variables (removed 0) and now considering 5802/5802 (removed 0) transitions.
[2024-05-26 03:39:58] [INFO ] Invariant cache hit.
[2024-05-26 03:39:59] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-05-26 03:39:59] [INFO ] Invariant cache hit.
[2024-05-26 03:40:00] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2024-05-26 03:40:00] [INFO ] Invariant cache hit.
[2024-05-26 03:40:03] [INFO ] Dead Transitions using invariants and state equation in 3148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4969 ms. Remains : 4223/4223 places, 5802/5802 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 208482 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208482 steps, saw 201511 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-26 03:40:06] [INFO ] Invariant cache hit.
[2024-05-26 03:40:07] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 03:40:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 52 ms returned sat
[2024-05-26 03:40:10] [INFO ] After 2874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 03:40:11] [INFO ] Deduced a trap composed of 157 places in 104 ms of which 0 ms to minimize.
[2024-05-26 03:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2024-05-26 03:40:12] [INFO ] After 3950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 428 ms.
[2024-05-26 03:40:12] [INFO ] After 5073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 997 steps, including 0 resets, run visited all 3 properties in 21 ms. (steps per millisecond=47 )
Parikh walk visited 3 properties in 21 ms.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 37 reset in 438 ms.
Product exploration explored 100000 steps with 36 reset in 476 ms.
Built C files in :
/tmp/ltsmin14466950860464585235
[2024-05-26 03:40:14] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14466950860464585235
Running compilation step : cd /tmp/ltsmin14466950860464585235;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14466950860464585235;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14466950860464585235;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 4223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4223/4223 places, 5802/5802 transitions.
Applied a total of 0 rules in 259 ms. Remains 4223 /4223 variables (removed 0) and now considering 5802/5802 (removed 0) transitions.
[2024-05-26 03:40:17] [INFO ] Invariant cache hit.
[2024-05-26 03:40:18] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-26 03:40:18] [INFO ] Invariant cache hit.
[2024-05-26 03:40:18] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2024-05-26 03:40:18] [INFO ] Invariant cache hit.
[2024-05-26 03:40:22] [INFO ] Dead Transitions using invariants and state equation in 3215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4983 ms. Remains : 4223/4223 places, 5802/5802 transitions.
Built C files in :
/tmp/ltsmin3661948785651068721
[2024-05-26 03:40:22] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3661948785651068721
Running compilation step : cd /tmp/ltsmin3661948785651068721;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3661948785651068721;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3661948785651068721;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-26 03:40:25] [INFO ] Flatten gal took : 131 ms
[2024-05-26 03:40:25] [INFO ] Flatten gal took : 136 ms
[2024-05-26 03:40:25] [INFO ] Time to serialize gal into /tmp/LTL7906881491927396749.gal : 33 ms
[2024-05-26 03:40:25] [INFO ] Time to serialize properties into /tmp/LTL6689808959455909219.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7906881491927396749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8127317802525596613.hoa' '-atoms' '/tmp/LTL6689808959455909219.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6689808959455909219.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8127317802525596613.hoa
Detected timeout of ITS tools.
[2024-05-26 03:40:41] [INFO ] Flatten gal took : 118 ms
[2024-05-26 03:40:41] [INFO ] Flatten gal took : 123 ms
[2024-05-26 03:40:41] [INFO ] Time to serialize gal into /tmp/LTL6488640193114798114.gal : 22 ms
[2024-05-26 03:40:41] [INFO ] Time to serialize properties into /tmp/LTL6729867527622301276.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/LTL6488640193114798114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6729867527622301276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X(X("((p4619==0)||(p4267==1))")))U("((p3733==0)||(p1162==1))")))))
Formula 0 simplified : GF(!"((p3733==0)||(p1162==1))" & X(!"((p3733==0)||(p1162==1))" W X!"((p4619==0)||(p4267==1))"))
Detected timeout of ITS tools.
[2024-05-26 03:40:56] [INFO ] Flatten gal took : 116 ms
[2024-05-26 03:40:56] [INFO ] Applying decomposition
[2024-05-26 03:40:56] [INFO ] Flatten gal took : 114 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/graph10989077147760327624.txt' '-o' '/tmp/graph10989077147760327624.bin' '-w' '/tmp/graph10989077147760327624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10989077147760327624.bin' '-l' '-1' '-v' '-w' '/tmp/graph10989077147760327624.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:40:57] [INFO ] Decomposing Gal with order
[2024-05-26 03:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:40:58] [INFO ] Removed a total of 1816 redundant transitions.
[2024-05-26 03:40:58] [INFO ] Flatten gal took : 436 ms
[2024-05-26 03:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 47 ms.
[2024-05-26 03:40:58] [INFO ] Time to serialize gal into /tmp/LTL6955909149091399152.gal : 52 ms
[2024-05-26 03:40:58] [INFO ] Time to serialize properties into /tmp/LTL4235851921141987527.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/LTL6955909149091399152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4235851921141987527.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G((X(X("((i21.u1124.p4619==0)||(i19.u1034.p4267==1))")))U("((i17.u908.p3733==0)||(i4.u316.p1162==1))")))))
Formula 0 simplified : GF(!"((i17.u908.p3733==0)||(i4.u316.p1162==1))" & X(!"((i17.u908.p3733==0)||(i4.u316.p1162==1))" W X!"((i21.u1124.p4619==0)||(i19.u1...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15394345901979503987
[2024-05-26 03:41:13] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15394345901979503987
Running compilation step : cd /tmp/ltsmin15394345901979503987;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15394345901979503987;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15394345901979503987;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property NoC3x3-PT-7B-LTLCardinality-13 finished in 96167 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((X(X(p0)) U p1))))'
[2024-05-26 03:41:17] [INFO ] Flatten gal took : 113 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4474607228579306824
[2024-05-26 03:41:17] [INFO ] Too many transitions (5861) to apply POR reductions. Disabling POR matrices.
[2024-05-26 03:41:17] [INFO ] Applying decomposition
[2024-05-26 03:41:17] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4474607228579306824
Running compilation step : cd /tmp/ltsmin4474607228579306824;'/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 03:41:17] [INFO ] Flatten gal took : 110 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/graph13461717662748613548.txt' '-o' '/tmp/graph13461717662748613548.bin' '-w' '/tmp/graph13461717662748613548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13461717662748613548.bin' '-l' '-1' '-v' '-w' '/tmp/graph13461717662748613548.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:41:17] [INFO ] Decomposing Gal with order
[2024-05-26 03:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:41:18] [INFO ] Removed a total of 1843 redundant transitions.
[2024-05-26 03:41:18] [INFO ] Flatten gal took : 222 ms
[2024-05-26 03:41:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 45 ms.
[2024-05-26 03:41:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality3815735183806137377.gal : 54 ms
[2024-05-26 03:41:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality6580614041850549163.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/LTLCardinality3815735183806137377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6580614041850549163.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 : !((F(G((X(X("((i21.u1132.p4619==0)||(i19.u1040.p4267==1))")))U("((i17.u915.p3733==0)||(i5.u288.p1162==1))")))))
Formula 0 simplified : GF(!"((i17.u915.p3733==0)||(i5.u288.p1162==1))" & X(!"((i17.u915.p3733==0)||(i5.u288.p1162==1))" W X!"((i21.u1132.p4619==0)||(i19.u1...172
Compilation finished in 20397 ms.
Running link step : cd /tmp/ltsmin4474607228579306824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin4474607228579306824;'/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((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 277006 ms.
FORMULA NoC3x3-PT-7B-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 507473 ms.

BK_STOP 1716695175748

--------------------
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-7B"
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-7B, 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-171654372800412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-7B.tgz
mv NoC3x3-PT-7B 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 ;