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.r021-smll-171620128200198.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 Anderson-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128200198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K 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 Anderson-PT-04-LTLFireability-00
FORMULA_NAME Anderson-PT-04-LTLFireability-01
FORMULA_NAME Anderson-PT-04-LTLFireability-02
FORMULA_NAME Anderson-PT-04-LTLFireability-03
FORMULA_NAME Anderson-PT-04-LTLFireability-04
FORMULA_NAME Anderson-PT-04-LTLFireability-05
FORMULA_NAME Anderson-PT-04-LTLFireability-06
FORMULA_NAME Anderson-PT-04-LTLFireability-07
FORMULA_NAME Anderson-PT-04-LTLFireability-08
FORMULA_NAME Anderson-PT-04-LTLFireability-09
FORMULA_NAME Anderson-PT-04-LTLFireability-10
FORMULA_NAME Anderson-PT-04-LTLFireability-11
FORMULA_NAME Anderson-PT-04-LTLFireability-12
FORMULA_NAME Anderson-PT-04-LTLFireability-13
FORMULA_NAME Anderson-PT-04-LTLFireability-14
FORMULA_NAME Anderson-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716515169826

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=Anderson-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 01:46:13] [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-24 01:46:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:46:13] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-24 01:46:13] [INFO ] Transformed 105 places.
[2024-05-24 01:46:13] [INFO ] Transformed 200 transitions.
[2024-05-24 01:46:13] [INFO ] Found NUPN structural information;
[2024-05-24 01:46:13] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Anderson-PT-04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 176
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 176
Applied a total of 24 rules in 30 ms. Remains 93 /105 variables (removed 12) and now considering 176/200 (removed 24) transitions.
// Phase 1: matrix 176 rows 93 cols
[2024-05-24 01:46:13] [INFO ] Computed 11 invariants in 22 ms
[2024-05-24 01:46:14] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-24 01:46:14] [INFO ] Invariant cache hit.
[2024-05-24 01:46:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:14] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2024-05-24 01:46:14] [INFO ] Invariant cache hit.
[2024-05-24 01:46:14] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 176/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1119 ms. Remains : 93/105 places, 176/200 transitions.
Support contains 29 out of 93 places after structural reductions.
[2024-05-24 01:46:15] [INFO ] Flatten gal took : 90 ms
[2024-05-24 01:46:15] [INFO ] Flatten gal took : 31 ms
[2024-05-24 01:46:15] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 28 out of 93 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 881 ms. (steps per millisecond=11 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 01:46:16] [INFO ] Invariant cache hit.
[2024-05-24 01:46:16] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:46:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-24 01:46:16] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 01:46:16] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:46:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:16] [INFO ] After 26ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:46:16] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-24 01:46:16] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 70 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 70 transition count 99
Applied a total of 46 rules in 54 ms. Remains 70 /93 variables (removed 23) and now considering 99/176 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 70/93 places, 99/176 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished Best-First random walk after 1745 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=290 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 70 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 70 transition count 99
Applied a total of 46 rules in 26 ms. Remains 70 /93 variables (removed 23) and now considering 99/176 (removed 77) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-24 01:46:17] [INFO ] Computed 11 invariants in 7 ms
[2024-05-24 01:46:17] [INFO ] Implicit Places using invariants in 203 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/93 places, 99/176 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 84
Applied a total of 30 rules in 11 ms. Remains 54 /69 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 54 cols
[2024-05-24 01:46:17] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 01:46:17] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-24 01:46:17] [INFO ] Invariant cache hit.
[2024-05-24 01:46:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:18] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/93 places, 84/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 550 ms. Remains : 54/93 places, 84/176 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 496 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s9 1) (NEQ s20 1)), p1:(OR (NEQ s7 1) (NEQ s16 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 0 reset in 621 ms.
Stack based approach found an accepted trace after 1553 steps with 2 reset with depth 148 and stack size 104 in 16 ms.
FORMULA Anderson-PT-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-01 finished in 1786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 164
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 70 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 70 transition count 99
Applied a total of 46 rules in 24 ms. Remains 70 /93 variables (removed 23) and now considering 99/176 (removed 77) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-24 01:46:19] [INFO ] Computed 11 invariants in 7 ms
[2024-05-24 01:46:19] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-24 01:46:19] [INFO ] Invariant cache hit.
[2024-05-24 01:46:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:19] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-24 01:46:19] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 01:46:19] [INFO ] Invariant cache hit.
[2024-05-24 01:46:19] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/93 places, 99/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 501 ms. Remains : 70/93 places, 99/176 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s56 1)), p1:(OR (EQ s7 0) (EQ s16 0))], 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 317 reset in 337 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-02 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1 U G(p2))))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 81 transition count 104
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 81 transition count 104
Applied a total of 24 rules in 12 ms. Remains 81 /93 variables (removed 12) and now considering 104/176 (removed 72) transitions.
// Phase 1: matrix 104 rows 81 cols
[2024-05-24 01:46:20] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 01:46:20] [INFO ] Implicit Places using invariants in 526 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/93 places, 104/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 549 ms. Remains : 80/93 places, 104/176 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s3 0) (EQ s56 0)) (OR (EQ s3 0) (EQ s32 0))), p2:(AND (EQ s3 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLFireability-03 finished in 1450 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)&&F(p1)))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 82 transition count 111
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 82 transition count 111
Applied a total of 22 rules in 12 ms. Remains 82 /93 variables (removed 11) and now considering 111/176 (removed 65) transitions.
// Phase 1: matrix 111 rows 82 cols
[2024-05-24 01:46:21] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 01:46:21] [INFO ] Implicit Places using invariants in 140 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 111/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 81/93 places, 111/176 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Anderson-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s15 1)), p0:(AND (OR (AND (EQ s4 1) (EQ s15 1)) (AND (EQ s5 1) (EQ s15 1))) (EQ s4 1) (EQ s15 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2521 steps with 2 reset in 3 ms.
FORMULA Anderson-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-05 finished in 339 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))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 164
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 70 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 70 transition count 99
Applied a total of 46 rules in 12 ms. Remains 70 /93 variables (removed 23) and now considering 99/176 (removed 77) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-24 01:46:22] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 01:46:22] [INFO ] Implicit Places using invariants in 88 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/93 places, 99/176 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 84
Applied a total of 30 rules in 5 ms. Remains 54 /69 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 54 cols
[2024-05-24 01:46:22] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 01:46:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 01:46:22] [INFO ] Invariant cache hit.
[2024-05-24 01:46:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:22] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/93 places, 84/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 336 ms. Remains : 54/93 places, 84/176 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27 reset in 104 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-06 finished in 507 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))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 93 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 82 transition count 165
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 34 place count 70 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 46 place count 70 transition count 93
Applied a total of 46 rules in 10 ms. Remains 70 /93 variables (removed 23) and now considering 93/176 (removed 83) transitions.
// Phase 1: matrix 93 rows 70 cols
[2024-05-24 01:46:22] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 01:46:22] [INFO ] Implicit Places using invariants in 117 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/93 places, 93/176 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 85
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 61 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 57 transition count 81
Applied a total of 24 rules in 12 ms. Remains 57 /69 variables (removed 12) and now considering 81/93 (removed 12) transitions.
// Phase 1: matrix 81 rows 57 cols
[2024-05-24 01:46:22] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 01:46:22] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-24 01:46:22] [INFO ] Invariant cache hit.
[2024-05-24 01:46:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:22] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/93 places, 81/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 448 ms. Remains : 57/93 places, 81/176 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 701 reset in 115 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-07 finished in 652 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))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 83 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 83 transition count 112
Applied a total of 20 rules in 3 ms. Remains 83 /93 variables (removed 10) and now considering 112/176 (removed 64) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-24 01:46:23] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 01:46:23] [INFO ] Implicit Places using invariants in 139 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/93 places, 112/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 82/93 places, 112/176 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-04-LTLFireability-08 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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s21 1), p0:(OR (EQ s10 0) (EQ s12 0))], 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 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-08 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X((G(!p1)||(!p1&&F(p2)))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 85 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 85 transition count 126
Applied a total of 16 rules in 5 ms. Remains 85 /93 variables (removed 8) and now considering 126/176 (removed 50) transitions.
// Phase 1: matrix 126 rows 85 cols
[2024-05-24 01:46:23] [INFO ] Computed 11 invariants in 6 ms
[2024-05-24 01:46:23] [INFO ] Implicit Places using invariants in 111 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/93 places, 126/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 84/93 places, 126/176 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) p1), (NOT p0), p1, true, (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (EQ s5 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s16 1))), p1:(AND (EQ s6 1) (EQ s14 1)), p2:(NEQ s19 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 616 reset in 247 ms.
Stack based approach found an accepted trace after 33 steps with 1 reset with depth 31 and stack size 31 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-09 finished in 744 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(X(G(p1)))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 84 transition count 125
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 84 transition count 125
Applied a total of 18 rules in 6 ms. Remains 84 /93 variables (removed 9) and now considering 125/176 (removed 51) transitions.
// Phase 1: matrix 125 rows 84 cols
[2024-05-24 01:46:24] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 01:46:24] [INFO ] Implicit Places using invariants in 130 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/93 places, 125/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 83/93 places, 125/176 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s6 0) (EQ s15 0)) (EQ s9 1) (EQ s18 1)), p1:(AND (EQ s9 1) (EQ s13 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-11 finished in 378 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 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 164
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 164
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 70 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 70 transition count 99
Applied a total of 46 rules in 44 ms. Remains 70 /93 variables (removed 23) and now considering 99/176 (removed 77) transitions.
// Phase 1: matrix 99 rows 70 cols
[2024-05-24 01:46:24] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 01:46:24] [INFO ] Implicit Places using invariants in 169 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/93 places, 99/176 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 84
Applied a total of 30 rules in 8 ms. Remains 54 /69 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 54 cols
[2024-05-24 01:46:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 01:46:24] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-24 01:46:24] [INFO ] Invariant cache hit.
[2024-05-24 01:46:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 01:46:25] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/93 places, 84/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 548 ms. Remains : 54/93 places, 84/176 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s10 1) (NEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 675 steps with 0 reset with depth 676 and stack size 322 in 3 ms.
FORMULA Anderson-PT-04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-15 finished in 797 ms.
All properties solved by simple procedures.
Total runtime 12187 ms.

BK_STOP 1716515186480

--------------------
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="Anderson-PT-04"
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 Anderson-PT-04, 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 r021-smll-171620128200198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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