Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600652.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.8M Mar 5 18:22 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 CANConstruction-PT-050-LTLFireability-00
FORMULA_NAME CANConstruction-PT-050-LTLFireability-01
FORMULA_NAME CANConstruction-PT-050-LTLFireability-02
FORMULA_NAME CANConstruction-PT-050-LTLFireability-03
FORMULA_NAME CANConstruction-PT-050-LTLFireability-04
FORMULA_NAME CANConstruction-PT-050-LTLFireability-05
FORMULA_NAME CANConstruction-PT-050-LTLFireability-06
FORMULA_NAME CANConstruction-PT-050-LTLFireability-07
FORMULA_NAME CANConstruction-PT-050-LTLFireability-08
FORMULA_NAME CANConstruction-PT-050-LTLFireability-09
FORMULA_NAME CANConstruction-PT-050-LTLFireability-10
FORMULA_NAME CANConstruction-PT-050-LTLFireability-11
FORMULA_NAME CANConstruction-PT-050-LTLFireability-12
FORMULA_NAME CANConstruction-PT-050-LTLFireability-13
FORMULA_NAME CANConstruction-PT-050-LTLFireability-14
FORMULA_NAME CANConstruction-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678368228398

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 13:23:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 13:23:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:23:50] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2023-03-09 13:23:50] [INFO ] Transformed 5602 places.
[2023-03-09 13:23:50] [INFO ] Transformed 10400 transitions.
[2023-03-09 13:23:50] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANConstruction-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2389 places :
Symmetric choice reduction at 0 with 2389 rule applications. Total rules 2389 place count 3213 transition count 5622
Iterating global reduction 0 with 2389 rules applied. Total rules applied 4778 place count 3213 transition count 5622
Applied a total of 4778 rules in 778 ms. Remains 3213 /5602 variables (removed 2389) and now considering 5622/10400 (removed 4778) transitions.
// Phase 1: matrix 5622 rows 3213 cols
[2023-03-09 13:23:51] [INFO ] Computed 101 place invariants in 143 ms
[2023-03-09 13:23:53] [INFO ] Implicit Places using invariants in 1927 ms returned []
[2023-03-09 13:23:53] [INFO ] Invariant cache hit.
[2023-03-09 13:23:54] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:24:08] [INFO ] Implicit Places using invariants and state equation in 14838 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT with State Equation took 16810 ms to find 50 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3163/5602 places, 5622/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3113 transition count 5572
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3113 transition count 5572
Applied a total of 100 rules in 991 ms. Remains 3113 /3163 variables (removed 50) and now considering 5572/5622 (removed 50) transitions.
// Phase 1: matrix 5572 rows 3113 cols
[2023-03-09 13:24:09] [INFO ] Computed 51 place invariants in 73 ms
[2023-03-09 13:24:10] [INFO ] Implicit Places using invariants in 1647 ms returned []
[2023-03-09 13:24:10] [INFO ] Invariant cache hit.
[2023-03-09 13:24:11] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:24:23] [INFO ] Implicit Places using invariants and state equation in 13094 ms returned []
Implicit Place search using SMT with State Equation took 14749 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3113/5602 places, 5572/10400 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33332 ms. Remains : 3113/5602 places, 5572/10400 transitions.
Support contains 39 out of 3113 places after structural reductions.
[2023-03-09 13:24:24] [INFO ] Flatten gal took : 324 ms
[2023-03-09 13:24:24] [INFO ] Flatten gal took : 223 ms
[2023-03-09 13:24:25] [INFO ] Input system was already deterministic with 5572 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-09 13:24:25] [INFO ] Invariant cache hit.
[2023-03-09 13:24:26] [INFO ] [Real]Absence check using 51 positive place invariants in 91 ms returned sat
[2023-03-09 13:24:31] [INFO ] After 3845ms SMT Verify possible using state equation in real domain returned unsat :0 sat :12
[2023-03-09 13:24:31] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:24:35] [INFO ] After 3669ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 13:24:35] [INFO ] After 9054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 13:24:36] [INFO ] [Nat]Absence check using 51 positive place invariants in 72 ms returned sat
[2023-03-09 13:24:40] [INFO ] After 3988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 13:24:45] [INFO ] After 5179ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-09 13:24:50] [INFO ] After 9859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3012 ms.
[2023-03-09 13:24:53] [INFO ] After 18492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 219 ms.
Support contains 16 out of 3113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 3113 transition count 5233
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 1 with 339 rules applied. Total rules applied 678 place count 2774 transition count 5233
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 678 place count 2774 transition count 5183
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 778 place count 2724 transition count 5183
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 781 place count 2721 transition count 5177
Iterating global reduction 2 with 3 rules applied. Total rules applied 784 place count 2721 transition count 5177
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 787 place count 2721 transition count 5174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 790 place count 2718 transition count 5174
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 4 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 898 place count 2664 transition count 5120
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 901 place count 2664 transition count 5117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 904 place count 2661 transition count 5117
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 906 place count 2661 transition count 5117
Applied a total of 906 rules in 1644 ms. Remains 2661 /3113 variables (removed 452) and now considering 5117/5572 (removed 455) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1645 ms. Remains : 2661/3113 places, 5117/5572 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5117 rows 2661 cols
[2023-03-09 13:24:55] [INFO ] Computed 51 place invariants in 61 ms
[2023-03-09 13:24:56] [INFO ] [Real]Absence check using 51 positive place invariants in 61 ms returned sat
[2023-03-09 13:24:58] [INFO ] After 2091ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-09 13:24:58] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:25:00] [INFO ] After 1396ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:25:00] [INFO ] After 4222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 13:25:00] [INFO ] [Nat]Absence check using 51 positive place invariants in 60 ms returned sat
[2023-03-09 13:25:03] [INFO ] After 2234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 13:25:04] [INFO ] After 1716ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 13:25:06] [INFO ] After 3047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 932 ms.
[2023-03-09 13:25:07] [INFO ] After 6957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 5 ms.
Support contains 3 out of 2661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 5117/5117 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2661 transition count 5116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2660 transition count 5116
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 2655 transition count 5106
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 2655 transition count 5106
Applied a total of 12 rules in 904 ms. Remains 2655 /2661 variables (removed 6) and now considering 5106/5117 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 2655/2661 places, 5106/5117 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5106 rows 2655 cols
[2023-03-09 13:25:08] [INFO ] Computed 51 place invariants in 75 ms
[2023-03-09 13:25:08] [INFO ] [Real]Absence check using 51 positive place invariants in 62 ms returned sat
[2023-03-09 13:25:10] [INFO ] After 1845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:25:10] [INFO ] [Nat]Absence check using 51 positive place invariants in 93 ms returned sat
[2023-03-09 13:25:11] [INFO ] After 1383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:25:11] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:25:12] [INFO ] After 688ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:25:12] [INFO ] After 1029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-09 13:25:13] [INFO ] After 3132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 2 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p1)||p0)))))'
Support contains 4 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3104 transition count 5554
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3104 transition count 5554
Applied a total of 18 rules in 587 ms. Remains 3104 /3113 variables (removed 9) and now considering 5554/5572 (removed 18) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2023-03-09 13:25:14] [INFO ] Computed 51 place invariants in 63 ms
[2023-03-09 13:25:16] [INFO ] Implicit Places using invariants in 2068 ms returned []
[2023-03-09 13:25:16] [INFO ] Invariant cache hit.
[2023-03-09 13:25:17] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:25:25] [INFO ] Implicit Places using invariants and state equation in 9216 ms returned []
Implicit Place search using SMT with State Equation took 11293 ms to find 0 implicit places.
[2023-03-09 13:25:25] [INFO ] Invariant cache hit.
[2023-03-09 13:25:28] [INFO ] Dead Transitions using invariants and state equation in 2667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3113 places, 5554/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14550 ms. Remains : 3104/3113 places, 5554/5572 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (GEQ s2658 1) (AND (GEQ s35 1) (GEQ s570 1))), p1:(GEQ s866 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4693 steps with 9 reset in 93 ms.
FORMULA CANConstruction-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-00 finished in 15020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&p0)))'
Support contains 2 out of 3113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 3113 transition count 5233
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 1 with 339 rules applied. Total rules applied 678 place count 2774 transition count 5233
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 678 place count 2774 transition count 5183
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 778 place count 2724 transition count 5183
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 789 place count 2713 transition count 5161
Iterating global reduction 2 with 11 rules applied. Total rules applied 800 place count 2713 transition count 5161
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 811 place count 2713 transition count 5150
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 822 place count 2702 transition count 5150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 920 place count 2653 transition count 5101
Applied a total of 920 rules in 939 ms. Remains 2653 /3113 variables (removed 460) and now considering 5101/5572 (removed 471) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2023-03-09 13:25:29] [INFO ] Computed 51 place invariants in 92 ms
[2023-03-09 13:25:31] [INFO ] Implicit Places using invariants in 1884 ms returned []
[2023-03-09 13:25:31] [INFO ] Invariant cache hit.
[2023-03-09 13:25:33] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:26:03] [INFO ] Performed 1300/2653 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 13:26:33] [INFO ] Performed 2531/2653 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-09 13:26:36] [INFO ] Implicit Places using invariants and state equation in 64680 ms returned []
Implicit Place search using SMT with State Equation took 66567 ms to find 0 implicit places.
[2023-03-09 13:26:36] [INFO ] Redundant transitions in 506 ms returned []
[2023-03-09 13:26:36] [INFO ] Invariant cache hit.
[2023-03-09 13:26:39] [INFO ] Dead Transitions using invariants and state equation in 2569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2653/3113 places, 5101/5572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70603 ms. Remains : 2653/3113 places, 5101/5572 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s121 1) (GEQ s1074 1)), p0:(AND (GEQ s121 1) (GEQ s1074 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 351 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-02 finished in 70838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U p0))'
Support contains 3 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3103 transition count 5552
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3103 transition count 5552
Applied a total of 20 rules in 572 ms. Remains 3103 /3113 variables (removed 10) and now considering 5552/5572 (removed 20) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2023-03-09 13:26:40] [INFO ] Computed 51 place invariants in 67 ms
[2023-03-09 13:26:41] [INFO ] Implicit Places using invariants in 1860 ms returned []
[2023-03-09 13:26:41] [INFO ] Invariant cache hit.
[2023-03-09 13:26:43] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 3367 ms to find 0 implicit places.
[2023-03-09 13:26:43] [INFO ] Invariant cache hit.
[2023-03-09 13:26:45] [INFO ] Dead Transitions using invariants and state equation in 2423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3113 places, 5552/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6364 ms. Remains : 3103/3113 places, 5552/5572 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s1876 1), p1:(AND (GEQ s18 1) (GEQ s443 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-03 finished in 6570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3102 transition count 5550
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3102 transition count 5550
Applied a total of 22 rules in 461 ms. Remains 3102 /3113 variables (removed 11) and now considering 5550/5572 (removed 22) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2023-03-09 13:26:46] [INFO ] Computed 51 place invariants in 65 ms
[2023-03-09 13:26:48] [INFO ] Implicit Places using invariants in 1977 ms returned []
[2023-03-09 13:26:48] [INFO ] Invariant cache hit.
[2023-03-09 13:26:49] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:27:00] [INFO ] Implicit Places using invariants and state equation in 11763 ms returned []
Implicit Place search using SMT with State Equation took 13741 ms to find 0 implicit places.
[2023-03-09 13:27:00] [INFO ] Invariant cache hit.
[2023-03-09 13:27:02] [INFO ] Dead Transitions using invariants and state equation in 2698 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3113 places, 5550/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16902 ms. Remains : 3102/3113 places, 5550/5572 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s162 1) (LT s203 1) (AND (GEQ s174 1) (GEQ s3018 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1848 ms.
Product exploration explored 100000 steps with 33333 reset in 1692 ms.
Computed a total of 151 stabilizing places and 200 stable transitions
Computed a total of 151 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-050-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-050-LTLFireability-04 finished in 20676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(G(!p1))))))'
Support contains 4 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3102 transition count 5550
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3102 transition count 5550
Applied a total of 22 rules in 426 ms. Remains 3102 /3113 variables (removed 11) and now considering 5550/5572 (removed 22) transitions.
[2023-03-09 13:27:07] [INFO ] Invariant cache hit.
[2023-03-09 13:27:08] [INFO ] Implicit Places using invariants in 1696 ms returned []
[2023-03-09 13:27:08] [INFO ] Invariant cache hit.
[2023-03-09 13:27:09] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:27:20] [INFO ] Implicit Places using invariants and state equation in 12122 ms returned []
Implicit Place search using SMT with State Equation took 13821 ms to find 0 implicit places.
[2023-03-09 13:27:20] [INFO ] Invariant cache hit.
[2023-03-09 13:27:23] [INFO ] Dead Transitions using invariants and state equation in 2580 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3102/3113 places, 5550/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16828 ms. Remains : 3102/3113 places, 5550/5572 transitions.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (GEQ s414 1) (GEQ s1028 1)), p0:(AND (GEQ s30 1) (GEQ s1242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5945 steps with 6 reset in 52 ms.
FORMULA CANConstruction-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-05 finished in 17045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U G(p1)))'
Support contains 1 out of 3113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 3113 transition count 5234
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 2775 transition count 5234
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 676 place count 2775 transition count 5184
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 776 place count 2725 transition count 5184
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 786 place count 2715 transition count 5164
Iterating global reduction 2 with 10 rules applied. Total rules applied 796 place count 2715 transition count 5164
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 806 place count 2715 transition count 5154
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 816 place count 2705 transition count 5154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 916 place count 2655 transition count 5104
Applied a total of 916 rules in 858 ms. Remains 2655 /3113 variables (removed 458) and now considering 5104/5572 (removed 468) transitions.
// Phase 1: matrix 5104 rows 2655 cols
[2023-03-09 13:27:24] [INFO ] Computed 51 place invariants in 50 ms
[2023-03-09 13:27:26] [INFO ] Implicit Places using invariants in 1736 ms returned []
[2023-03-09 13:27:26] [INFO ] Invariant cache hit.
[2023-03-09 13:27:27] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:27:35] [INFO ] Implicit Places using invariants and state equation in 9154 ms returned []
Implicit Place search using SMT with State Equation took 10891 ms to find 0 implicit places.
[2023-03-09 13:27:35] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-09 13:27:35] [INFO ] Invariant cache hit.
[2023-03-09 13:27:37] [INFO ] Dead Transitions using invariants and state equation in 2047 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2655/3113 places, 5104/5572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13972 ms. Remains : 2655/3113 places, 5104/5572 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s2010 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 324 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-06 finished in 14028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||X(X(p1))) U G(p2)))))'
Support contains 4 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3104 transition count 5554
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3104 transition count 5554
Applied a total of 18 rules in 409 ms. Remains 3104 /3113 variables (removed 9) and now considering 5554/5572 (removed 18) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2023-03-09 13:27:38] [INFO ] Computed 51 place invariants in 68 ms
[2023-03-09 13:27:39] [INFO ] Implicit Places using invariants in 1727 ms returned []
[2023-03-09 13:27:39] [INFO ] Invariant cache hit.
[2023-03-09 13:27:40] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:27:41] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 3183 ms to find 0 implicit places.
[2023-03-09 13:27:41] [INFO ] Invariant cache hit.
[2023-03-09 13:27:44] [INFO ] Dead Transitions using invariants and state equation in 2890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3104/3113 places, 5554/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6487 ms. Remains : 3104/3113 places, 5554/5572 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s162 1) (GEQ s860 1)), p0:(GEQ s2321 1), p1:(GEQ s2479 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-07 finished in 6927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 5 out of 3113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 3113 transition count 5235
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 2776 transition count 5235
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 674 place count 2776 transition count 5185
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 774 place count 2726 transition count 5185
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 784 place count 2716 transition count 5165
Iterating global reduction 2 with 10 rules applied. Total rules applied 794 place count 2716 transition count 5165
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 10 rules applied. Total rules applied 804 place count 2716 transition count 5155
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 814 place count 2706 transition count 5155
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 912 place count 2657 transition count 5106
Applied a total of 912 rules in 974 ms. Remains 2657 /3113 variables (removed 456) and now considering 5106/5572 (removed 466) transitions.
// Phase 1: matrix 5106 rows 2657 cols
[2023-03-09 13:27:45] [INFO ] Computed 51 place invariants in 74 ms
[2023-03-09 13:27:47] [INFO ] Implicit Places using invariants in 1776 ms returned []
[2023-03-09 13:27:47] [INFO ] Invariant cache hit.
[2023-03-09 13:27:48] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:27:58] [INFO ] Implicit Places using invariants and state equation in 10648 ms returned []
Implicit Place search using SMT with State Equation took 12430 ms to find 0 implicit places.
[2023-03-09 13:27:58] [INFO ] Redundant transitions in 377 ms returned []
[2023-03-09 13:27:58] [INFO ] Invariant cache hit.
[2023-03-09 13:28:00] [INFO ] Dead Transitions using invariants and state equation in 2168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2657/3113 places, 5106/5572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15962 ms. Remains : 2657/3113 places, 5106/5572 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s144 1) (LT s152 1)), p1:(LT s2629 1), p2:(OR (LT s89 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 310 reset in 973 ms.
Stack based approach found an accepted trace after 22694 steps with 67 reset with depth 311 and stack size 310 in 220 ms.
FORMULA CANConstruction-PT-050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-09 finished in 17386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(X(F(p2))))))'
Support contains 5 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3105 transition count 5556
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3105 transition count 5556
Applied a total of 16 rules in 414 ms. Remains 3105 /3113 variables (removed 8) and now considering 5556/5572 (removed 16) transitions.
// Phase 1: matrix 5556 rows 3105 cols
[2023-03-09 13:28:02] [INFO ] Computed 51 place invariants in 58 ms
[2023-03-09 13:28:04] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-09 13:28:04] [INFO ] Invariant cache hit.
[2023-03-09 13:28:04] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:28:17] [INFO ] Implicit Places using invariants and state equation in 13797 ms returned []
Implicit Place search using SMT with State Equation took 15340 ms to find 0 implicit places.
[2023-03-09 13:28:17] [INFO ] Invariant cache hit.
[2023-03-09 13:28:20] [INFO ] Dead Transitions using invariants and state equation in 2426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3105/3113 places, 5556/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18181 ms. Remains : 3105/3113 places, 5556/5572 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s1447 1), p0:(AND (GEQ s2791 1) (GEQ s933 1)), p2:(AND (GEQ s138 1) (GEQ s1988 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 841 steps with 0 reset in 11 ms.
FORMULA CANConstruction-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-11 finished in 18392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0||G(p1)))))))'
Support contains 3 out of 3113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3103 transition count 5552
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3103 transition count 5552
Applied a total of 20 rules in 504 ms. Remains 3103 /3113 variables (removed 10) and now considering 5552/5572 (removed 20) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2023-03-09 13:28:21] [INFO ] Computed 51 place invariants in 60 ms
[2023-03-09 13:28:22] [INFO ] Implicit Places using invariants in 1812 ms returned []
[2023-03-09 13:28:22] [INFO ] Invariant cache hit.
[2023-03-09 13:28:23] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:28:36] [INFO ] Implicit Places using invariants and state equation in 13580 ms returned []
Implicit Place search using SMT with State Equation took 15397 ms to find 0 implicit places.
[2023-03-09 13:28:36] [INFO ] Invariant cache hit.
[2023-03-09 13:28:38] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3103/3113 places, 5552/5572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18400 ms. Remains : 3103/3113 places, 5552/5572 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (GEQ s450 1) (GEQ s1669 1)), p0:(GEQ s1094 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-14 finished in 18592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 3113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3113/3113 places, 5572/5572 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3113 transition count 5236
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2777 transition count 5236
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2777 transition count 5186
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2727 transition count 5186
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 783 place count 2716 transition count 5164
Iterating global reduction 2 with 11 rules applied. Total rules applied 794 place count 2716 transition count 5164
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 805 place count 2716 transition count 5153
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 816 place count 2705 transition count 5153
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 914 place count 2656 transition count 5104
Applied a total of 914 rules in 650 ms. Remains 2656 /3113 variables (removed 457) and now considering 5104/5572 (removed 468) transitions.
// Phase 1: matrix 5104 rows 2656 cols
[2023-03-09 13:28:39] [INFO ] Computed 51 place invariants in 77 ms
[2023-03-09 13:28:41] [INFO ] Implicit Places using invariants in 1590 ms returned []
[2023-03-09 13:28:41] [INFO ] Invariant cache hit.
[2023-03-09 13:28:42] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-09 13:28:50] [INFO ] Implicit Places using invariants and state equation in 9554 ms returned []
Implicit Place search using SMT with State Equation took 11145 ms to find 0 implicit places.
[2023-03-09 13:28:51] [INFO ] Redundant transitions in 354 ms returned []
[2023-03-09 13:28:51] [INFO ] Invariant cache hit.
[2023-03-09 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 2182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2656/3113 places, 5104/5572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14337 ms. Remains : 2656/3113 places, 5104/5572 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-LTLFireability-15 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s11 1), p1:(OR (LT s111 1) (LT s128 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 289 reset in 990 ms.
Stack based approach found an accepted trace after 249 steps with 0 reset with depth 250 and stack size 250 in 3 ms.
FORMULA CANConstruction-PT-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-050-LTLFireability-15 finished in 15433 ms.
All properties solved by simple procedures.
Total runtime 304501 ms.

BK_STOP 1678368534963

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-050"
export BK_EXAMINATION="LTLFireability"
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 CANConstruction-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690600652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;