Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521300002.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 167K May 18 16:42 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-005-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716215651345

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 14:34:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:34:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:34:13] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-20 14:34:13] [INFO ] Transformed 112 places.
[2024-05-20 14:34:13] [INFO ] Transformed 140 transitions.
[2024-05-20 14:34:13] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-005-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 126
Applied a total of 14 rules in 20 ms. Remains 105 /112 variables (removed 7) and now considering 126/140 (removed 14) transitions.
// Phase 1: matrix 126 rows 105 cols
[2024-05-20 14:34:13] [INFO ] Computed 11 invariants in 11 ms
[2024-05-20 14:34:13] [INFO ] Implicit Places using invariants in 177 ms returned [12, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 205 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/112 places, 126/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 103/112 places, 126/140 transitions.
Support contains 40 out of 103 places after structural reductions.
[2024-05-20 14:34:13] [INFO ] Flatten gal took : 30 ms
[2024-05-20 14:34:13] [INFO ] Flatten gal took : 12 ms
[2024-05-20 14:34:13] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 33) seen :22
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 126 rows 103 cols
[2024-05-20 14:34:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-20 14:34:14] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-20 14:34:14] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-20 14:34:14] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:6
[2024-05-20 14:34:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-20 14:34:15] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-20 14:34:15] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-005-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 25 stable transitions
FORMULA CANConstruction-PT-005-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))) U G(p2)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 103 transition count 91
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 68 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 67 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 72 place count 67 transition count 88
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 65 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 59 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 59 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 96 place count 55 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 50 transition count 80
Applied a total of 106 rules in 22 ms. Remains 50 /103 variables (removed 53) and now considering 80/126 (removed 46) transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-05-20 14:34:15] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants in 94 ms returned [9, 16, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 96 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/103 places, 80/126 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 47 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 79
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 0 with 10 rules applied. Total rules applied 12 place count 41 transition count 74
Applied a total of 12 rules in 6 ms. Remains 41 /47 variables (removed 6) and now considering 74/80 (removed 6) transitions.
// Phase 1: matrix 74 rows 41 cols
[2024-05-20 14:34:15] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 14:34:15] [INFO ] Invariant cache hit.
[2024-05-20 14:34:15] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/103 places, 74/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 328 ms. Remains : 41/103 places, 74/126 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 300 ms :[(NOT p2), (NOT p0), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 s22), p0:(LEQ 1 s20), p1:(LEQ s7 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-01 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 103 transition count 90
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 67 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 66 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 74 place count 66 transition count 87
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 64 transition count 87
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 86 place count 56 transition count 71
Iterating global reduction 3 with 8 rules applied. Total rules applied 94 place count 56 transition count 71
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 56 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 54 transition count 69
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 104 place count 51 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 114 place count 46 transition count 76
Applied a total of 114 rules in 27 ms. Remains 46 /103 variables (removed 57) and now considering 76/126 (removed 50) transitions.
// Phase 1: matrix 76 rows 46 cols
[2024-05-20 14:34:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 94 ms returned [8, 14, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/103 places, 76/126 transitions.
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 0 with 12 rules applied. Total rules applied 12 place count 37 transition count 70
Applied a total of 12 rules in 5 ms. Remains 37 /43 variables (removed 6) and now considering 70/76 (removed 6) transitions.
// Phase 1: matrix 70 rows 37 cols
[2024-05-20 14:34:16] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 14:34:16] [INFO ] Invariant cache hit.
[2024-05-20 14:34:16] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/103 places, 70/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 37/103 places, 70/126 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s11)], 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 35 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-02 finished in 338 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&&G(p1)&&F(p2))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 126/126 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 95 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 95 transition count 112
Applied a total of 16 rules in 9 ms. Remains 95 /103 variables (removed 8) and now considering 112/126 (removed 14) transitions.
// Phase 1: matrix 112 rows 95 cols
[2024-05-20 14:34:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 52 ms returned [38, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 112/126 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 110
Applied a total of 4 rules in 5 ms. Remains 91 /93 variables (removed 2) and now considering 110/112 (removed 2) transitions.
// Phase 1: matrix 110 rows 91 cols
[2024-05-20 14:34:16] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-20 14:34:16] [INFO ] Invariant cache hit.
[2024-05-20 14:34:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/103 places, 110/126 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 91/103 places, 110/126 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT s86 s24), p2:(GT s78 s76), p0:(LEQ s35 s89)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-03 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 126/126 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 103 transition count 92
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 69 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 68 transition count 91
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 68 transition count 89
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 66 transition count 89
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 59 transition count 75
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 59 transition count 75
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 59 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 58 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 96 place count 55 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 104 place count 51 transition count 78
Applied a total of 104 rules in 18 ms. Remains 51 /103 variables (removed 52) and now considering 78/126 (removed 48) transitions.
// Phase 1: matrix 78 rows 51 cols
[2024-05-20 14:34:16] [INFO ] Computed 9 invariants in 0 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 40 ms returned [8, 14, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/103 places, 78/126 transitions.
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 0 with 12 rules applied. Total rules applied 12 place count 42 transition count 72
Applied a total of 12 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 72/78 (removed 6) transitions.
// Phase 1: matrix 72 rows 42 cols
[2024-05-20 14:34:16] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 14:34:17] [INFO ] Invariant cache hit.
[2024-05-20 14:34:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/103 places, 72/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 42/103 places, 72/126 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), 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={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s8 s27), p0:(GT s17 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-05 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(p0))))||G(p1))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 126/126 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 93 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 93 transition count 108
Applied a total of 20 rules in 4 ms. Remains 93 /103 variables (removed 10) and now considering 108/126 (removed 18) transitions.
// Phase 1: matrix 108 rows 93 cols
[2024-05-20 14:34:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants in 65 ms returned [24, 38, 64]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/103 places, 108/126 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 87 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 87 transition count 105
Applied a total of 6 rules in 2 ms. Remains 87 /90 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 87 cols
[2024-05-20 14:34:17] [INFO ] Computed 6 invariants in 2 ms
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 14:34:17] [INFO ] Invariant cache hit.
[2024-05-20 14:34:17] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/103 places, 105/126 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 87/103 places, 105/126 transitions.
Stuttering acceptance computed with spot in 453 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 9}], [{ cond=true, acceptance={} source=1 dest: 11}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 6}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p1), acceptance={} source=10 dest: 9}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=p1, acceptance={} source=11 dest: 7}, { cond=(NOT p1), acceptance={} source=11 dest: 8}]], initial=1, aps=[p0:(GT 1 s26), p1:(LEQ 1 s15)], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-11 finished in 723 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((p0||G(p1)))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 126/126 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 93 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 93 transition count 108
Applied a total of 20 rules in 3 ms. Remains 93 /103 variables (removed 10) and now considering 108/126 (removed 18) transitions.
// Phase 1: matrix 108 rows 93 cols
[2024-05-20 14:34:17] [INFO ] Computed 9 invariants in 2 ms
[2024-05-20 14:34:18] [INFO ] Implicit Places using invariants in 58 ms returned [24, 38, 64]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/103 places, 108/126 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 87 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 87 transition count 105
Applied a total of 6 rules in 2 ms. Remains 87 /90 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 87 cols
[2024-05-20 14:34:18] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-20 14:34:18] [INFO ] Invariant cache hit.
[2024-05-20 14:34:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:18] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/103 places, 105/126 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 87/103 places, 105/126 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT 1 s20), p0:(GT s45 s77)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-12 finished in 444 ms.
All properties solved by simple procedures.
Total runtime 5279 ms.

BK_STOP 1716215659413

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-005, 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 r087-tall-171620521300002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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