Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r361-smll-167891811800572.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SharedMemory-COL-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811800572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:23 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-000050-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679379018056

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 06:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 06:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:10:21] [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.
[2023-03-21 06:10:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 06:10:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2023-03-21 06:10:21] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 2701 PT places and 7600.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-21 06:10:22] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 6 ms.
[2023-03-21 06:10:22] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 154 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=15 )
[2023-03-21 06:10:22] [INFO ] Flatten gal took : 19 ms
[2023-03-21 06:10:22] [INFO ] Flatten gal took : 3 ms
Domain [P(50), P(50)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-21 06:10:22] [INFO ] Unfolded HLPN to a Petri net with 2701 places and 5100 transitions 20200 arcs in 152 ms.
[2023-03-21 06:10:22] [INFO ] Unfolded 16 HLPN properties in 21 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 50 places in 11 ms
Reduce places removed 50 places and 50 transitions.
FORMULA SharedMemory-COL-000050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000050-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2651 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 54 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
// Phase 1: matrix 5050 rows 2651 cols
[2023-03-21 06:10:23] [INFO ] Computed 101 place invariants in 371 ms
[2023-03-21 06:10:24] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-21 06:10:24] [INFO ] Invariant cache hit.
[2023-03-21 06:10:25] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
[2023-03-21 06:10:25] [INFO ] Invariant cache hit.
[2023-03-21 06:10:30] [INFO ] Dead Transitions using invariants and state equation in 4572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7142 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 2651 out of 2651 places after structural reductions.
[2023-03-21 06:10:31] [INFO ] Flatten gal took : 551 ms
[2023-03-21 06:10:32] [INFO ] Flatten gal took : 435 ms
[2023-03-21 06:10:34] [INFO ] Input system was already deterministic with 5050 transitions.
Finished random walk after 249 steps, including 0 resets, run visited all 6 properties in 51 ms. (steps per millisecond=4 )
FORMULA SharedMemory-COL-000050-LTLFireability-00 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p1&&F(p2)))||p0)))'
Support contains 201 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 1074 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:10:36] [INFO ] Invariant cache hit.
[2023-03-21 06:10:36] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-21 06:10:36] [INFO ] Invariant cache hit.
[2023-03-21 06:10:37] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2023-03-21 06:10:38] [INFO ] Redundant transitions in 617 ms returned []
[2023-03-21 06:10:38] [INFO ] Invariant cache hit.
[2023-03-21 06:10:43] [INFO ] Dead Transitions using invariants and state equation in 5189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8494 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 64200 steps with 21218 reset in 10003 ms.
Stack based approach found an accepted trace after 304 steps with 102 reset with depth 2 and stack size 2 in 48 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-01 finished in 18949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U !p1)&&F((p2&&G(F(p0)))))))'
Support contains 2600 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 592 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:10:54] [INFO ] Invariant cache hit.
[2023-03-21 06:10:55] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-21 06:10:55] [INFO ] Invariant cache hit.
[2023-03-21 06:10:56] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2023-03-21 06:10:56] [INFO ] Redundant transitions in 325 ms returned []
[2023-03-21 06:10:56] [INFO ] Invariant cache hit.
[2023-03-21 06:11:01] [INFO ] Dead Transitions using invariants and state equation in 4045 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7056 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), (NOT p0), (OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s151 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1163 reset in 8857 ms.
Stack based approach found an accepted trace after 5249 steps with 46 reset with depth 5 and stack size 5 in 446 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-02 finished in 16694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 100 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 996 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:11:11] [INFO ] Invariant cache hit.
[2023-03-21 06:11:12] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-21 06:11:12] [INFO ] Invariant cache hit.
[2023-03-21 06:11:13] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-21 06:11:14] [INFO ] Redundant transitions in 523 ms returned []
[2023-03-21 06:11:14] [INFO ] Invariant cache hit.
[2023-03-21 06:11:20] [INFO ] Dead Transitions using invariants and state equation in 5944 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9552 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 88550 steps with 1382 reset in 10001 ms.
Product exploration timeout after 87600 steps with 1308 reset in 10001 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-21 06:11:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 100 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 904 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:11:57] [INFO ] Invariant cache hit.
[2023-03-21 06:11:57] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-21 06:11:57] [INFO ] Invariant cache hit.
[2023-03-21 06:11:59] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2023-03-21 06:11:59] [INFO ] Redundant transitions in 525 ms returned []
[2023-03-21 06:11:59] [INFO ] Invariant cache hit.
[2023-03-21 06:12:04] [INFO ] Dead Transitions using invariants and state equation in 4133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7696 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-21 06:12:04] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 89450 steps with 1340 reset in 10001 ms.
Stack based approach found an accepted trace after 2140 steps with 47 reset with depth 188 and stack size 184 in 266 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-03 finished in 79700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 1294 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:12:31] [INFO ] Invariant cache hit.
[2023-03-21 06:12:32] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-21 06:12:32] [INFO ] Invariant cache hit.
[2023-03-21 06:12:34] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
[2023-03-21 06:12:34] [INFO ] Redundant transitions in 524 ms returned []
[2023-03-21 06:12:34] [INFO ] Invariant cache hit.
[2023-03-21 06:12:40] [INFO ] Dead Transitions using invariants and state equation in 5412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9764 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s151 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 20980 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 2 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-04 finished in 19826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(!p0))))'
Support contains 2450 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 18 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:12:50] [INFO ] Invariant cache hit.
[2023-03-21 06:12:51] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-21 06:12:51] [INFO ] Invariant cache hit.
[2023-03-21 06:12:52] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
[2023-03-21 06:12:52] [INFO ] Invariant cache hit.
[2023-03-21 06:12:58] [INFO ] Dead Transitions using invariants and state equation in 5321 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8070 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s1088 1) (GEQ s1343 1) (GEQ s1598 1) (GEQ s1852 1) (GEQ s833 1) (GEQ s323 1) (GEQ s578 1) (GEQ s2362 1) (GEQ s2617 1) (GEQ s1008 1) (GEQ s2028...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-07 finished in 8308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||X(!p1)))))'
Support contains 2500 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 28 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:12:58] [INFO ] Invariant cache hit.
[2023-03-21 06:12:59] [INFO ] Implicit Places using invariants in 948 ms returned []
[2023-03-21 06:12:59] [INFO ] Invariant cache hit.
[2023-03-21 06:13:01] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
[2023-03-21 06:13:01] [INFO ] Invariant cache hit.
[2023-03-21 06:13:05] [INFO ] Dead Transitions using invariants and state equation in 3973 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6591 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s1088 1) (GEQ s1343 1) (GEQ s1598 1) (GEQ s1852 1) (GEQ s833 1) (GEQ s323 1) (GEQ s578 1) (GEQ s2362 1) (GEQ s2617 1) (GEQ s1008 1) (GEQ s2028...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-08 finished in 6755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 258 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:13:05] [INFO ] Invariant cache hit.
[2023-03-21 06:13:06] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-21 06:13:06] [INFO ] Invariant cache hit.
[2023-03-21 06:13:07] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-21 06:13:07] [INFO ] Invariant cache hit.
[2023-03-21 06:13:13] [INFO ] Dead Transitions using invariants and state equation in 5555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7887 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], 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 30238 reset in 2757 ms.
Product exploration explored 100000 steps with 30159 reset in 2798 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 (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 243 steps, including 0 resets, run visited all 3 properties in 37 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 354 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 203 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:13:20] [INFO ] Invariant cache hit.
[2023-03-21 06:13:20] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-21 06:13:20] [INFO ] Invariant cache hit.
[2023-03-21 06:13:22] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2023-03-21 06:13:22] [INFO ] Invariant cache hit.
[2023-03-21 06:13:26] [INFO ] Dead Transitions using invariants and state equation in 3977 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6238 ms. Remains : 2651/2651 places, 5050/5050 transitions.
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 (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 272 steps, including 0 resets, run visited all 3 properties in 53 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 30315 reset in 2765 ms.
Product exploration explored 100000 steps with 30384 reset in 2820 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 1078 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:13:34] [INFO ] Redundant transitions in 523 ms returned []
[2023-03-21 06:13:34] [INFO ] Invariant cache hit.
[2023-03-21 06:13:40] [INFO ] Dead Transitions using invariants and state equation in 5502 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7115 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 317 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:13:40] [INFO ] Invariant cache hit.
[2023-03-21 06:13:41] [INFO ] Implicit Places using invariants in 671 ms returned []
[2023-03-21 06:13:41] [INFO ] Invariant cache hit.
[2023-03-21 06:13:42] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2023-03-21 06:13:42] [INFO ] Invariant cache hit.
[2023-03-21 06:13:47] [INFO ] Dead Transitions using invariants and state equation in 5051 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7503 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Treatment of property SharedMemory-COL-000050-LTLFireability-09 finished in 43586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))||p0))))'
Support contains 151 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 195 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:13:49] [INFO ] Invariant cache hit.
[2023-03-21 06:13:49] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-21 06:13:49] [INFO ] Invariant cache hit.
[2023-03-21 06:13:50] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2023-03-21 06:13:50] [INFO ] Invariant cache hit.
[2023-03-21 06:13:55] [INFO ] Dead Transitions using invariants and state equation in 5277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7057 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 8230 steps with 0 reset in 10008 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 26 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-10 finished in 17285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2450 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 646 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:14:06] [INFO ] Invariant cache hit.
[2023-03-21 06:14:07] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-21 06:14:07] [INFO ] Invariant cache hit.
[2023-03-21 06:14:09] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2023-03-21 06:14:09] [INFO ] Redundant transitions in 523 ms returned []
[2023-03-21 06:14:09] [INFO ] Invariant cache hit.
[2023-03-21 06:14:15] [INFO ] Dead Transitions using invariants and state equation in 5291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8971 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1088 1) (GEQ s1343 1) (GEQ s1598 1) (GEQ s1852 1) (GEQ s833 1) (GEQ s323 1) (GEQ s578 1) (GEQ s2362 1) (GEQ s2617 1) (GEQ s1008 1) (GEQ s2028...], 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 timeout after 91320 steps with 16885 reset in 10001 ms.
Stack based approach found an accepted trace after 168 steps with 26 reset with depth 7 and stack size 7 in 19 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-12 finished in 19059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 893 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:14:26] [INFO ] Invariant cache hit.
[2023-03-21 06:14:26] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-21 06:14:26] [INFO ] Invariant cache hit.
[2023-03-21 06:14:28] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2499 ms to find 0 implicit places.
[2023-03-21 06:14:29] [INFO ] Redundant transitions in 520 ms returned []
[2023-03-21 06:14:29] [INFO ] Invariant cache hit.
[2023-03-21 06:14:34] [INFO ] Dead Transitions using invariants and state equation in 5762 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9685 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-13 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 (GEQ s194 1) (GEQ s192 1) (GEQ s198 1) (GEQ s196 1) (GEQ s151 1) (GEQ s155 1) (GEQ s153 1) (GEQ s159 1) (GEQ s157 1) (GEQ s163 1) (GEQ s161 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 20610 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 230 steps with 0 reset with depth 231 and stack size 219 in 23 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-13 finished in 19780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 101 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 725 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:14:45] [INFO ] Invariant cache hit.
[2023-03-21 06:14:46] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-21 06:14:46] [INFO ] Invariant cache hit.
[2023-03-21 06:14:47] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
[2023-03-21 06:14:47] [INFO ] Redundant transitions in 441 ms returned []
[2023-03-21 06:14:47] [INFO ] Invariant cache hit.
[2023-03-21 06:14:53] [INFO ] Dead Transitions using invariants and state equation in 5874 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8777 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s79 1) (GEQ s148 1) (GEQ s2650 1)) (AND (GEQ s80 1) (GEQ s145 1) (GEQ s2650 1)) (AND (GEQ s50 1) (GEQ s104 1) (GEQ s2650 1)) (AND (GEQ s8...], 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 timeout after 94310 steps with 31229 reset in 10001 ms.
Stack based approach found an accepted trace after 55 steps with 20 reset with depth 2 and stack size 2 in 6 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-14 finished in 18885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1 U p0) U X(!p2))))'
Support contains 201 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 192 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:15:04] [INFO ] Invariant cache hit.
[2023-03-21 06:15:04] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-21 06:15:04] [INFO ] Invariant cache hit.
[2023-03-21 06:15:05] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2023-03-21 06:15:05] [INFO ] Invariant cache hit.
[2023-03-21 06:15:10] [INFO ] Dead Transitions using invariants and state equation in 5104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6811 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) p2), p2, (NOT p0), (AND (NOT p0) p2), p2, true, (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 4 reset in 8 ms.
FORMULA SharedMemory-COL-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000050-LTLFireability-15 finished in 7122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : SharedMemory-COL-000050-LTLFireability-09
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 229 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:15:11] [INFO ] Invariant cache hit.
[2023-03-21 06:15:12] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-21 06:15:12] [INFO ] Invariant cache hit.
[2023-03-21 06:15:13] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-21 06:15:13] [INFO ] Invariant cache hit.
[2023-03-21 06:15:18] [INFO ] Dead Transitions using invariants and state equation in 5431 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7736 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Running random walk in product with property : SharedMemory-COL-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s27 1) (GEQ s127 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s37 1) (GEQ s137 1)) (AND (GEQ s39 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 30183 reset in 2631 ms.
Product exploration explored 100000 steps with 30270 reset in 2700 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 (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 297 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 256 steps, including 0 resets, run visited all 3 properties in 74 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 350 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 192 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:15:25] [INFO ] Invariant cache hit.
[2023-03-21 06:15:26] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-21 06:15:26] [INFO ] Invariant cache hit.
[2023-03-21 06:15:27] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2023-03-21 06:15:27] [INFO ] Invariant cache hit.
[2023-03-21 06:15:31] [INFO ] Dead Transitions using invariants and state equation in 3798 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6059 ms. Remains : 2651/2651 places, 5050/5050 transitions.
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 (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 269 steps, including 0 resets, run visited all 3 properties in 43 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 318 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 30295 reset in 2635 ms.
Product exploration explored 100000 steps with 30329 reset in 2694 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 737 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:15:39] [INFO ] Redundant transitions in 447 ms returned []
[2023-03-21 06:15:39] [INFO ] Invariant cache hit.
[2023-03-21 06:15:45] [INFO ] Dead Transitions using invariants and state equation in 6016 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7209 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Support contains 150 out of 2651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2651/2651 places, 5050/5050 transitions.
Applied a total of 0 rules in 201 ms. Remains 2651 /2651 variables (removed 0) and now considering 5050/5050 (removed 0) transitions.
[2023-03-21 06:15:45] [INFO ] Invariant cache hit.
[2023-03-21 06:15:46] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-21 06:15:46] [INFO ] Invariant cache hit.
[2023-03-21 06:15:47] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2023-03-21 06:15:47] [INFO ] Invariant cache hit.
[2023-03-21 06:15:52] [INFO ] Dead Transitions using invariants and state equation in 5143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7398 ms. Remains : 2651/2651 places, 5050/5050 transitions.
Treatment of property SharedMemory-COL-000050-LTLFireability-09 finished in 42190 ms.
[2023-03-21 06:15:53] [INFO ] Flatten gal took : 172 ms
[2023-03-21 06:15:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-21 06:15:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2651 places, 5050 transitions and 20000 arcs took 31 ms.
Total runtime 332469 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1452/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SharedMemory-COL-000050-LTLFireability-09

BK_STOP 1679380336164

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SharedMemory-COL-000050-LTLFireability-09
ltl formula formula --ltl=/tmp/1452/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2651 places, 5050 transitions and 20000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.570 real 0.190 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1452/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1452/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1452/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1452/ltl_0_

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-000050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SharedMemory-COL-000050, 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 r361-smll-167891811800572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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