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.r351-tall-171679102400458.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 SharedMemory-COL-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102400458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Apr 12 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 12 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 13 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 16K May 18 16:43 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 SharedMemory-COL-000100-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716900821943

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=SharedMemory-COL-000100
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 12:53:43] [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-28 12:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:53:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 12:53:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 12:53:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 633 ms
[2024-05-28 12:53:44] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 10401 PT places and 30200.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 12:53:44] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 6 ms.
[2024-05-28 12:53:44] [INFO ] Skeletonized 14 HLPN properties in 1 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA SharedMemory-COL-000100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
FORMULA SharedMemory-COL-000100-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2024-05-28 12:53:44] [INFO ] Computed 3 invariants in 5 ms
[2024-05-28 12:53:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 12:53:44] [INFO ] After 98ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
[2024-05-28 12:53:44] [INFO ] Flatten gal took : 11 ms
[2024-05-28 12:53:44] [INFO ] Flatten gal took : 1 ms
Domain [P(100), P(100)] of place Ext_Mem_Acc breaks symmetries in sort P
[2024-05-28 12:53:44] [INFO ] Unfolded HLPN to a Petri net with 10401 places and 20200 transitions 80400 arcs in 161 ms.
[2024-05-28 12:53:44] [INFO ] Unfolded 14 HLPN properties in 20 ms.
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 26 ms
Reduce places removed 100 places and 100 transitions.
FORMULA SharedMemory-COL-000100-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 58 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2024-05-28 12:53:49] [INFO ] Computed 201 invariants in 3042 ms
[2024-05-28 12:53:50] [INFO ] Implicit Places using invariants in 4020 ms returned []
Implicit Place search using SMT only with invariants took 4023 ms to find 0 implicit places.
[2024-05-28 12:53:50] [INFO ] Invariant cache hit.
[2024-05-28 12:53:51] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5002 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Support contains 10301 out of 10301 places after structural reductions.
[2024-05-28 12:53:54] [INFO ] Flatten gal took : 1348 ms
[2024-05-28 12:53:59] [INFO ] Flatten gal took : 1281 ms
[2024-05-28 12:54:05] [INFO ] Input system was already deterministic with 20100 transitions.
Interrupted random walk after 4893 steps, including 1 resets, run timeout after 30014 ms. (steps per millisecond=0 ) properties seen 9
Interrupted Best-First random walk after 2818 steps, including 0 resets, run timeout after 5196 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
[2024-05-28 12:54:41] [INFO ] Invariant cache hit.
[2024-05-28 12:54:43] [INFO ] [Real]Absence check using 201 positive place invariants in 355 ms returned sat
[2024-05-28 12:54:52] [INFO ] After 11009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Free-agglomeration rule applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 10301 transition count 20000
Reduce places removed 100 places and 0 transitions.
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 300 place count 10201 transition count 19900
Applied a total of 300 rules in 6444 ms. Remains 10201 /10301 variables (removed 100) and now considering 19900/20100 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6449 ms. Remains : 10201/10301 places, 19900/20100 transitions.
Interrupted random walk after 2763 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1819 steps, including 0 resets, run timeout after 5115 ms. (steps per millisecond=0 ) properties seen 0
Interrupted probabilistic random walk after 193482 steps, run timeout after 105098 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 193482 steps, saw 185364 distinct states, run finished after 105102 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 19900 rows 10201 cols
[2024-05-28 12:57:22] [INFO ] Computed 201 invariants in 2832 ms
[2024-05-28 12:57:47] [INFO ] [Real]Absence check using 201 positive place invariants in 312 ms returned sat
[2024-05-28 12:57:56] [INFO ] After 10826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10101 out of 10201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10201/10201 places, 19900/19900 transitions.
Applied a total of 0 rules in 5622 ms. Remains 10201 /10201 variables (removed 0) and now considering 19900/19900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5622 ms. Remains : 10201/10201 places, 19900/19900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10201/10201 places, 19900/19900 transitions.
Applied a total of 0 rules in 5250 ms. Remains 10201 /10201 variables (removed 0) and now considering 19900/19900 (removed 0) transitions.
[2024-05-28 12:58:07] [INFO ] Invariant cache hit.
[2024-05-28 12:58:08] [INFO ] Implicit Places using invariants in 849 ms returned []
Implicit Place search using SMT only with invariants took 853 ms to find 0 implicit places.
[2024-05-28 12:58:08] [INFO ] Invariant cache hit.
[2024-05-28 12:58:09] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6975 ms. Remains : 10201/10201 places, 19900/19900 transitions.
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(p0)||(G(p1)&&X(p2))))'
Support contains 10100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 54 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
// Phase 1: matrix 20100 rows 10301 cols
[2024-05-28 12:58:13] [INFO ] Computed 201 invariants in 2672 ms
[2024-05-28 12:58:14] [INFO ] Implicit Places using invariants in 3549 ms returned []
Implicit Place search using SMT only with invariants took 3553 ms to find 0 implicit places.
[2024-05-28 12:58:14] [INFO ] Invariant cache hit.
[2024-05-28 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4479 ms. Remains : 10301/10301 places, 20100/20100 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 388 ms :[true, (NOT p1), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(AND (OR (LT s20 1) (LT s220 1)) (OR (LT s25 1) (LT s225 1)) (OR (LT s94 1) (LT s294 1)) (OR (LT s99 1) (LT s299 1)) (OR (LT s89 1) (LT s289 1)) (OR (L...], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-02 finished in 4991 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(G(!p0))))'
Support contains 100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 331 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:58:15] [INFO ] Invariant cache hit.
[2024-05-28 12:58:16] [INFO ] Implicit Places using invariants in 876 ms returned []
Implicit Place search using SMT only with invariants took 882 ms to find 0 implicit places.
[2024-05-28 12:58:16] [INFO ] Invariant cache hit.
[2024-05-28 12:58:21] [INFO ] Dead Transitions using invariants and state equation in 5070 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6562 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 428 ms :[p0, true, p0]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (GEQ s391 1) (GEQ s326 1) (GEQ s387 1) (GEQ s322 1) (GEQ s399 1) (GEQ s334 1) (GEQ s395 1) (GEQ s330 1) (GEQ s342 1) (GEQ s338 1) (GEQ s350 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 315 steps with 0 reset in 147 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-03 finished in 7351 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((G(!p1)||p0)))))'
Support contains 300 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 3448 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:58:26] [INFO ] Invariant cache hit.
[2024-05-28 12:58:27] [INFO ] Implicit Places using invariants in 885 ms returned []
Implicit Place search using SMT only with invariants took 892 ms to find 0 implicit places.
[2024-05-28 12:58:27] [INFO ] Invariant cache hit.
[2024-05-28 12:58:28] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5234 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (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=[p1:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s94 1) (GEQ s294 1)) (AND (GEQ s99 1) (GEQ s299 1)) (AND (GEQ s89 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 85390 steps with 28463 reset in 10190 ms.
Product exploration explored 100000 steps with 33333 reset in 7267 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 (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000100-LTLFireability-04 finished in 23491 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 p1)||G(F(p2))))'
Support contains 10101 out of 10301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 170 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:58:46] [INFO ] Invariant cache hit.
[2024-05-28 12:58:47] [INFO ] Implicit Places using invariants in 934 ms returned []
Implicit Place search using SMT only with invariants took 952 ms to find 0 implicit places.
[2024-05-28 12:58:47] [INFO ] Invariant cache hit.
[2024-05-28 12:58:48] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2035 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s176 1) (GEQ s208 1) (GEQ s10300 1)) (AND (GEQ s175 1) (GEQ s211 1) (GEQ s10300 1)) (AND (GEQ s173 1) (GEQ s217 1) (GEQ s10300 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 5360 steps with 1793 reset in 10008 ms.
Stack based approach found an accepted trace after 993 steps with 329 reset with depth 3 and stack size 3 in 1879 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-06 finished in 14378 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&&F((X(p1)&&(p2 U p1))))))))'
Support contains 401 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 3132 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:59:03] [INFO ] Invariant cache hit.
[2024-05-28 12:59:04] [INFO ] Implicit Places using invariants in 851 ms returned []
Implicit Place search using SMT only with invariants took 855 ms to find 0 implicit places.
[2024-05-28 12:59:04] [INFO ] Invariant cache hit.
[2024-05-28 12:59:05] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4881 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR p1 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s391 1) (GEQ s326 1) (GEQ s387 1) (GEQ s322 1) (GEQ s399 1) (GEQ s334 1) (GEQ s395 1) (GEQ s330 1) (GEQ s342 1) (GEQ s338 1) (GEQ s350 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 6180 steps with 95 reset in 10018 ms.
Stack based approach found an accepted trace after 181 steps with 5 reset with depth 118 and stack size 118 in 240 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-07 finished in 15524 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 100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 49 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:59:16] [INFO ] Invariant cache hit.
[2024-05-28 12:59:17] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 889 ms to find 0 implicit places.
[2024-05-28 12:59:17] [INFO ] Invariant cache hit.
[2024-05-28 12:59:18] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1809 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s391 1) (GEQ s326 1) (GEQ s387 1) (GEQ s322 1) (GEQ s399 1) (GEQ s334 1) (GEQ s395 1) (GEQ s330 1) (GEQ s342 1) (GEQ s338 1) (GEQ s350 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5936 ms.
Product exploration explored 100000 steps with 33333 reset in 5748 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000100-LTLFireability-09 finished in 13876 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 201 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 30 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:59:30] [INFO ] Invariant cache hit.
[2024-05-28 12:59:31] [INFO ] Implicit Places using invariants in 911 ms returned []
Implicit Place search using SMT only with invariants took 912 ms to find 0 implicit places.
[2024-05-28 12:59:31] [INFO ] Invariant cache hit.
[2024-05-28 12:59:32] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1845 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, p0, p0]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s176 1) (GEQ s208 1) (GEQ s10300 1)) (AND (GEQ s175 1) (GEQ s211 1) (GEQ s10300 1)) (AND (GEQ s173 1) (GEQ s217 1) (GEQ s10300 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 62920 steps with 14491 reset in 10001 ms.
Stack based approach found an accepted trace after 295 steps with 63 reset with depth 4 and stack size 4 in 45 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-10 finished in 12152 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(p1))||p0)))'
Support contains 201 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 30 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:59:42] [INFO ] Invariant cache hit.
[2024-05-28 12:59:43] [INFO ] Implicit Places using invariants in 902 ms returned []
Implicit Place search using SMT only with invariants took 914 ms to find 0 implicit places.
[2024-05-28 12:59:43] [INFO ] Invariant cache hit.
[2024-05-28 12:59:44] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1832 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s176 1) (GEQ s208 1) (GEQ s10300 1)) (AND (GEQ s175 1) (GEQ s211 1) (GEQ s10300 1)) (AND (GEQ s173 1) (GEQ s217 1) (GEQ s10300 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-11 finished in 2102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 100 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 42 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:59:44] [INFO ] Invariant cache hit.
[2024-05-28 12:59:45] [INFO ] Implicit Places using invariants in 875 ms returned []
Implicit Place search using SMT only with invariants took 888 ms to find 0 implicit places.
[2024-05-28 12:59:45] [INFO ] Invariant cache hit.
[2024-05-28 12:59:46] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1806 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s391 1) (GEQ s326 1) (GEQ s387 1) (GEQ s322 1) (GEQ s399 1) (GEQ s334 1) (GEQ s395 1) (GEQ s330 1) (GEQ s342 1) (GEQ s338 1) (GEQ s350 1) (GEQ...], 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 timeout after 21670 steps with 64 reset in 10018 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 2 ms.
FORMULA SharedMemory-COL-000100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000100-LTLFireability-12 finished in 11978 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((G((p1 U p2))||p0))))'
Support contains 10200 out of 10301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 40 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2024-05-28 12:59:56] [INFO ] Invariant cache hit.
[2024-05-28 12:59:57] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 911 ms to find 0 implicit places.
[2024-05-28 12:59:57] [INFO ] Invariant cache hit.
[2024-05-28 12:59:58] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1862 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (GEQ s391 1) (GEQ s326 1) (GEQ s387 1) (GEQ s322 1) (GEQ s399 1) (GEQ s334 1) (GEQ s395 1) (GEQ s330 1) (GEQ s342 1) (GEQ s338 1) (GEQ s350 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7016 ms.
Product exploration explored 100000 steps with 50000 reset in 6973 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) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000100-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000100-LTLFireability-13 finished in 16401 ms.
All properties solved by simple procedures.
Total runtime 389266 ms.

BK_STOP 1716901213900

--------------------
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="SharedMemory-COL-000100"
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 SharedMemory-COL-000100, 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 r351-tall-171679102400458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000100.tgz
mv SharedMemory-COL-000100 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 ;