Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987245000259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is EisenbergMcGuire-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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 EisenbergMcGuire-PT-08-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680822333855

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 23:05:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 23:05:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:05:35] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-04-06 23:05:35] [INFO ] Transformed 712 places.
[2023-04-06 23:05:35] [INFO ] Transformed 2816 transitions.
[2023-04-06 23:05:35] [INFO ] Found NUPN structural information;
[2023-04-06 23:05:35] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 658 transition count 2384
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 658 transition count 2384
Applied a total of 108 rules in 108 ms. Remains 658 /712 variables (removed 54) and now considering 2384/2816 (removed 432) transitions.
[2023-04-06 23:05:35] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
// Phase 1: matrix 936 rows 658 cols
[2023-04-06 23:05:36] [INFO ] Computed 25 invariants in 19 ms
[2023-04-06 23:05:36] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-04-06 23:05:36] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2023-04-06 23:05:36] [INFO ] Invariant cache hit.
[2023-04-06 23:05:36] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-06 23:05:39] [INFO ] Implicit Places using invariants and state equation in 2829 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
[2023-04-06 23:05:39] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2023-04-06 23:05:39] [INFO ] Invariant cache hit.
[2023-04-06 23:05:40] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 658/712 places, 2384/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4406 ms. Remains : 658/712 places, 2384/2816 transitions.
Support contains 26 out of 658 places after structural reductions.
[2023-04-06 23:05:40] [INFO ] Flatten gal took : 160 ms
[2023-04-06 23:05:40] [INFO ] Flatten gal took : 109 ms
[2023-04-06 23:05:40] [INFO ] Input system was already deterministic with 2384 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 23:05:41] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2023-04-06 23:05:41] [INFO ] Invariant cache hit.
[2023-04-06 23:05:41] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 23:05:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 75 ms returned sat
[2023-04-06 23:05:41] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 23:05:41] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 23:05:42] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-06 23:05:42] [INFO ] After 131ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:05:42] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 15 ms to minimize.
[2023-04-06 23:05:42] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 1 ms to minimize.
[2023-04-06 23:05:43] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 1 ms to minimize.
[2023-04-06 23:05:43] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 2 ms to minimize.
[2023-04-06 23:05:43] [INFO ] Deduced a trap composed of 38 places in 410 ms of which 1 ms to minimize.
[2023-04-06 23:05:44] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2023-04-06 23:05:44] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 0 ms to minimize.
[2023-04-06 23:05:44] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 1 ms to minimize.
[2023-04-06 23:05:44] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2023-04-06 23:05:44] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-04-06 23:05:44] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2023-04-06 23:05:45] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-04-06 23:05:45] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 23:05:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 3014 ms
[2023-04-06 23:05:45] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2023-04-06 23:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-04-06 23:05:45] [INFO ] After 3392ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-06 23:05:45] [INFO ] After 4006ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 650 transition count 2178
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 452 transition count 2178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 450 transition count 2162
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 394 transition count 2106
Applied a total of 528 rules in 225 ms. Remains 394 /658 variables (removed 264) and now considering 2106/2384 (removed 278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 394/658 places, 2106/2384 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 516339 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516339 steps, saw 268454 distinct states, run finished after 3003 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:05:48] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2023-04-06 23:05:48] [INFO ] Computed 25 invariants in 12 ms
[2023-04-06 23:05:48] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:05:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-04-06 23:05:48] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-06 23:05:49] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:05:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:05:49] [INFO ] After 80ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:05:49] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-04-06 23:05:49] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2023-04-06 23:05:49] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:05:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
[2023-04-06 23:05:49] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 23:05:49] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 68 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 88 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2023-04-06 23:05:49] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2023-04-06 23:05:49] [INFO ] Invariant cache hit.
[2023-04-06 23:05:50] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-04-06 23:05:50] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2023-04-06 23:05:50] [INFO ] Invariant cache hit.
[2023-04-06 23:05:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:05:51] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-04-06 23:05:51] [INFO ] Redundant transitions in 113 ms returned []
[2023-04-06 23:05:51] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2023-04-06 23:05:51] [INFO ] Invariant cache hit.
[2023-04-06 23:05:52] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2907 ms. Remains : 394/394 places, 2106/2106 transitions.
Graph (trivial) has 1952 edges and 394 vertex of which 63 / 394 are part of one of the 8 SCC in 3 ms
Free SCC test removed 55 places
Drop transitions removed 212 transitions
Ensure Unique test removed 1402 transitions
Reduce isomorphic transitions removed 1614 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 339 transition count 413
Reduce places removed 79 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 260 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 259 transition count 412
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 161 place count 259 transition count 397
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 198 place count 237 transition count 397
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 420 place count 126 transition count 286
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 476 place count 126 transition count 230
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 492 place count 118 transition count 231
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 499 place count 118 transition count 224
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 506 place count 118 transition count 217
Free-agglomeration rule applied 51 times.
Iterating global reduction 5 with 51 rules applied. Total rules applied 557 place count 118 transition count 166
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 608 place count 67 transition count 166
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 616 place count 67 transition count 166
Applied a total of 616 rules in 52 ms. Remains 67 /394 variables (removed 327) and now considering 166/2106 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 166 rows 67 cols
[2023-04-06 23:05:52] [INFO ] Computed 18 invariants in 1 ms
[2023-04-06 23:05:52] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:05:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 102 ms returned sat
[2023-04-06 23:05:52] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 14 ms returned sat
[2023-04-06 23:05:52] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:05:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 23:05:52] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:05:53] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 23:05:53] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 33 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-06 23:05:53] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-06 23:05:53] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 23:05:53] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-04-06 23:05:53] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:05:53] [INFO ] Invariant cache hit.
[2023-04-06 23:05:54] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:05:56] [INFO ] Implicit Places using invariants and state equation in 2898 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
[2023-04-06 23:05:56] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:05:56] [INFO ] Invariant cache hit.
[2023-04-06 23:05:57] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4249 ms. Remains : 656/658 places, 2368/2384 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 186 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-00 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 s366 0) (EQ s400 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 954 ms.
Product exploration explored 100000 steps with 50000 reset in 836 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 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 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-00 finished in 6332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 52 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-06 23:05:59] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:05:59] [INFO ] Invariant cache hit.
[2023-04-06 23:05:59] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-04-06 23:05:59] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:05:59] [INFO ] Invariant cache hit.
[2023-04-06 23:06:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:03] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
[2023-04-06 23:06:03] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:03] [INFO ] Invariant cache hit.
[2023-04-06 23:06:03] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4447 ms. Remains : 656/658 places, 2368/2384 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33413 reset in 601 ms.
Product exploration explored 100000 steps with 33274 reset in 694 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 182 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 18 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-06 23:06:05] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:05] [INFO ] Invariant cache hit.
[2023-04-06 23:06:06] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-04-06 23:06:06] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:06] [INFO ] Invariant cache hit.
[2023-04-06 23:06:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:09] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 3582 ms to find 0 implicit places.
[2023-04-06 23:06:09] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:09] [INFO ] Invariant cache hit.
[2023-04-06 23:06:10] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4457 ms. Remains : 656/656 places, 2368/2368 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 180 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33408 reset in 594 ms.
Product exploration explored 100000 steps with 33326 reset in 625 ms.
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 11 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-06 23:06:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:12] [INFO ] Invariant cache hit.
[2023-04-06 23:06:12] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-04-06 23:06:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:12] [INFO ] Invariant cache hit.
[2023-04-06 23:06:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:15] [INFO ] Implicit Places using invariants and state equation in 2896 ms returned []
Implicit Place search using SMT with State Equation took 3325 ms to find 0 implicit places.
[2023-04-06 23:06:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:15] [INFO ] Invariant cache hit.
[2023-04-06 23:06:16] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4095 ms. Remains : 656/656 places, 2368/2368 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-01 finished in 17134 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(p1)))))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 25 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-06 23:06:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:16] [INFO ] Invariant cache hit.
[2023-04-06 23:06:17] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-04-06 23:06:17] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:17] [INFO ] Invariant cache hit.
[2023-04-06 23:06:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:19] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3348 ms to find 0 implicit places.
[2023-04-06 23:06:19] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:19] [INFO ] Invariant cache hit.
[2023-04-06 23:06:20] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4102 ms. Remains : 656/658 places, 2368/2384 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s648 0) (EQ s469 1)), p0:(AND (NEQ s196 0) (NEQ s343 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9 reset in 241 ms.
Stack based approach found an accepted trace after 2720 steps with 1 reset with depth 2712 and stack size 2674 in 9 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-02 finished in 4456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 650 transition count 2177
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 451 transition count 2177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 450 transition count 2169
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 450 transition count 2169
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 524 place count 396 transition count 2115
Applied a total of 524 rules in 154 ms. Remains 396 /658 variables (removed 262) and now considering 2115/2384 (removed 269) transitions.
[2023-04-06 23:06:21] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
// Phase 1: matrix 667 rows 396 cols
[2023-04-06 23:06:21] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 23:06:21] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-04-06 23:06:21] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2023-04-06 23:06:21] [INFO ] Invariant cache hit.
[2023-04-06 23:06:21] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-06 23:06:23] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2023-04-06 23:06:23] [INFO ] Redundant transitions in 91 ms returned []
[2023-04-06 23:06:23] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2023-04-06 23:06:23] [INFO ] Invariant cache hit.
[2023-04-06 23:06:23] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 396/658 places, 2115/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2785 ms. Remains : 396/658 places, 2115/2384 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s74 0) (EQ s115 1)), p0:(OR (EQ s113 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 307 reset in 260 ms.
Stack based approach found an accepted trace after 1077 steps with 2 reset with depth 405 and stack size 356 in 4 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-03 finished in 3254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 656 transition count 2368
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 656 transition count 2368
Applied a total of 4 rules in 24 ms. Remains 656 /658 variables (removed 2) and now considering 2368/2384 (removed 16) transitions.
[2023-04-06 23:06:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-06 23:06:24] [INFO ] Computed 25 invariants in 11 ms
[2023-04-06 23:06:24] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-04-06 23:06:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:24] [INFO ] Invariant cache hit.
[2023-04-06 23:06:25] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:27] [INFO ] Implicit Places using invariants and state equation in 3050 ms returned []
Implicit Place search using SMT with State Equation took 3464 ms to find 0 implicit places.
[2023-04-06 23:06:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-06 23:06:27] [INFO ] Invariant cache hit.
[2023-04-06 23:06:28] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/658 places, 2368/2384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4205 ms. Remains : 656/658 places, 2368/2384 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s620 0) (EQ s650 1) (AND (NEQ s599 0) (NEQ s120 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 739 ms.
Product exploration explored 100000 steps with 50000 reset in 742 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-08 finished in 5832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 650 transition count 2179
Deduced a syphon composed of 197 places in 1 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 453 transition count 2179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 412 place count 451 transition count 2163
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 451 transition count 2163
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 526 place count 395 transition count 2107
Applied a total of 526 rules in 126 ms. Remains 395 /658 variables (removed 263) and now considering 2107/2384 (removed 277) transitions.
[2023-04-06 23:06:30] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
// Phase 1: matrix 659 rows 395 cols
[2023-04-06 23:06:30] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 23:06:30] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-04-06 23:06:30] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-06 23:06:30] [INFO ] Invariant cache hit.
[2023-04-06 23:06:30] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:32] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
[2023-04-06 23:06:32] [INFO ] Redundant transitions in 36 ms returned []
[2023-04-06 23:06:32] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-06 23:06:32] [INFO ] Invariant cache hit.
[2023-04-06 23:06:32] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 395/658 places, 2107/2384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2702 ms. Remains : 395/658 places, 2107/2384 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s192 0) (EQ s112 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 331 reset in 214 ms.
Stack based approach found an accepted trace after 681 steps with 3 reset with depth 219 and stack size 197 in 2 ms.
FORMULA EisenbergMcGuire-PT-08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-13 finished in 3017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-08-LTLCardinality-01
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 658/658 places, 2384/2384 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 658 transition count 2376
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 650 transition count 2376
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 650 transition count 2177
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 451 transition count 2177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 449 transition count 2161
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 449 transition count 2161
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 526 place count 395 transition count 2107
Applied a total of 526 rules in 80 ms. Remains 395 /658 variables (removed 263) and now considering 2107/2384 (removed 277) transitions.
[2023-04-06 23:06:33] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
// Phase 1: matrix 659 rows 395 cols
[2023-04-06 23:06:33] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 23:06:33] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-04-06 23:06:33] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-06 23:06:33] [INFO ] Invariant cache hit.
[2023-04-06 23:06:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 23:06:35] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2023-04-06 23:06:35] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2023-04-06 23:06:35] [INFO ] Invariant cache hit.
[2023-04-06 23:06:35] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 395/658 places, 2107/2384 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2511 ms. Remains : 395/658 places, 2107/2384 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33293 reset in 470 ms.
Stack based approach found an accepted trace after 19045 steps with 6326 reset with depth 13 and stack size 13 in 92 ms.
Treatment of property EisenbergMcGuire-PT-08-LTLCardinality-01 finished in 3282 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-04-06 23:06:36] [INFO ] Flatten gal took : 94 ms
[2023-04-06 23:06:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-06 23:06:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 658 places, 2384 transitions and 11712 arcs took 16 ms.
Total runtime 61234 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-08
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA EisenbergMcGuire-PT-08-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680822398062

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 EisenbergMcGuire-PT-08-LTLCardinality-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for EisenbergMcGuire-PT-08-LTLCardinality-01
lola: result : false
lola: markings : 9933
lola: fired transitions : 21188
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-08-LTLCardinality-01: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is EisenbergMcGuire-PT-08, 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 r519-tall-167987245000259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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