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.r623-tall-171774435500103.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 BlocksWorld-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r623-tall-171774435500103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 87K Jun 7 06:26 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 BlocksWorld-PT-01-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717775368562

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=BlocksWorld-PT-01
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 15:49:30] [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-06-07 15:49:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 15:49:30] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-06-07 15:49:30] [INFO ] Transformed 109 places.
[2024-06-07 15:49:30] [INFO ] Transformed 181 transitions.
[2024-06-07 15:49:30] [INFO ] Found NUPN structural information;
[2024-06-07 15:49:30] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2024-06-07 15:49:30] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BlocksWorld-PT-01-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-01-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 109 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 181/181 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 109 cols
[2024-06-07 15:49:30] [INFO ] Computed 19 invariants in 18 ms
[2024-06-07 15:49:30] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-07 15:49:30] [INFO ] Invariant cache hit.
[2024-06-07 15:49:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-07 15:49:30] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-07 15:49:30] [INFO ] Invariant cache hit.
[2024-06-07 15:49:31] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 18 transitions.
Found 18 dead transitions using SMT.
Drop transitions removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 1 ms
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 433 ms. Remains : 109/109 places, 163/181 transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Support contains 100 out of 100 places after structural reductions.
FORMULA BlocksWorld-PT-01-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 15:49:31] [INFO ] Flatten gal took : 39 ms
[2024-06-07 15:49:31] [INFO ] Flatten gal took : 22 ms
[2024-06-07 15:49:31] [INFO ] Input system was already deterministic with 163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 15:49:32] [INFO ] Computed 19 invariants in 10 ms
[2024-06-07 15:49:32] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-06-07 15:49:32] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2024-06-07 15:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:32] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :2 sat :1
[2024-06-07 15:49:32] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-06-07 15:49:32] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 163/163 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 162
Applied a total of 1 rules in 77 ms. Remains 100 /100 variables (removed 0) and now considering 162/163 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 100/100 places, 162/163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1507593 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :{}
Probabilistic random walk after 1507593 steps, saw 761465 distinct states, run finished after 3002 ms. (steps per millisecond=502 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 100 cols
[2024-06-07 15:49:35] [INFO ] Computed 19 invariants in 3 ms
[2024-06-07 15:49:35] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-07 15:49:35] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:49:35] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-06-07 15:49:35] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 31 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 100/100 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 29 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2024-06-07 15:49:35] [INFO ] Invariant cache hit.
[2024-06-07 15:49:35] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-07 15:49:35] [INFO ] Invariant cache hit.
[2024-06-07 15:49:36] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-07 15:49:36] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-07 15:49:36] [INFO ] Invariant cache hit.
[2024-06-07 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 22 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-07 15:49:36] [INFO ] Invariant cache hit.
[2024-06-07 15:49:36] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:36] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:49:36] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-07 15:49:36] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA BlocksWorld-PT-01-LTLFireability-11 TRUE 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' '!((G(p0)||G(((p2||X(p3))&&p1))))'
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 15:49:36] [INFO ] Computed 19 invariants in 4 ms
[2024-06-07 15:49:36] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-07 15:49:36] [INFO ] Invariant cache hit.
[2024-06-07 15:49:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:36] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-07 15:49:36] [INFO ] Invariant cache hit.
[2024-06-07 15:49:36] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 100/100 places, 163/163 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 461 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3))), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (OR (LT s2 1) (LT s4 1) (LT s5 1)) (OR (LT s2 1) (LT s7 1) (LT s8 1)) (OR (LT s2 1) (LT s22 1) (LT s23 1)) (OR (LT s2 1) (LT s25 1) (LT s26 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 4 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-01 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&p1)) U (G(X(p2)) U p1)))'
Support contains 16 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:49:37] [INFO ] Invariant cache hit.
[2024-06-07 15:49:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-07 15:49:37] [INFO ] Invariant cache hit.
[2024-06-07 15:49:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:37] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-07 15:49:37] [INFO ] Invariant cache hit.
[2024-06-07 15:49:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s18 1) (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s24 1) (GEQ s9 1) (GEQ s27 1) (GEQ s12 1) (GEQ s15 1)), p2:(AND (GEQ s29 1) (GEQ s50 1) (GEQ s64...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 511 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-04 finished in 1045 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)&&F((X(p2)&&p1)))))'
Support contains 28 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:49:38] [INFO ] Invariant cache hit.
[2024-06-07 15:49:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-07 15:49:38] [INFO ] Invariant cache hit.
[2024-06-07 15:49:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:38] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-07 15:49:38] [INFO ] Invariant cache hit.
[2024-06-07 15:49:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s18 1) (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s24 1) (GEQ s9 1) (GEQ s27 1) (GEQ s12 1) (GEQ s15 1)), p1:(AND (OR (LT s2 1) (LT s4 1) (LT s5 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17980 reset in 401 ms.
Stack based approach found an accepted trace after 24 steps with 6 reset with depth 7 and stack size 7 in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-05 finished in 866 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((F(p1)||p0))))'
Support contains 18 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:49:39] [INFO ] Invariant cache hit.
[2024-06-07 15:49:39] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-07 15:49:39] [INFO ] Invariant cache hit.
[2024-06-07 15:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-07 15:49:39] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-07 15:49:39] [INFO ] Invariant cache hit.
[2024-06-07 15:49:39] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (OR (LT s0 1) (LT s21 1)) (OR (LT s9 1) (LT s13 1)) (OR (LT s4 1) (LT s6 1)) (OR (LT s10 1) (LT s27 1)) (OR (LT s9 1) (LT s19 1)) (OR (LT s19 ...], 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 0 reset in 649 ms.
Product exploration explored 100000 steps with 0 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-07 15:49:41] [INFO ] Invariant cache hit.
[2024-06-07 15:49:41] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-01-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-01-LTLFireability-06 finished in 2108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(!p1))))))'
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:49:41] [INFO ] Invariant cache hit.
[2024-06-07 15:49:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-07 15:49:41] [INFO ] Invariant cache hit.
[2024-06-07 15:49:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-07 15:49:41] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-07 15:49:41] [INFO ] Invariant cache hit.
[2024-06-07 15:49:41] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 111 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s25 1) (LT s98 1)) (OR (LT s2 1) (LT s19 1) (LT s81 1)) (OR (LT s2 1) (LT s19 1) (LT s79 1)) (OR (LT s2 1) (LT s25 1) (LT s94 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 555 ms.
Product exploration explored 100000 steps with 0 reset in 579 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p0, (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-07 15:49:43] [INFO ] Invariant cache hit.
[2024-06-07 15:49:43] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:43] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:49:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:43] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:43] [INFO ] After 147ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:44] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-06-07 15:49:44] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 163/163 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 162
Applied a total of 1 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 162/163 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 162/163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 630884 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 630884 steps, saw 336474 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 162 rows 100 cols
[2024-06-07 15:49:47] [INFO ] Computed 19 invariants in 2 ms
[2024-06-07 15:49:47] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:47] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:49:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:47] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:47] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-06-07 15:49:48] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 100/100 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2024-06-07 15:49:48] [INFO ] Invariant cache hit.
[2024-06-07 15:49:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-07 15:49:48] [INFO ] Invariant cache hit.
[2024-06-07 15:49:48] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-07 15:49:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-07 15:49:48] [INFO ] Invariant cache hit.
[2024-06-07 15:49:48] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-07 15:49:48] [INFO ] Invariant cache hit.
[2024-06-07 15:49:48] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:48] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:49:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2024-06-07 15:49:48] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:48] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-06-07 15:49:48] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 91 ms :[p0, (AND p0 p1), p0]
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 15:49:49] [INFO ] Computed 19 invariants in 1 ms
[2024-06-07 15:49:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-07 15:49:49] [INFO ] Invariant cache hit.
[2024-06-07 15:49:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-07 15:49:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-07 15:49:49] [INFO ] Invariant cache hit.
[2024-06-07 15:49:49] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 100/100 places, 163/163 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-06-07 15:49:49] [INFO ] Invariant cache hit.
[2024-06-07 15:49:50] [INFO ] [Real]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-06-07 15:49:50] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:49:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:50] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:49:50] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:50] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 157 ms.
[2024-06-07 15:49:50] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 163/163 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 162
Applied a total of 1 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 162/163 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 100/100 places, 162/163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 737798 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 737798 steps, saw 389725 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 162 rows 100 cols
[2024-06-07 15:49:54] [INFO ] Computed 19 invariants in 13 ms
[2024-06-07 15:49:54] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:49:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2024-06-07 15:49:54] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:54] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-06-07 15:49:54] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2024-06-07 15:49:54] [INFO ] Invariant cache hit.
[2024-06-07 15:49:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-07 15:49:54] [INFO ] Invariant cache hit.
[2024-06-07 15:49:54] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-07 15:49:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-07 15:49:54] [INFO ] Invariant cache hit.
[2024-06-07 15:49:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 100/100 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-07 15:49:54] [INFO ] Invariant cache hit.
[2024-06-07 15:49:54] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2024-06-07 15:49:54] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:49:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2024-06-07 15:49:55] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 15:49:55] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-06-07 15:49:55] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 96 ms :[p0, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p0 p1), p0]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 346 ms.
Built C files in :
/tmp/ltsmin6906488978809900311
[2024-06-07 15:49:56] [INFO ] Computing symmetric may disable matrix : 163 transitions.
[2024-06-07 15:49:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:49:56] [INFO ] Computing symmetric may enable matrix : 163 transitions.
[2024-06-07 15:49:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:49:56] [INFO ] Computing Do-Not-Accords matrix : 163 transitions.
[2024-06-07 15:49:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:49:56] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6906488978809900311
Running compilation step : cd /tmp/ltsmin6906488978809900311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin6906488978809900311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin6906488978809900311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10519175239646010695.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 82 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
// Phase 1: matrix 163 rows 100 cols
[2024-06-07 15:50:11] [INFO ] Computed 19 invariants in 2 ms
[2024-06-07 15:50:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-07 15:50:11] [INFO ] Invariant cache hit.
[2024-06-07 15:50:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:50:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-07 15:50:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-07 15:50:11] [INFO ] Invariant cache hit.
[2024-06-07 15:50:11] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 100/100 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin7571506800485306997
[2024-06-07 15:50:11] [INFO ] Computing symmetric may disable matrix : 163 transitions.
[2024-06-07 15:50:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:50:11] [INFO ] Computing symmetric may enable matrix : 163 transitions.
[2024-06-07 15:50:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:50:11] [INFO ] Computing Do-Not-Accords matrix : 163 transitions.
[2024-06-07 15:50:11] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:50:11] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7571506800485306997
Running compilation step : cd /tmp/ltsmin7571506800485306997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 371 ms.
Running link step : cd /tmp/ltsmin7571506800485306997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7571506800485306997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3916526534908376994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-07 15:50:26] [INFO ] Flatten gal took : 18 ms
[2024-06-07 15:50:26] [INFO ] Flatten gal took : 12 ms
[2024-06-07 15:50:27] [INFO ] Time to serialize gal into /tmp/LTL14657665310135259619.gal : 29 ms
[2024-06-07 15:50:27] [INFO ] Time to serialize properties into /tmp/LTL3226490714790681123.prop : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14657665310135259619.gal' '-t' 'CGAL' '-hoa' '/tmp/aut606961761663147430.hoa' '-atoms' '/tmp/LTL3226490714790681123.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3226490714790681123.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut606961761663147430.hoa
Detected timeout of ITS tools.
[2024-06-07 15:50:42] [INFO ] Flatten gal took : 12 ms
[2024-06-07 15:50:42] [INFO ] Flatten gal took : 12 ms
[2024-06-07 15:50:42] [INFO ] Time to serialize gal into /tmp/LTL6508375497338759143.gal : 3 ms
[2024-06-07 15:50:42] [INFO ] Time to serialize properties into /tmp/LTL17481500595092988895.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6508375497338759143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17481500595092988895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((((pred_on_18<1)||(pred_on_65<1))||((pred_on_49<1)||(pred_on_5<1)))||(((pred_on_33<1)||(pred_on_79<1))||(pred_on_62<1)))")...4965
Formula 0 simplified : G(F!"((((pred_on_18<1)||(pred_on_65<1))||((pred_on_49<1)||(pred_on_5<1)))||(((pred_on_33<1)||(pred_on_79<1))||(pred_on_62<1)))" & F(...4956
Detected timeout of ITS tools.
[2024-06-07 15:50:57] [INFO ] Flatten gal took : 12 ms
[2024-06-07 15:50:57] [INFO ] Applying decomposition
[2024-06-07 15:50:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10849296353510416141.txt' '-o' '/tmp/graph10849296353510416141.bin' '-w' '/tmp/graph10849296353510416141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10849296353510416141.bin' '-l' '-1' '-v' '-w' '/tmp/graph10849296353510416141.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:50:57] [INFO ] Decomposing Gal with order
[2024-06-07 15:50:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:50:57] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 15:50:57] [INFO ] Flatten gal took : 57 ms
[2024-06-07 15:50:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 15:50:57] [INFO ] Time to serialize gal into /tmp/LTL12276962481790302057.gal : 3 ms
[2024-06-07 15:50:57] [INFO ] Time to serialize properties into /tmp/LTL17235242295929720312.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12276962481790302057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17235242295929720312.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((((u0.pred_on_18<1)||(u7.pred_on_65<1))||((u4.pred_on_49<1)||(u5.pred_on_5<1)))||(((u6.pred_on_33<1)||(u8.pred_on_79<1))||...5655
Formula 0 simplified : G(F!"((((u0.pred_on_18<1)||(u7.pred_on_65<1))||((u4.pred_on_49<1)||(u5.pred_on_5<1)))||(((u6.pred_on_33<1)||(u8.pred_on_79<1))||(u8....5646
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1839923852286754550
[2024-06-07 15:51:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1839923852286754550
Running compilation step : cd /tmp/ltsmin1839923852286754550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin1839923852286754550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1839923852286754550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(<>((LTLAPp1==true))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BlocksWorld-PT-01-LTLFireability-07 finished in 106260 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 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:51:27] [INFO ] Invariant cache hit.
[2024-06-07 15:51:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-07 15:51:27] [INFO ] Invariant cache hit.
[2024-06-07 15:51:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:51:27] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-07 15:51:27] [INFO ] Invariant cache hit.
[2024-06-07 15:51:27] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-09 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 s6 1) (OR (LT s29 1) (LT s50 1) (LT s64 1) (LT s68 1) (LT s79 1) (LT s91 1) (LT s98 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 964 reset in 313 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-09 finished in 653 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||G(p0))))'
Support contains 0 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:51:28] [INFO ] Invariant cache hit.
[2024-06-07 15:51:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-07 15:51:28] [INFO ] Invariant cache hit.
[2024-06-07 15:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:51:28] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-07 15:51:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-07 15:51:28] [INFO ] Invariant cache hit.
[2024-06-07 15:51:28] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 100/100 places, 163/163 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 9 ms :[false]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-12 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-12 TRUE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-12 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X(((F(p1) U (p2 U (p0 U p3))) U p0))))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:51:28] [INFO ] Invariant cache hit.
[2024-06-07 15:51:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-07 15:51:28] [INFO ] Invariant cache hit.
[2024-06-07 15:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:51:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-07 15:51:28] [INFO ] Invariant cache hit.
[2024-06-07 15:51:28] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 466 ms :[true, p1, (AND p0 p1), p0, p0, p0, p3, p3, (AND p1 p3), (AND p0 p1 p3), (AND p0 p3)]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 10}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 9}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={0} source=4 dest: 10}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={} source=5 dest: 10}], [{ cond=p3, acceptance={} source=6 dest: 0}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=p3, acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 p3), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 p1 p3), acceptance={} source=9 dest: 0}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=9 dest: 10}], [{ cond=(AND p0 p3), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 5}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={} source=10 dest: 10}]], initial=3, aps=[p1:(AND (GEQ s4 1) (GEQ s9 1)), p0:(AND (GEQ s19 1) (GEQ s24 1)), p3:(AND (GEQ s2 1) (GEQ s10 1) (GEQ s11 1)), p2:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 793 steps with 0 reset in 8 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-13 finished in 741 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(F(p1))))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:51:29] [INFO ] Invariant cache hit.
[2024-06-07 15:51:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-07 15:51:29] [INFO ] Invariant cache hit.
[2024-06-07 15:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:51:29] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-07 15:51:29] [INFO ] Invariant cache hit.
[2024-06-07 15:51:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s24 1), p1:(AND (GEQ s16 1) (GEQ s27 1))], 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 4628 reset in 312 ms.
Stack based approach found an accepted trace after 27 steps with 4 reset with depth 8 and stack size 8 in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-14 finished in 686 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)||F((X(X(p1))&&F(p2))))))'
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-07 15:51:30] [INFO ] Invariant cache hit.
[2024-06-07 15:51:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-07 15:51:30] [INFO ] Invariant cache hit.
[2024-06-07 15:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 15:51:30] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-07 15:51:30] [INFO ] Invariant cache hit.
[2024-06-07 15:51:30] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 100/100 places, 163/163 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=p0, acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s13 1) (GEQ s67 1)), p2:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s46 1)), p1:(AND (GEQ s2 1) (GEQ s25 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3215 reset in 288 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-01-LTLFireability-15 finished in 931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(!p1))))))'
[2024-06-07 15:51:31] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9618303483641411739
[2024-06-07 15:51:31] [INFO ] Computing symmetric may disable matrix : 163 transitions.
[2024-06-07 15:51:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:51:31] [INFO ] Applying decomposition
[2024-06-07 15:51:31] [INFO ] Computing symmetric may enable matrix : 163 transitions.
[2024-06-07 15:51:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:51:31] [INFO ] Flatten gal took : 12 ms
[2024-06-07 15:51:31] [INFO ] Computing Do-Not-Accords matrix : 163 transitions.
[2024-06-07 15:51:31] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 15:51:31] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9618303483641411739
Running compilation step : cd /tmp/ltsmin9618303483641411739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7495286540053494353.txt' '-o' '/tmp/graph7495286540053494353.bin' '-w' '/tmp/graph7495286540053494353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7495286540053494353.bin' '-l' '-1' '-v' '-w' '/tmp/graph7495286540053494353.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:51:31] [INFO ] Decomposing Gal with order
[2024-06-07 15:51:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:51:31] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 15:51:31] [INFO ] Flatten gal took : 25 ms
[2024-06-07 15:51:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-06-07 15:51:31] [INFO ] Time to serialize gal into /tmp/LTLFireability1623561314048273308.gal : 2 ms
[2024-06-07 15:51:31] [INFO ] Time to serialize properties into /tmp/LTLFireability6835472347692608242.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1623561314048273308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6835472347692608242.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G(!("((((u2.pred_on_18>=1)&&(u7.pred_on_65>=1))&&((u5.pred_on_49>=1)&&(u5.pred_on_5>=1)))&&(((u6.pred_on_33>=1)&&(u8.pred_on_7...5462
Formula 0 simplified : G(F"((((u2.pred_on_18>=1)&&(u7.pred_on_65>=1))&&((u5.pred_on_49>=1)&&(u5.pred_on_5>=1)))&&(((u6.pred_on_33>=1)&&(u8.pred_on_79>=1))&...5441
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin9618303483641411739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9618303483641411739;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 84397 ms.
FORMULA BlocksWorld-PT-01-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 205809 ms.

BK_STOP 1717775577068

--------------------
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="BlocksWorld-PT-01"
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 BlocksWorld-PT-01, 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 r623-tall-171774435500103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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