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-171620521300003.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300003
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME CANConstruction-PT-005-LTLFireability-01
FORMULA_NAME CANConstruction-PT-005-LTLFireability-02
FORMULA_NAME CANConstruction-PT-005-LTLFireability-03
FORMULA_NAME CANConstruction-PT-005-LTLFireability-04
FORMULA_NAME CANConstruction-PT-005-LTLFireability-05
FORMULA_NAME CANConstruction-PT-005-LTLFireability-06
FORMULA_NAME CANConstruction-PT-005-LTLFireability-07
FORMULA_NAME CANConstruction-PT-005-LTLFireability-08
FORMULA_NAME CANConstruction-PT-005-LTLFireability-09
FORMULA_NAME CANConstruction-PT-005-LTLFireability-10
FORMULA_NAME CANConstruction-PT-005-LTLFireability-11
FORMULA_NAME CANConstruction-PT-005-LTLFireability-12
FORMULA_NAME CANConstruction-PT-005-LTLFireability-13
FORMULA_NAME CANConstruction-PT-005-LTLFireability-14
FORMULA_NAME CANConstruction-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716215651107

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 14:34:12] [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]
[2024-05-20 14:34:12] [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): 51 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 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-005-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 19 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 17 ms
[2024-05-20 14:34:13] [INFO ] Implicit Places using invariants in 186 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/112 places, 126/140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 125
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 103 cols
[2024-05-20 14:34:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 14:34:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-20 14:34:13] [INFO ] Invariant cache hit.
[2024-05-20 14:34:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:13] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/112 places, 125/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 103/112 places, 125/140 transitions.
Support contains 35 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 : 21 ms
[2024-05-20 14:34:13] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 14:34:13] [INFO ] Invariant cache hit.
[2024-05-20 14:34:14] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-05-20 14:34:14] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-20 14:34:14] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-005-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 24 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 95 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 95 transition count 109
Applied a total of 16 rules in 7 ms. Remains 95 /103 variables (removed 8) and now considering 109/125 (removed 16) transitions.
// Phase 1: matrix 109 rows 95 cols
[2024-05-20 14:34:14] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 14:34:14] [INFO ] Implicit Places using invariants in 62 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 109/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 87 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 87 transition count 105
Applied a total of 8 rules in 5 ms. Remains 87 /91 variables (removed 4) and now considering 105/109 (removed 4) transitions.
// Phase 1: matrix 105 rows 87 cols
[2024-05-20 14:34:14] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 14:34:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 14:34:14] [INFO ] Invariant cache hit.
[2024-05-20 14:34:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:14] [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 LTL mode, iteration 2 : 87/103 places, 105/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 87/103 places, 105/125 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 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s16 1) (OR (LT s6 1) (LT s79 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-00 finished in 837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 103 transition count 96
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 74 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 73 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 73 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 72 transition count 94
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 70 place count 64 transition count 78
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 64 transition count 78
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 79 place count 64 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 63 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 88 place count 59 transition count 73
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 98 place count 54 transition count 83
Applied a total of 98 rules in 29 ms. Remains 54 /103 variables (removed 49) and now considering 83/125 (removed 42) transitions.
// Phase 1: matrix 83 rows 54 cols
[2024-05-20 14:34:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants in 52 ms returned [6, 13, 24, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/103 places, 83/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 79
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 42 transition count 75
Applied a total of 16 rules in 7 ms. Remains 42 /50 variables (removed 8) and now considering 75/83 (removed 8) transitions.
// Phase 1: matrix 75 rows 42 cols
[2024-05-20 14:34:15] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-20 14:34:15] [INFO ] Invariant cache hit.
[2024-05-20 14:34:15] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/103 places, 75/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 42/103 places, 75/125 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s18 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 28 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-01 finished in 260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((G(p2)||X((p3 U p4))||p1))))'
Support contains 10 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 95 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 95 transition count 109
Applied a total of 16 rules in 7 ms. Remains 95 /103 variables (removed 8) and now considering 109/125 (removed 16) transitions.
// Phase 1: matrix 109 rows 95 cols
[2024-05-20 14:34:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants in 47 ms returned [12, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 109/125 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 107
Applied a total of 4 rules in 3 ms. Remains 91 /93 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 91 cols
[2024-05-20 14:34:15] [INFO ] Computed 8 invariants in 1 ms
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-20 14:34:15] [INFO ] Invariant cache hit.
[2024-05-20 14:34:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 91/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p4)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p4) p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p4) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p4) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s50 1) (GEQ s52 1)), p4:(AND (GEQ s32 1) (GEQ s63 1)), p3:(AND (GEQ s37 1) (GEQ s58 1)), p1:(OR (LT s24 1) (LT s26 1)), p2:(AND (GEQ s1 1) (G...], 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 18 stabilizing places and 22 stable transitions
Computed a total of 18 stabilizing places and 22 stable transitions
Detected a total of 18/91 stabilizing places and 22/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p4) (NOT p3) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X (AND (NOT p0) (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 6 states, 12 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-02 finished in 786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1)||(p2 U (p3||G(p2))))))'
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 103 transition count 100
Reduce places removed 25 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 31 rules applied. Total rules applied 56 place count 78 transition count 94
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 72 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 72 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 69 transition count 91
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 75 place count 62 transition count 77
Iterating global reduction 3 with 7 rules applied. Total rules applied 82 place count 62 transition count 77
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 83 place count 62 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 61 transition count 76
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 90 place count 58 transition count 73
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 98 place count 54 transition count 80
Applied a total of 98 rules in 17 ms. Remains 54 /103 variables (removed 49) and now considering 80/125 (removed 45) transitions.
// Phase 1: matrix 80 rows 54 cols
[2024-05-20 14:34:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 47 ms returned [13, 22, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/103 places, 80/125 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 45 transition count 74
Applied a total of 12 rules in 4 ms. Remains 45 /51 variables (removed 6) and now considering 74/80 (removed 6) transitions.
// Phase 1: matrix 74 rows 45 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 37 ms returned []
[2024-05-20 14:34:16] [INFO ] Invariant cache hit.
[2024-05-20 14:34:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/103 places, 74/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 45/103 places, 74/125 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p3) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s36 1), p1:(OR (LT s7 1) (LT s8 1)), p3:(AND (NOT (AND (GEQ s1 1) (GEQ s19 1))) (GEQ s4 1) (GEQ s22 1)), p2:(AND (GEQ s4 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3472 reset in 165 ms.
Stack based approach found an accepted trace after 2854 steps with 103 reset with depth 34 and stack size 31 in 7 ms.
FORMULA CANConstruction-PT-005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-03 finished in 493 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' '!((p0 U X(X(G(p1)))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 111
Applied a total of 14 rules in 2 ms. Remains 96 /103 variables (removed 7) and now considering 111/125 (removed 14) transitions.
// Phase 1: matrix 111 rows 96 cols
[2024-05-20 14:34:16] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 54 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 111/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 107
Applied a total of 8 rules in 2 ms. Remains 88 /92 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-20 14:34:16] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:16] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-20 14:34:16] [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 170 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 325 ms. Remains : 88/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(LT s71 1), p0:(OR (GEQ s55 1) (GEQ s19 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 454 steps with 5 reset in 2 ms.
FORMULA CANConstruction-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-05 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 113
Applied a total of 12 rules in 6 ms. Remains 97 /103 variables (removed 6) and now considering 113/125 (removed 12) transitions.
// Phase 1: matrix 113 rows 97 cols
[2024-05-20 14:34:17] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants in 50 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 113/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 109
Applied a total of 8 rules in 2 ms. Remains 89 /93 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 89 cols
[2024-05-20 14:34:17] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:17] [INFO ] Implicit Places using invariants in 71 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 186 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/103 places, 109/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 89/103 places, 109/125 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s84 1), p1:(LT s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 84 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 132 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-20 14:34:18] [INFO ] Invariant cache hit.
[2024-05-20 14:34:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-20 14:34:19] [INFO ] Invariant cache hit.
[2024-05-20 14:34:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:19] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-20 14:34:19] [INFO ] Invariant cache hit.
[2024-05-20 14:34:19] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 89/89 places, 109/109 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 103 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 89 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 20 place count 89 transition count 109
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 89 transition count 109
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 78 transition count 97
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 78 transition count 97
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 78 transition count 97
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 53 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 53 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 53 transition count 91
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 122 rules in 18 ms. Remains 53 /89 variables (removed 36) and now considering 91/109 (removed 18) transitions.
[2024-05-20 14:34:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 91 rows 53 cols
[2024-05-20 14:34:20] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:20] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/89 places, 91/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 53/89 places, 91/109 transitions.
Built C files in :
/tmp/ltsmin10792467187523343739
[2024-05-20 14:34:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10792467187523343739
Running compilation step : cd /tmp/ltsmin10792467187523343739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 274 ms.
Running link step : cd /tmp/ltsmin10792467187523343739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10792467187523343739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18402661121927541313.hoa' '--buchi-type=spotba'
LTSmin run took 171 ms.
FORMULA CANConstruction-PT-005-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLFireability-07 finished in 4251 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(F(p0))))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 111
Applied a total of 14 rules in 5 ms. Remains 96 /103 variables (removed 7) and now considering 111/125 (removed 14) transitions.
// Phase 1: matrix 111 rows 96 cols
[2024-05-20 14:34:21] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 14:34:21] [INFO ] Implicit Places using invariants in 64 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 111/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 107
Applied a total of 8 rules in 3 ms. Remains 88 /92 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-20 14:34:21] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-20 14:34:21] [INFO ] Invariant cache hit.
[2024-05-20 14:34:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 88/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-10 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:(GEQ s81 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]]
Stuttering criterion allowed to conclude after 107 steps with 2 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-10 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' '!(F(G((X(X(F(p0)))||(!p1 U p2)))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 103 transition count 95
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 73 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 72 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 72 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 69 transition count 91
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 76 place count 61 transition count 75
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 61 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 85 place count 61 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 60 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 92 place count 57 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
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 100 place count 53 transition count 79
Applied a total of 100 rules in 17 ms. Remains 53 /103 variables (removed 50) and now considering 79/125 (removed 46) transitions.
// Phase 1: matrix 79 rows 53 cols
[2024-05-20 14:34:21] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 14:34:21] [INFO ] Implicit Places using invariants in 44 ms returned [5, 12, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/103 places, 79/125 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 78
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 44 transition count 73
Applied a total of 12 rules in 7 ms. Remains 44 /50 variables (removed 6) and now considering 73/79 (removed 6) transitions.
// Phase 1: matrix 73 rows 44 cols
[2024-05-20 14:34:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 14:34:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-20 14:34:21] [INFO ] Invariant cache hit.
[2024-05-20 14:34:21] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-20 14:34:21] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/103 places, 73/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 44/103 places, 73/125 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s15 1)), p2:(AND (GEQ s7 1) (GEQ s19 1)), p1:(AND (GEQ s20 1) (GEQ s21 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 4006 reset in 127 ms.
Stack based approach found an accepted trace after 3394 steps with 133 reset with depth 20 and stack size 20 in 5 ms.
FORMULA CANConstruction-PT-005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-11 finished in 446 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(G(p0))))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 111
Applied a total of 14 rules in 2 ms. Remains 96 /103 variables (removed 7) and now considering 111/125 (removed 14) transitions.
// Phase 1: matrix 111 rows 96 cols
[2024-05-20 14:34:22] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 14:34:22] [INFO ] Implicit Places using invariants in 68 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 69 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 111/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 107
Applied a total of 8 rules in 1 ms. Remains 88 /92 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-20 14:34:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-20 14:34:22] [INFO ] Invariant cache hit.
[2024-05-20 14:34:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 88/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-12 finished in 352 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((G(F(p0)) U p1))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 113
Applied a total of 12 rules in 3 ms. Remains 97 /103 variables (removed 6) and now considering 113/125 (removed 12) transitions.
// Phase 1: matrix 113 rows 97 cols
[2024-05-20 14:34:22] [INFO ] Computed 10 invariants in 3 ms
[2024-05-20 14:34:22] [INFO ] Implicit Places using invariants in 61 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 113/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 109
Applied a total of 8 rules in 2 ms. Remains 89 /93 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 89 cols
[2024-05-20 14:34:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 14:34:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 14:34:22] [INFO ] Invariant cache hit.
[2024-05-20 14:34:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 14:34:22] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/103 places, 109/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 89/103 places, 109/125 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s80 1), p0:(AND (LT s56 1) (GEQ s87 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 67 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-13 finished in 390 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((X(G((p0||F(p1))))&&(!p2||X(p2)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 103 transition count 94
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 72 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 71 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 71 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 70 transition count 92
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 73 place count 63 transition count 78
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 63 transition count 78
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 81 place count 63 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 62 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 90 place count 58 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
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 100 place count 53 transition count 82
Applied a total of 100 rules in 20 ms. Remains 53 /103 variables (removed 50) and now considering 82/125 (removed 43) transitions.
// Phase 1: matrix 82 rows 53 cols
[2024-05-20 14:34:23] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 14:34:23] [INFO ] Implicit Places using invariants in 42 ms returned [5, 11, 23, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/103 places, 82/125 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 41 transition count 74
Applied a total of 16 rules in 3 ms. Remains 41 /49 variables (removed 8) and now considering 74/82 (removed 8) transitions.
// Phase 1: matrix 74 rows 41 cols
[2024-05-20 14:34:23] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 14:34:23] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 14:34:23] [INFO ] Invariant cache hit.
[2024-05-20 14:34:23] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-20 14:34:23] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/103 places, 74/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 41/103 places, 74/125 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s21 1)), p1:(GEQ s14 1), p2:(GEQ s34 1)], 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 16 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-15 finished in 367 ms.
All properties solved by simple procedures.
Total runtime 10427 ms.

BK_STOP 1716215664551

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-005"
export BK_EXAMINATION="LTLFireability"
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 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 r087-tall-171620521300003"
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 [ "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 ;