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.r285-smll-171654421700003.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 PaceMaker-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421700003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 158K 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 PaceMaker-PT-none-LTLFireability-00
FORMULA_NAME PaceMaker-PT-none-LTLFireability-01
FORMULA_NAME PaceMaker-PT-none-LTLFireability-02
FORMULA_NAME PaceMaker-PT-none-LTLFireability-03
FORMULA_NAME PaceMaker-PT-none-LTLFireability-04
FORMULA_NAME PaceMaker-PT-none-LTLFireability-05
FORMULA_NAME PaceMaker-PT-none-LTLFireability-06
FORMULA_NAME PaceMaker-PT-none-LTLFireability-07
FORMULA_NAME PaceMaker-PT-none-LTLFireability-08
FORMULA_NAME PaceMaker-PT-none-LTLFireability-09
FORMULA_NAME PaceMaker-PT-none-LTLFireability-10
FORMULA_NAME PaceMaker-PT-none-LTLFireability-11
FORMULA_NAME PaceMaker-PT-none-LTLFireability-12
FORMULA_NAME PaceMaker-PT-none-LTLFireability-13
FORMULA_NAME PaceMaker-PT-none-LTLFireability-14
FORMULA_NAME PaceMaker-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716839928449

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=PaceMaker-PT-none
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 19:58:51] [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-27 19:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 19:58:51] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-27 19:58:51] [INFO ] Transformed 70 places.
[2024-05-27 19:58:51] [INFO ] Transformed 164 transitions.
[2024-05-27 19:58:51] [INFO ] Parsed PT model containing 70 places and 164 transitions and 954 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PaceMaker-PT-none-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 22 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 19:58:52] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2024-05-27 19:58:52] [INFO ] Computed 35 invariants in 7 ms
[2024-05-27 19:58:52] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
[2024-05-27 19:58:52] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 19:58:52] [INFO ] Invariant cache hit.
[2024-05-27 19:58:52] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 19:58:52] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 19:58:52] [INFO ] Invariant cache hit.
[2024-05-27 19:58:52] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 19:58:52] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-27 19:58:52] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 19:58:52] [INFO ] Invariant cache hit.
[2024-05-27 19:58:52] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 950 ms. Remains : 70/70 places, 164/164 transitions.
Support contains 42 out of 70 places after structural reductions.
[2024-05-27 19:58:53] [INFO ] Flatten gal took : 53 ms
[2024-05-27 19:58:53] [INFO ] Flatten gal took : 24 ms
[2024-05-27 19:58:53] [INFO ] Input system was already deterministic with 164 transitions.
Support contains 40 out of 70 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 19:58:54] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 19:58:54] [INFO ] Invariant cache hit.
[2024-05-27 19:58:54] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-27 19:58:54] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-27 19:58:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-27 19:59:19] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 160
Applied a total of 12 rules in 30 ms. Remains 62 /70 variables (removed 8) and now considering 160/164 (removed 4) transitions.
[2024-05-27 19:59:19] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2024-05-27 19:59:19] [INFO ] Computed 31 invariants in 7 ms
[2024-05-27 19:59:19] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 62/70 places, 160/164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 277063 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 277063 steps, saw 206407 distinct states, run finished after 3004 ms. (steps per millisecond=92 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-27 19:59:23] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 19:59:23] [INFO ] Invariant cache hit.
[2024-05-27 19:59:23] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-27 19:59:23] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 19:59:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2024-05-27 19:59:41] [INFO ] After 18729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 62/62 places, 160/160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 919908 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 919908 steps, saw 634385 distinct states, run finished after 3002 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 19:59:44] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 19:59:44] [INFO ] Invariant cache hit.
[2024-05-27 19:59:45] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-27 19:59:45] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 19:59:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2024-05-27 20:00:03] [INFO ] After 18737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-27 20:00:03] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:03] [INFO ] Invariant cache hit.
[2024-05-27 20:00:03] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 20:00:03] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:03] [INFO ] Invariant cache hit.
[2024-05-27 20:00:04] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:04] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-27 20:00:04] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-27 20:00:04] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:04] [INFO ] Invariant cache hit.
[2024-05-27 20:00:04] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 62/62 places, 160/160 transitions.
Graph (complete) has 218 edges and 62 vertex of which 28 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.3 ms
Discarding 34 places :
Also discarding 83 output transitions
Drop transitions removed 83 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 28 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 22 transition count 70
Graph (complete) has 118 edges and 22 vertex of which 18 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 18 transition count 66
Applied a total of 15 rules in 12 ms. Remains 18 /62 variables (removed 44) and now considering 66/160 (removed 94) transitions.
Running SMT prover for 1 properties.
[2024-05-27 20:00:04] [INFO ] Flow matrix only has 64 transitions (discarded 2 similar events)
Normalized transition count is 41 out of 64 initially.
// Phase 1: matrix 41 rows 18 cols
[2024-05-27 20:00:04] [INFO ] Computed 9 invariants in 1 ms
[2024-05-27 20:00:04] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:00:04] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 20:00:14] [INFO ] After 9912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA PaceMaker-PT-none-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(G((p0 U X(p1)))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:00:14] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2024-05-27 20:00:14] [INFO ] Computed 35 invariants in 1 ms
[2024-05-27 20:00:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
[2024-05-27 20:00:14] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:14] [INFO ] Invariant cache hit.
[2024-05-27 20:00:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 20:00:14] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:14] [INFO ] Invariant cache hit.
[2024-05-27 20:00:14] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:15] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-27 20:00:15] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:15] [INFO ] Invariant cache hit.
[2024-05-27 20:00:15] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 710 ms. Remains : 70/70 places, 164/164 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 417 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s25 903) (GEQ s60 48))], 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 2 reset in 824 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 104 in 3 ms.
FORMULA PaceMaker-PT-none-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-01 finished in 2035 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||G(p1)))))'
Support contains 10 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:00:16] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:16] [INFO ] Invariant cache hit.
[2024-05-27 20:00:16] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
[2024-05-27 20:00:16] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:16] [INFO ] Invariant cache hit.
[2024-05-27 20:00:16] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 20:00:16] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:16] [INFO ] Invariant cache hit.
[2024-05-27 20:00:17] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:17] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-27 20:00:17] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:17] [INFO ] Invariant cache hit.
[2024-05-27 20:00:17] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 860 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-02 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=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s16 34) (LT s17 723) (LT s51 917) (LT s52 228)), p0:(AND (OR (LT s10 1) (LT s27 540) (LT s62 411)) (OR (LT s18 246) (LT s43 1) (LT s53 705)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 652 ms.
Product exploration explored 100000 steps with 50000 reset in 431 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PaceMaker-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PaceMaker-PT-none-LTLFireability-02 finished in 2228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 160
Applied a total of 12 rules in 13 ms. Remains 62 /70 variables (removed 8) and now considering 160/164 (removed 4) transitions.
[2024-05-27 20:00:18] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2024-05-27 20:00:18] [INFO ] Computed 31 invariants in 2 ms
[2024-05-27 20:00:18] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
[2024-05-27 20:00:18] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:18] [INFO ] Invariant cache hit.
[2024-05-27 20:00:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 20:00:19] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:19] [INFO ] Invariant cache hit.
[2024-05-27 20:00:19] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:19] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-27 20:00:19] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-27 20:00:19] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:19] [INFO ] Invariant cache hit.
[2024-05-27 20:00:19] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/70 places, 160/164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 62/70 places, 160/164 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s13 721) (GEQ s16 633) (GEQ s17 655) (GEQ s44 230) (GEQ s47 318) (GEQ s48 296))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 289 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA PaceMaker-PT-none-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-03 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&F(p2))))'
Support contains 13 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:00:19] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2024-05-27 20:00:19] [INFO ] Computed 35 invariants in 1 ms
[2024-05-27 20:00:19] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
[2024-05-27 20:00:19] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:19] [INFO ] Invariant cache hit.
[2024-05-27 20:00:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 20:00:19] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:19] [INFO ] Invariant cache hit.
[2024-05-27 20:00:20] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:20] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-27 20:00:20] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:20] [INFO ] Invariant cache hit.
[2024-05-27 20:00:20] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s16 35) (GEQ s21 654) (GEQ s23 727) (GEQ s51 916) (GEQ s56 297) (GEQ s58 224)) (AND (GEQ s28 683) (GEQ s44 1) (GEQ s63 268))), p2:(AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PaceMaker-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-05 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((G(p0) U p1)))))'
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:00:20] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:20] [INFO ] Invariant cache hit.
[2024-05-27 20:00:20] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2024-05-27 20:00:20] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:20] [INFO ] Invariant cache hit.
[2024-05-27 20:00:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-27 20:00:20] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:20] [INFO ] Invariant cache hit.
[2024-05-27 20:00:20] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:20] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-27 20:00:21] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:21] [INFO ] Invariant cache hit.
[2024-05-27 20:00:21] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s28 547) (GEQ s63 404)), p1:(AND (GEQ s13 1) (GEQ s18 244) (GEQ s53 707))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 1 reset in 1 ms.
FORMULA PaceMaker-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-07 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:00:21] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:21] [INFO ] Invariant cache hit.
[2024-05-27 20:00:21] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
[2024-05-27 20:00:21] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:21] [INFO ] Invariant cache hit.
[2024-05-27 20:00:21] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 20:00:21] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:21] [INFO ] Invariant cache hit.
[2024-05-27 20:00:21] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:21] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-27 20:00:21] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:21] [INFO ] Invariant cache hit.
[2024-05-27 20:00:21] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-08 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (LT s25 899) (LT s60 52)), p0:(OR (LT s26 681) (LT s61 270) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 295 ms.
Product exploration explored 100000 steps with 0 reset in 537 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 p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:00:23] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:00:23] [INFO ] Invariant cache hit.
[2024-05-27 20:00:23] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2024-05-27 20:00:23] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:00:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-27 20:00:43] [INFO ] After 19590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:00:43] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:00:48] [INFO ] After 5362ms SMT Verify possible using 131 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:48] [INFO ] After 5365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2024-05-27 20:00:48] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3345 ms.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 160
Applied a total of 12 rules in 11 ms. Remains 62 /70 variables (removed 8) and now considering 160/164 (removed 4) transitions.
[2024-05-27 20:00:52] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2024-05-27 20:00:52] [INFO ] Computed 31 invariants in 1 ms
[2024-05-27 20:00:52] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 62/70 places, 160/164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 270652 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270652 steps, saw 201920 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:00:55] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:00:55] [INFO ] Invariant cache hit.
[2024-05-27 20:00:55] [INFO ] [Real]Absence check using 31 positive place invariants in 7 ms returned sat
[2024-05-27 20:00:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:00:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2024-05-27 20:01:11] [INFO ] After 15959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:01:11] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:01:11] [INFO ] After 275ms SMT Verify possible using 131 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:01:12] [INFO ] Deduced a trap composed of 1 places in 51 ms of which 9 ms to minimize.
[2024-05-27 20:01:12] [INFO ] Deduced a trap composed of 1 places in 51 ms of which 3 ms to minimize.
[2024-05-27 20:01:12] [INFO ] Deduced a trap composed of 1 places in 35 ms of which 3 ms to minimize.
[2024-05-27 20:01:12] [INFO ] Deduced a trap composed of 1 places in 33 ms of which 2 ms to minimize.
[2024-05-27 20:01:12] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 2 ms to minimize.
[2024-05-27 20:01:12] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 2 ms to minimize.
[2024-05-27 20:01:20] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 8706 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:01:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:01:20] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 2 properties in 3388 ms.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/62 places, 160/160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 590158 steps, run visited all 1 properties in 1955 ms. (steps per millisecond=301 )
Probabilistic random walk after 590158 steps, saw 419128 distinct states, run finished after 1956 ms. (steps per millisecond=301 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PaceMaker-PT-none-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PaceMaker-PT-none-LTLFireability-08 finished in 65013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(!p1)))))'
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 160
Applied a total of 12 rules in 12 ms. Remains 62 /70 variables (removed 8) and now considering 160/164 (removed 4) transitions.
[2024-05-27 20:01:26] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:01:26] [INFO ] Invariant cache hit.
[2024-05-27 20:01:26] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
[2024-05-27 20:01:26] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:01:26] [INFO ] Invariant cache hit.
[2024-05-27 20:01:26] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-27 20:01:26] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:01:26] [INFO ] Invariant cache hit.
[2024-05-27 20:01:26] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:01:27] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-05-27 20:01:27] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-27 20:01:27] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
[2024-05-27 20:01:27] [INFO ] Invariant cache hit.
[2024-05-27 20:01:27] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/70 places, 160/164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 930 ms. Remains : 62/70 places, 160/164 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s23 545) (GEQ s32 1) (GEQ s54 406)), p1:(AND (GEQ s0 1) (GEQ s24 547) (GEQ s55 404))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10 reset in 582 ms.
Stack based approach found an accepted trace after 73 steps with 2 reset with depth 11 and stack size 11 in 0 ms.
FORMULA PaceMaker-PT-none-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-09 finished in 1637 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 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:01:28] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2024-05-27 20:01:28] [INFO ] Computed 35 invariants in 1 ms
[2024-05-27 20:01:28] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
[2024-05-27 20:01:28] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:28] [INFO ] Invariant cache hit.
[2024-05-27 20:01:28] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 20:01:28] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:28] [INFO ] Invariant cache hit.
[2024-05-27 20:01:28] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:01:28] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-27 20:01:28] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:28] [INFO ] Invariant cache hit.
[2024-05-27 20:01:28] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 715 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s17 52) (GEQ s52 899))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 367 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA PaceMaker-PT-none-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-11 finished in 1206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))'
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:01:29] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:29] [INFO ] Invariant cache hit.
[2024-05-27 20:01:29] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2024-05-27 20:01:29] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:29] [INFO ] Invariant cache hit.
[2024-05-27 20:01:29] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 20:01:29] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:29] [INFO ] Invariant cache hit.
[2024-05-27 20:01:29] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:01:29] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-27 20:01:29] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:29] [INFO ] Invariant cache hit.
[2024-05-27 20:01:29] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), p0, p0, true]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s31 268) (GEQ s66 683)), p1:(AND (GEQ s20 632) (GEQ s22 711) (GEQ s55 319) (GEQ s57 240))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 467 ms.
Stack based approach found an accepted trace after 149 steps with 1 reset with depth 148 and stack size 148 in 1 ms.
FORMULA PaceMaker-PT-none-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-12 finished in 1231 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||X(G(p1)))))))'
Support contains 9 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 164/164 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-27 20:01:30] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:30] [INFO ] Invariant cache hit.
[2024-05-27 20:01:30] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
[2024-05-27 20:01:30] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:30] [INFO ] Invariant cache hit.
[2024-05-27 20:01:30] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 20:01:30] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:30] [INFO ] Invariant cache hit.
[2024-05-27 20:01:30] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 20:01:31] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-27 20:01:31] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
[2024-05-27 20:01:31] [INFO ] Invariant cache hit.
[2024-05-27 20:01:31] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 70/70 places, 164/164 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PaceMaker-PT-none-LTLFireability-14 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=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s34 725) (LT s38 1) (LT s39 1) (LT s69 226)), p0:(AND (OR (LT s18 245) (LT s53 706)) (OR (LT s28 683) (LT s44 1) (LT s63 268)))], 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 21 steps with 0 reset in 0 ms.
FORMULA PaceMaker-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PaceMaker-PT-none-LTLFireability-14 finished in 1215 ms.
All properties solved by simple procedures.
Total runtime 160284 ms.

BK_STOP 1716840092774

--------------------
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="PaceMaker-PT-none"
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 PaceMaker-PT-none, 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 r285-smll-171654421700003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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