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.r517-tall-167987243600219.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 itstools
Input is EisenbergMcGuire-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 121K 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-03-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680822435713

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-06 23:07:17] [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]
[2023-04-06 23:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:07:17] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-04-06 23:07:17] [INFO ] Transformed 117 places.
[2023-04-06 23:07:17] [INFO ] Transformed 216 transitions.
[2023-04-06 23:07:17] [INFO ] Found NUPN structural information;
[2023-04-06 23:07:17] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 20 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2023-04-06 23:07:17] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2023-04-06 23:07:17] [INFO ] Computed 10 invariants in 9 ms
[2023-04-06 23:07:17] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-04-06 23:07:17] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-06 23:07:17] [INFO ] Invariant cache hit.
[2023-04-06 23:07:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-04-06 23:07:17] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-04-06 23:07:17] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-06 23:07:17] [INFO ] Invariant cache hit.
[2023-04-06 23:07:17] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 112/117 places, 201/216 transitions.
Support contains 32 out of 112 places after structural reductions.
[2023-04-06 23:07:18] [INFO ] Flatten gal took : 34 ms
[2023-04-06 23:07:18] [INFO ] Flatten gal took : 16 ms
[2023-04-06 23:07:18] [INFO ] Input system was already deterministic with 201 transitions.
Support contains 30 out of 112 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:07:18] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-06 23:07:18] [INFO ] Invariant cache hit.
[2023-04-06 23:07:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:07:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-06 23:07:18] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 23:07:18] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:07:18] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-04-06 23:07:18] [INFO ] After 35ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:07:18] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
[2023-04-06 23:07:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 23:07:18] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-04-06 23:07:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-04-06 23:07:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-04-06 23:07:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2023-04-06 23:07:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-04-06 23:07:19] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 23:07:19] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 201/201 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 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 109 transition count 169
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 80 transition count 169
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 74 transition count 163
Applied a total of 76 rules in 22 ms. Remains 74 /112 variables (removed 38) and now considering 163/201 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 74/112 places, 163/201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :1
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 23:07:19] [INFO ] Flow matrix only has 100 transitions (discarded 63 similar events)
// Phase 1: matrix 100 rows 74 cols
[2023-04-06 23:07:19] [INFO ] Computed 10 invariants in 5 ms
[2023-04-06 23:07:19] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 23:07:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-04-06 23:07:19] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 23:07:19] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 23:07:19] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-04-06 23:07:19] [INFO ] After 19ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:07:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-04-06 23:07:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-04-06 23:07:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-04-06 23:07:19] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-06 23:07:19] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 163/163 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 74 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 162
Applied a total of 2 rules in 16 ms. Remains 73 /74 variables (removed 1) and now considering 162/163 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 73/74 places, 162/163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 234 steps, run visited all 2 properties in 16 ms. (steps per millisecond=14 )
Probabilistic random walk after 234 steps, saw 167 distinct states, run finished after 16 ms. (steps per millisecond=14 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 5 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2023-04-06 23:07:19] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2023-04-06 23:07:19] [INFO ] Computed 10 invariants in 1 ms
[2023-04-06 23:07:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-04-06 23:07:20] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:20] [INFO ] Invariant cache hit.
[2023-04-06 23:07:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:20] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-04-06 23:07:20] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:20] [INFO ] Invariant cache hit.
[2023-04-06 23:07:20] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 111/112 places, 198/201 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 158 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s85 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 4 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-00 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 8 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2023-04-06 23:07:20] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:20] [INFO ] Invariant cache hit.
[2023-04-06 23:07:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-04-06 23:07:20] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:20] [INFO ] Invariant cache hit.
[2023-04-06 23:07:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:20] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-04-06 23:07:20] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:20] [INFO ] Invariant cache hit.
[2023-04-06 23:07:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s49 1), p0:(OR (EQ s54 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Product exploration explored 100000 steps with 50000 reset in 207 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 : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-01 finished in 937 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((F(p1)&&p0)))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 201/201 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 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 6 place count 109 transition count 171
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 82 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 81 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 81 transition count 168
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 75 transition count 162
Applied a total of 74 rules in 20 ms. Remains 75 /112 variables (removed 37) and now considering 162/201 (removed 39) transitions.
[2023-04-06 23:07:21] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
// Phase 1: matrix 99 rows 75 cols
[2023-04-06 23:07:21] [INFO ] Computed 10 invariants in 9 ms
[2023-04-06 23:07:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-04-06 23:07:21] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2023-04-06 23:07:21] [INFO ] Invariant cache hit.
[2023-04-06 23:07:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:21] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-04-06 23:07:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-06 23:07:21] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2023-04-06 23:07:21] [INFO ] Invariant cache hit.
[2023-04-06 23:07:21] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/112 places, 162/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 75/112 places, 162/201 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s67 0) (EQ s34 1) (EQ s37 0) (EQ s24 1)), p0:(AND (EQ s67 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 955 reset in 114 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-02 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 201/201 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 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 109 transition count 169
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 80 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 79 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 79 transition count 166
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 74 transition count 161
Applied a total of 76 rules in 22 ms. Remains 74 /112 variables (removed 38) and now considering 161/201 (removed 40) transitions.
[2023-04-06 23:07:21] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2023-04-06 23:07:21] [INFO ] Computed 10 invariants in 1 ms
[2023-04-06 23:07:21] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-04-06 23:07:21] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2023-04-06 23:07:21] [INFO ] Invariant cache hit.
[2023-04-06 23:07:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:21] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-04-06 23:07:21] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 23:07:21] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2023-04-06 23:07:21] [INFO ] Invariant cache hit.
[2023-04-06 23:07:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/112 places, 161/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 74/112 places, 161/201 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-05 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 s28 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 329 steps with 0 reset with depth 330 and stack size 158 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-05 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 201/201 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 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 109 transition count 169
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 80 transition count 169
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 74 transition count 163
Applied a total of 76 rules in 18 ms. Remains 74 /112 variables (removed 38) and now considering 163/201 (removed 38) transitions.
[2023-04-06 23:07:22] [INFO ] Flow matrix only has 100 transitions (discarded 63 similar events)
// Phase 1: matrix 100 rows 74 cols
[2023-04-06 23:07:22] [INFO ] Computed 10 invariants in 0 ms
[2023-04-06 23:07:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-06 23:07:22] [INFO ] Flow matrix only has 100 transitions (discarded 63 similar events)
[2023-04-06 23:07:22] [INFO ] Invariant cache hit.
[2023-04-06 23:07:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-04-06 23:07:22] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-04-06 23:07:22] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 23:07:22] [INFO ] Flow matrix only has 100 transitions (discarded 63 similar events)
[2023-04-06 23:07:22] [INFO ] Invariant cache hit.
[2023-04-06 23:07:22] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/112 places, 163/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 74/112 places, 163/201 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s37 1)), p1:(OR (EQ s50 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3926 reset in 109 ms.
Stack based approach found an accepted trace after 620 steps with 20 reset with depth 5 and stack size 5 in 2 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-07 finished in 509 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 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 201/201 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 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 109 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 79 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 78 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 72 transition count 159
Applied a total of 80 rules in 18 ms. Remains 72 /112 variables (removed 40) and now considering 159/201 (removed 42) transitions.
[2023-04-06 23:07:22] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
// Phase 1: matrix 96 rows 72 cols
[2023-04-06 23:07:22] [INFO ] Computed 10 invariants in 1 ms
[2023-04-06 23:07:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-04-06 23:07:22] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-06 23:07:22] [INFO ] Invariant cache hit.
[2023-04-06 23:07:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:22] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-04-06 23:07:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-06 23:07:22] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-06 23:07:22] [INFO ] Invariant cache hit.
[2023-04-06 23:07:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/112 places, 159/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 72/112 places, 159/201 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-08 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:(EQ s12 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 2834 reset in 95 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-08 finished in 419 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) U p1)||F(G(p2))))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 201/201 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 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 6 place count 109 transition count 172
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 58 place count 83 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 82 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 82 transition count 169
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 77 transition count 164
Applied a total of 70 rules in 18 ms. Remains 77 /112 variables (removed 35) and now considering 164/201 (removed 37) transitions.
[2023-04-06 23:07:23] [INFO ] Flow matrix only has 101 transitions (discarded 63 similar events)
// Phase 1: matrix 101 rows 77 cols
[2023-04-06 23:07:23] [INFO ] Computed 10 invariants in 1 ms
[2023-04-06 23:07:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-04-06 23:07:23] [INFO ] Flow matrix only has 101 transitions (discarded 63 similar events)
[2023-04-06 23:07:23] [INFO ] Invariant cache hit.
[2023-04-06 23:07:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:23] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-04-06 23:07:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-06 23:07:23] [INFO ] Flow matrix only has 101 transitions (discarded 63 similar events)
[2023-04-06 23:07:23] [INFO ] Invariant cache hit.
[2023-04-06 23:07:23] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/112 places, 164/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 77/112 places, 164/201 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s26 1), p2:(OR (EQ s39 0) (EQ s19 1)), p0:(OR (EQ s55 0) (EQ s38 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 1346 reset in 124 ms.
Stack based approach found an accepted trace after 322 steps with 4 reset with depth 46 and stack size 40 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-10 finished in 447 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 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 5 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2023-04-06 23:07:23] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2023-04-06 23:07:23] [INFO ] Computed 10 invariants in 2 ms
[2023-04-06 23:07:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-04-06 23:07:23] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:23] [INFO ] Invariant cache hit.
[2023-04-06 23:07:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-04-06 23:07:23] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:23] [INFO ] Invariant cache hit.
[2023-04-06 23:07:23] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-12 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 s21 0) (EQ s1 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 146 ms.
Product exploration explored 100000 steps with 50000 reset in 147 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 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-03-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-12 finished in 654 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 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 4 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:24] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:24] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-14 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:(EQ s104 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-14 finished in 367 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((F(G(p1))&&p0))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 5 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:24] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 23:07:24] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-04-06 23:07:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-06 23:07:24] [INFO ] Invariant cache hit.
[2023-04-06 23:07:24] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s70 0) (NEQ s110 1)), p1:(AND (NEQ s70 0) (NEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-15 finished in 395 ms.
All properties solved by simple procedures.
Total runtime 7864 ms.

BK_STOP 1680822446206

--------------------
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="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-03, 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 r517-tall-167987243600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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