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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 64M
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.1M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 38K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 823K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 4.2M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 158K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 380K 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 5.1M 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-14-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717790797266

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-14
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 20:06:38] [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 20:06:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 20:06:39] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2024-06-07 20:06:39] [INFO ] Transformed 5401 places.
[2024-06-07 20:06:39] [INFO ] Transformed 10513 transitions.
[2024-06-07 20:06:39] [INFO ] Found NUPN structural information;
[2024-06-07 20:06:39] [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, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71]
[2024-06-07 20:06:39] [INFO ] Parsed PT model containing 5401 places and 10513 transitions and 52548 arcs in 717 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 109 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BlocksWorld-PT-14-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-14-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-14-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-14-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 214 out of 5401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5401/5401 places, 10513/10513 transitions.
Applied a total of 0 rules in 766 ms. Remains 5401 /5401 variables (removed 0) and now considering 10513/10513 (removed 0) transitions.
// Phase 1: matrix 10513 rows 5401 cols
[2024-06-07 20:06:41] [INFO ] Computed 145 invariants in 172 ms
[2024-06-07 20:06:45] [INFO ] Implicit Places using invariants in 3915 ms returned []
Implicit Place search using SMT only with invariants took 3943 ms to find 0 implicit places.
[2024-06-07 20:06:45] [INFO ] Invariant cache hit.
[2024-06-07 20:06:52] [INFO ] Dead Transitions using invariants and state equation in 6646 ms found 6 transitions.
Found 6 dead transitions using SMT.
Drop transitions removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 5401/5401 places, 10507/10513 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 5398 transition count 10507
Applied a total of 3 rules in 591 ms. Remains 5398 /5401 variables (removed 3) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:06:52] [INFO ] Computed 145 invariants in 65 ms
[2024-06-07 20:06:56] [INFO ] Implicit Places using invariants in 3865 ms returned []
Implicit Place search using SMT only with invariants took 3867 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5398/5401 places, 10507/10513 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15819 ms. Remains : 5398/5401 places, 10507/10513 transitions.
Support contains 214 out of 5398 places after structural reductions.
[2024-06-07 20:06:58] [INFO ] Flatten gal took : 748 ms
[2024-06-07 20:07:00] [INFO ] Flatten gal took : 739 ms
[2024-06-07 20:07:03] [INFO ] Input system was already deterministic with 10507 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1383 ms. (steps per millisecond=7 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-07 20:07:05] [INFO ] Invariant cache hit.
[2024-06-07 20:07:06] [INFO ] [Real]Absence check using 145 positive place invariants in 124 ms returned sat
[2024-06-07 20:07:12] [INFO ] After 5851ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-07 20:07:12] [INFO ] State equation strengthened by 129 read => feed constraints.
[2024-06-07 20:07:15] [INFO ] After 2826ms SMT Verify possible using 129 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 20:07:15] [INFO ] After 9877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 20:07:16] [INFO ] [Nat]Absence check using 145 positive place invariants in 127 ms returned sat
[2024-06-07 20:07:22] [INFO ] After 6029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 20:07:24] [INFO ] After 2031ms SMT Verify possible using 129 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 20:07:25] [INFO ] After 3016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 585 ms.
[2024-06-07 20:07:25] [INFO ] After 10492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 69 out of 5398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5398/5398 places, 10507/10507 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 5398 transition count 10506
Applied a total of 1 rules in 65172 ms. Remains 5398 /5398 variables (removed 0) and now considering 10506/10507 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65176 ms. Remains : 5398/5398 places, 10506/10507 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 220089 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{1=1}
Probabilistic random walk after 220089 steps, saw 194696 distinct states, run finished after 3004 ms. (steps per millisecond=73 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10506 rows 5398 cols
[2024-06-07 20:08:35] [INFO ] Computed 145 invariants in 63 ms
[2024-06-07 20:08:36] [INFO ] [Real]Absence check using 145 positive place invariants in 130 ms returned sat
[2024-06-07 20:08:42] [INFO ] After 6353ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 20:08:42] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-06-07 20:08:44] [INFO ] After 2159ms SMT Verify possible using 128 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-06-07 20:08:45] [INFO ] After 2665ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 20:08:45] [INFO ] After 9782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 20:08:46] [INFO ] [Nat]Absence check using 145 positive place invariants in 130 ms returned sat
[2024-06-07 20:08:52] [INFO ] After 6132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 20:08:54] [INFO ] After 2117ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 20:08:54] [INFO ] After 2633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 290 ms.
[2024-06-07 20:08:55] [INFO ] After 9767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 66 out of 5398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5398/5398 places, 10506/10506 transitions.
Applied a total of 0 rules in 70523 ms. Remains 5398 /5398 variables (removed 0) and now considering 10506/10506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70523 ms. Remains : 5398/5398 places, 10506/10506 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&F(G(!p0)))))'
Support contains 144 out of 5398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 3273 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:10:09] [INFO ] Computed 145 invariants in 70 ms
[2024-06-07 20:10:13] [INFO ] Implicit Places using invariants in 4202 ms returned []
Implicit Place search using SMT only with invariants took 4203 ms to find 0 implicit places.
[2024-06-07 20:10:13] [INFO ] Invariant cache hit.
[2024-06-07 20:10:20] [INFO ] Dead Transitions using invariants and state equation in 6469 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Graph (complete) has 30827 edges and 5398 vertex of which 5396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3132 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:10:23] [INFO ] Computed 145 invariants in 69 ms
[2024-06-07 20:10:27] [INFO ] Implicit Places using invariants in 3980 ms returned []
Implicit Place search using SMT only with invariants took 3984 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21072 ms. Remains : 5396/5398 places, 10503/10507 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 152 ms :[p0]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s33 1) (GEQ s199 1)) (AND (GEQ s25 1) (GEQ s87 1)) (AND (GEQ s46 1) (GEQ s186 1)) (AND (GEQ s160 1) (GEQ s207 1)) (AND (GEQ s93 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 21550 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 14 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-00 finished in 31393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(!p1&&F(!p0))))))'
Support contains 210 out of 5398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 511 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:10:38] [INFO ] Computed 145 invariants in 62 ms
[2024-06-07 20:10:42] [INFO ] Implicit Places using invariants in 3845 ms returned []
Implicit Place search using SMT only with invariants took 3847 ms to find 0 implicit places.
[2024-06-07 20:10:42] [INFO ] Invariant cache hit.
[2024-06-07 20:10:48] [INFO ] Dead Transitions using invariants and state equation in 6359 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5396 transition count 10503
Applied a total of 2 rules in 571 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:10:49] [INFO ] Computed 145 invariants in 59 ms
[2024-06-07 20:10:52] [INFO ] Implicit Places using invariants in 3502 ms returned []
Implicit Place search using SMT only with invariants took 3516 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14808 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s3 1) (GEQ s66 1) (GEQ s129 1) (GEQ s192 1) (GEQ s135 1) (GEQ s198 1) (GEQ s9 1) (GEQ s72 1) (GEQ s15 1) (GEQ s78 1) (GEQ s141 1) (GEQ s204 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 47740 steps with 15913 reset in 10002 ms.
Product exploration timeout after 47640 steps with 15880 reset in 10003 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 p0), (X p1), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-14-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-14-LTLFireability-03 finished in 35237 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(X(F((G(p1)&&p0))))))'
Support contains 210 out of 5398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 519 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:11:13] [INFO ] Computed 145 invariants in 62 ms
[2024-06-07 20:11:17] [INFO ] Implicit Places using invariants in 3736 ms returned []
Implicit Place search using SMT only with invariants took 3738 ms to find 0 implicit places.
[2024-06-07 20:11:17] [INFO ] Invariant cache hit.
[2024-06-07 20:11:23] [INFO ] Dead Transitions using invariants and state equation in 6472 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5396 transition count 10503
Applied a total of 2 rules in 529 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:11:24] [INFO ] Computed 145 invariants in 63 ms
[2024-06-07 20:11:27] [INFO ] Implicit Places using invariants in 3612 ms returned []
Implicit Place search using SMT only with invariants took 3622 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14884 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s33 1) (LT s199 1)) (OR (LT s25 1) (LT s87 1)) (OR (LT s46 1) (LT s186 1)) (OR (LT s160 1) (LT s207 1)) (OR (LT s93 1) (LT s97 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 20660 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 6 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-04 finished in 25268 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((X(p0)||G(!p1)))))'
Support contains 210 out of 5398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 518 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:11:38] [INFO ] Computed 145 invariants in 59 ms
[2024-06-07 20:11:42] [INFO ] Implicit Places using invariants in 3729 ms returned []
Implicit Place search using SMT only with invariants took 3733 ms to find 0 implicit places.
[2024-06-07 20:11:42] [INFO ] Invariant cache hit.
[2024-06-07 20:11:49] [INFO ] Dead Transitions using invariants and state equation in 6739 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5396 transition count 10503
Applied a total of 2 rules in 533 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:11:49] [INFO ] Computed 145 invariants in 63 ms
[2024-06-07 20:11:53] [INFO ] Implicit Places using invariants in 3928 ms returned []
Implicit Place search using SMT only with invariants took 3939 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15464 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p0:(OR (AND (GEQ s33 1) (GEQ s199 1)) (AND (GEQ s25 1) (GEQ s87 1)) (AND (GEQ s46 1) (GEQ s186 1)) (AND (GEQ s160 1) (GEQ s207 1)) (AND (GEQ s93 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 7308 ms.
Product exploration explored 100000 steps with 25000 reset in 7449 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 p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1109 ms. (steps per millisecond=9 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 8004 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 2 properties.
[2024-06-07 20:12:15] [INFO ] Invariant cache hit.
[2024-06-07 20:12:22] [INFO ] [Real]Absence check using 145 positive place invariants in 121 ms returned sat
[2024-06-07 20:12:28] [INFO ] After 5766ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-07 20:12:28] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-06-07 20:12:30] [INFO ] After 2448ms SMT Verify possible using 125 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 20:12:30] [INFO ] After 9248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 20:12:31] [INFO ] [Nat]Absence check using 145 positive place invariants in 124 ms returned sat
[2024-06-07 20:12:37] [INFO ] After 5977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 20:12:40] [INFO ] After 2500ms SMT Verify possible using 125 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 20:12:50] [INFO ] Deduced a trap composed of 144 places in 9927 ms of which 6 ms to minimize.
[2024-06-07 20:12:52] [INFO ] Deduced a trap composed of 744 places in 1240 ms of which 1 ms to minimize.
[2024-06-07 20:12:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12047 ms
[2024-06-07 20:12:52] [INFO ] After 15451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 611 ms.
[2024-06-07 20:12:53] [INFO ] After 22969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 210 out of 5396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5396/5396 places, 10503/10503 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 5396 transition count 10502
Applied a total of 1 rules in 67819 ms. Remains 5396 /5396 variables (removed 0) and now considering 10502/10503 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67821 ms. Remains : 5396/5396 places, 10502/10503 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 219 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 210 out of 5396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5396/5396 places, 10503/10503 transitions.
Applied a total of 0 rules in 501 ms. Remains 5396 /5396 variables (removed 0) and now considering 10503/10503 (removed 0) transitions.
[2024-06-07 20:14:02] [INFO ] Invariant cache hit.
[2024-06-07 20:14:06] [INFO ] Implicit Places using invariants in 3920 ms returned []
Implicit Place search using SMT only with invariants took 3921 ms to find 0 implicit places.
[2024-06-07 20:14:06] [INFO ] Invariant cache hit.
[2024-06-07 20:14:13] [INFO ] Dead Transitions using invariants and state equation in 6771 ms found 6 transitions.
Found 6 dead transitions using SMT.
Drop transitions removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 5396/5396 places, 10497/10503 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 5393 transition count 10497
Applied a total of 3 rules in 497 ms. Remains 5393 /5396 variables (removed 3) and now considering 10497/10497 (removed 0) transitions.
// Phase 1: matrix 10497 rows 5393 cols
[2024-06-07 20:14:13] [INFO ] Computed 145 invariants in 66 ms
[2024-06-07 20:14:17] [INFO ] Implicit Places using invariants in 3630 ms returned []
Implicit Place search using SMT only with invariants took 3630 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5393/5396 places, 10497/10503 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15322 ms. Remains : 5393/5396 places, 10497/10503 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1171 ms. (steps per millisecond=8 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 8206 steps, including 2 resets, run timeout after 5003 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 2 properties.
[2024-06-07 20:14:24] [INFO ] Invariant cache hit.
[2024-06-07 20:14:30] [INFO ] [Real]Absence check using 145 positive place invariants in 127 ms returned sat
[2024-06-07 20:14:36] [INFO ] After 5931ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-07 20:14:36] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-07 20:14:39] [INFO ] After 2476ms SMT Verify possible using 119 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 20:14:39] [INFO ] After 9435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 20:14:39] [INFO ] [Nat]Absence check using 145 positive place invariants in 123 ms returned sat
[2024-06-07 20:14:46] [INFO ] After 6104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 20:14:48] [INFO ] After 2001ms SMT Verify possible using 119 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 20:14:59] [INFO ] Deduced a trap composed of 144 places in 10224 ms of which 5 ms to minimize.
[2024-06-07 20:15:00] [INFO ] Deduced a trap composed of 744 places in 1195 ms of which 2 ms to minimize.
[2024-06-07 20:15:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12281 ms
[2024-06-07 20:15:01] [INFO ] After 14971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 592 ms.
[2024-06-07 20:15:01] [INFO ] After 22653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 210 out of 5393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5393/5393 places, 10497/10497 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 5393 transition count 10496
Applied a total of 1 rules in 67696 ms. Remains 5393 /5393 variables (removed 0) and now considering 10496/10497 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67696 ms. Remains : 5393/5393 places, 10496/10497 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 8988 ms.
Product exploration explored 100000 steps with 25000 reset in 9315 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 210 out of 5393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5393/5393 places, 10497/10497 transitions.
Applied a total of 0 rules in 3033 ms. Remains 5393 /5393 variables (removed 0) and now considering 10497/10497 (removed 0) transitions.
[2024-06-07 20:16:32] [INFO ] Invariant cache hit.
[2024-06-07 20:16:37] [INFO ] Dead Transitions using invariants and state equation in 5855 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5393/5393 places, 10495/10497 transitions.
Graph (complete) has 30807 edges and 5393 vertex of which 5392 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2848 ms. Remains 5392 /5393 variables (removed 1) and now considering 10495/10495 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 5392/5393 places, 10495/10497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11754 ms. Remains : 5392/5393 places, 10495/10497 transitions.
Built C files in :
/tmp/ltsmin7218359759335849583
[2024-06-07 20:16:41] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7218359759335849583
Running compilation step : cd /tmp/ltsmin7218359759335849583;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7218359759335849583;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7218359759335849583;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 210 out of 5393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5393/5393 places, 10497/10497 transitions.
Applied a total of 0 rules in 498 ms. Remains 5393 /5393 variables (removed 0) and now considering 10497/10497 (removed 0) transitions.
[2024-06-07 20:16:44] [INFO ] Invariant cache hit.
[2024-06-07 20:16:48] [INFO ] Implicit Places using invariants in 3663 ms returned []
Implicit Place search using SMT only with invariants took 3675 ms to find 0 implicit places.
[2024-06-07 20:16:48] [INFO ] Invariant cache hit.
[2024-06-07 20:16:54] [INFO ] Dead Transitions using invariants and state equation in 6324 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 5393/5393 places, 10495/10497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5392 transition count 10495
Applied a total of 1 rules in 529 ms. Remains 5392 /5393 variables (removed 1) and now considering 10495/10495 (removed 0) transitions.
// Phase 1: matrix 10495 rows 5392 cols
[2024-06-07 20:16:55] [INFO ] Computed 145 invariants in 67 ms
[2024-06-07 20:16:59] [INFO ] Implicit Places using invariants in 3946 ms returned []
Implicit Place search using SMT only with invariants took 3949 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5392/5393 places, 10495/10497 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14990 ms. Remains : 5392/5393 places, 10495/10497 transitions.
Built C files in :
/tmp/ltsmin18214047216215582119
[2024-06-07 20:16:59] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18214047216215582119
Running compilation step : cd /tmp/ltsmin18214047216215582119;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18214047216215582119;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18214047216215582119;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 20:17:03] [INFO ] Flatten gal took : 450 ms
[2024-06-07 20:17:03] [INFO ] Flatten gal took : 375 ms
[2024-06-07 20:17:03] [INFO ] Time to serialize gal into /tmp/LTL8978685457956248234.gal : 106 ms
[2024-06-07 20:17:03] [INFO ] Time to serialize properties into /tmp/LTL2547768770606289724.prop : 16 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/LTL8978685457956248234.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10421270419540730479.hoa' '-atoms' '/tmp/LTL2547768770606289724.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...318
Loading property file /tmp/LTL2547768770606289724.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10421270419540730479.hoa
Detected timeout of ITS tools.
[2024-06-07 20:17:20] [INFO ] Flatten gal took : 512 ms
[2024-06-07 20:17:20] [INFO ] Flatten gal took : 395 ms
[2024-06-07 20:17:20] [INFO ] Time to serialize gal into /tmp/LTL7086915194579343940.gal : 66 ms
[2024-06-07 20:17:20] [INFO ] Time to serialize properties into /tmp/LTL10867293023007300274.ltl : 32 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/LTL7086915194579343940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10867293023007300274.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 : !((X(X((X("(((((((((((((((pred_holding_10>=1)&&(pred_clear_66>=1))||((pred_clear_8>=1)&&(pred_holding_28>=1)))||(((pred_clear_15>=1)&&...238369
Formula 0 simplified : XX(X!"(((((((((((((((pred_holding_10>=1)&&(pred_clear_66>=1))||((pred_clear_8>=1)&&(pred_holding_28>=1)))||(((pred_clear_15>=1)&&(pr...238359
Detected timeout of ITS tools.
[2024-06-07 20:17:35] [INFO ] Flatten gal took : 388 ms
[2024-06-07 20:17:35] [INFO ] Applying decomposition
[2024-06-07 20:17:36] [INFO ] Flatten gal took : 436 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/graph5293897239261376337.txt' '-o' '/tmp/graph5293897239261376337.bin' '-w' '/tmp/graph5293897239261376337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5293897239261376337.bin' '-l' '-1' '-v' '-w' '/tmp/graph5293897239261376337.weights' '-q' '0' '-e' '0.001'
[2024-06-07 20:17:37] [INFO ] Decomposing Gal with order
[2024-06-07 20:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 20:17:40] [INFO ] Removed a total of 20142 redundant transitions.
[2024-06-07 20:17:40] [INFO ] Flatten gal took : 2457 ms
[2024-06-07 20:17:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 692 labels/synchronizations in 394 ms.
[2024-06-07 20:17:41] [INFO ] Time to serialize gal into /tmp/LTL13838081979801278555.gal : 194 ms
[2024-06-07 20:17:41] [INFO ] Time to serialize properties into /tmp/LTL4966811985528475922.ltl : 35 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/LTL13838081979801278555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4966811985528475922.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X("(((((((((((((((u10.pred_holding_10>=1)&&(u66.pred_clear_66>=1))||((u8.pred_clear_8>=1)&&(u28.pred_holding_28>=1)))||(((u15....282135
Formula 0 simplified : XX(X!"(((((((((((((((u10.pred_holding_10>=1)&&(u66.pred_clear_66>=1))||((u8.pred_clear_8>=1)&&(u28.pred_holding_28>=1)))||(((u15.pre...282125
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5948765122832139175
[2024-06-07 20:17:57] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5948765122832139175
Running compilation step : cd /tmp/ltsmin5948765122832139175;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5948765122832139175;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5948765122832139175;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BlocksWorld-PT-14-LTLFireability-07 finished in 381923 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))&&F(p1))))'
Support contains 4 out of 5398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 2693 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:18:02] [INFO ] Computed 145 invariants in 64 ms
[2024-06-07 20:18:07] [INFO ] Implicit Places using invariants in 4417 ms returned []
Implicit Place search using SMT only with invariants took 4417 ms to find 0 implicit places.
[2024-06-07 20:18:07] [INFO ] Invariant cache hit.
[2024-06-07 20:18:13] [INFO ] Dead Transitions using invariants and state equation in 6744 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Graph (complete) has 30827 edges and 5398 vertex of which 5396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2728 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:18:16] [INFO ] Computed 145 invariants in 59 ms
[2024-06-07 20:18:21] [INFO ] Implicit Places using invariants in 4282 ms returned []
Implicit Place search using SMT only with invariants took 4283 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20882 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s106 1) (LT s2759 1)), p1:(GEQ s48 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 70 reset in 9348 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 9 in 2 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-08 finished in 30408 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 1 out of 5398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 489 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:18:31] [INFO ] Computed 145 invariants in 61 ms
[2024-06-07 20:18:35] [INFO ] Implicit Places using invariants in 4519 ms returned []
Implicit Place search using SMT only with invariants took 4520 ms to find 0 implicit places.
[2024-06-07 20:18:35] [INFO ] Invariant cache hit.
[2024-06-07 20:18:41] [INFO ] Dead Transitions using invariants and state equation in 6097 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5396 transition count 10503
Applied a total of 2 rules in 496 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:18:42] [INFO ] Computed 145 invariants in 61 ms
[2024-06-07 20:18:46] [INFO ] Implicit Places using invariants in 4070 ms returned []
Implicit Place search using SMT only with invariants took 4073 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15676 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s129 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 301 reset in 9516 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-10 finished in 25357 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 U G((!p0&&X(!p1))))))'
Support contains 69 out of 5398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 505 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:18:56] [INFO ] Computed 145 invariants in 63 ms
[2024-06-07 20:19:00] [INFO ] Implicit Places using invariants in 3887 ms returned []
Implicit Place search using SMT only with invariants took 3889 ms to find 0 implicit places.
[2024-06-07 20:19:00] [INFO ] Invariant cache hit.
[2024-06-07 20:19:06] [INFO ] Dead Transitions using invariants and state equation in 6228 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5396 transition count 10503
Applied a total of 2 rules in 582 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:19:07] [INFO ] Computed 145 invariants in 64 ms
[2024-06-07 20:19:10] [INFO ] Implicit Places using invariants in 3890 ms returned []
Implicit Place search using SMT only with invariants took 3891 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15096 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s52 1) (GEQ s1451 1)), p1:(AND (GEQ s284 1) (GEQ s303 1) (GEQ s386 1) (GEQ s457 1) (GEQ s613 1) (GEQ s661 1) (GEQ s760 1) (GEQ s86...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12820 steps with 0 reset in 1226 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-11 finished in 16686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 68 out of 5398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 502 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:19:13] [INFO ] Computed 145 invariants in 66 ms
[2024-06-07 20:19:17] [INFO ] Implicit Places using invariants in 4173 ms returned []
Implicit Place search using SMT only with invariants took 4174 ms to find 0 implicit places.
[2024-06-07 20:19:17] [INFO ] Invariant cache hit.
[2024-06-07 20:19:23] [INFO ] Dead Transitions using invariants and state equation in 6286 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5396 transition count 10503
Applied a total of 2 rules in 520 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:19:24] [INFO ] Computed 145 invariants in 65 ms
[2024-06-07 20:19:28] [INFO ] Implicit Places using invariants in 3950 ms returned []
Implicit Place search using SMT only with invariants took 3971 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15471 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s138 1), p0:(OR (GEQ s171 1) (AND (GEQ s284 1) (GEQ s303 1) (GEQ s386 1) (GEQ s457 1) (GEQ s613 1) (GEQ s661 1) (GEQ s760 1) (GEQ s860 1) (GEQ s87...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 436 reset in 9176 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-12 finished in 24789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 66 out of 5398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 2526 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:19:39] [INFO ] Computed 145 invariants in 70 ms
[2024-06-07 20:19:43] [INFO ] Implicit Places using invariants in 3971 ms returned []
Implicit Place search using SMT only with invariants took 3981 ms to find 0 implicit places.
[2024-06-07 20:19:43] [INFO ] Invariant cache hit.
[2024-06-07 20:19:49] [INFO ] Dead Transitions using invariants and state equation in 6111 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Graph (complete) has 30827 edges and 5398 vertex of which 5396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2554 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:19:52] [INFO ] Computed 145 invariants in 61 ms
[2024-06-07 20:19:56] [INFO ] Implicit Places using invariants in 3958 ms returned []
Implicit Place search using SMT only with invariants took 3976 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19166 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s284 1) (GEQ s303 1) (GEQ s386 1) (GEQ s457 1) (GEQ s613 1) (GEQ s661 1) (GEQ s760 1) (GEQ s860 1) (GEQ s878 1) (GEQ s953 1) (GEQ s1018 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 99960 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-13 finished in 29247 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(p1))))'
Support contains 4 out of 5398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 2487 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:20:09] [INFO ] Computed 145 invariants in 59 ms
[2024-06-07 20:20:13] [INFO ] Implicit Places using invariants in 4030 ms returned []
Implicit Place search using SMT only with invariants took 4050 ms to find 0 implicit places.
[2024-06-07 20:20:13] [INFO ] Invariant cache hit.
[2024-06-07 20:20:19] [INFO ] Dead Transitions using invariants and state equation in 5983 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Graph (complete) has 30827 edges and 5398 vertex of which 5396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2771 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:20:21] [INFO ] Computed 145 invariants in 60 ms
[2024-06-07 20:20:26] [INFO ] Implicit Places using invariants in 4149 ms returned []
Implicit Place search using SMT only with invariants took 4159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19457 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s43 1) (LT s198 1)), p1:(OR (LT s108 1) (LT s136 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 96830 steps with 0 reset in 10001 ms.
Product exploration timeout after 95880 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1187 ms. (steps per millisecond=8 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-07 20:20:47] [INFO ] Invariant cache hit.
[2024-06-07 20:20:48] [INFO ] [Real]Absence check using 145 positive place invariants in 132 ms returned sat
[2024-06-07 20:20:55] [INFO ] After 7373ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-06-07 20:20:55] [INFO ] [Nat]Absence check using 145 positive place invariants in 135 ms returned sat
[2024-06-07 20:21:02] [INFO ] After 6450ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-07 20:21:02] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-06-07 20:21:04] [INFO ] After 2622ms SMT Verify possible using 125 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-06-07 20:21:05] [INFO ] After 3339ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 460 ms.
[2024-06-07 20:21:06] [INFO ] After 10958ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 5396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5396/5396 places, 10503/10503 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 5396 transition count 10502
Applied a total of 1 rules in 96853 ms. Remains 5396 /5396 variables (removed 0) and now considering 10502/10503 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96853 ms. Remains : 5396/5396 places, 10502/10503 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 162 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 5396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5396/5396 places, 10503/10503 transitions.
Applied a total of 0 rules in 2611 ms. Remains 5396 /5396 variables (removed 0) and now considering 10503/10503 (removed 0) transitions.
[2024-06-07 20:22:45] [INFO ] Invariant cache hit.
[2024-06-07 20:22:49] [INFO ] Implicit Places using invariants in 4072 ms returned []
Implicit Place search using SMT only with invariants took 4088 ms to find 0 implicit places.
[2024-06-07 20:22:50] [INFO ] Invariant cache hit.
[2024-06-07 20:22:56] [INFO ] Dead Transitions using invariants and state equation in 6151 ms found 6 transitions.
Found 6 dead transitions using SMT.
Drop transitions removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5396/5396 places, 10497/10503 transitions.
Graph (complete) has 30812 edges and 5396 vertex of which 5393 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2703 ms. Remains 5393 /5396 variables (removed 3) and now considering 10497/10497 (removed 0) transitions.
// Phase 1: matrix 10497 rows 5393 cols
[2024-06-07 20:22:58] [INFO ] Computed 145 invariants in 61 ms
[2024-06-07 20:23:03] [INFO ] Implicit Places using invariants in 4352 ms returned []
Implicit Place search using SMT only with invariants took 4353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5393/5396 places, 10497/10503 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19908 ms. Remains : 5393/5396 places, 10497/10503 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1137 ms. (steps per millisecond=8 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-07 20:23:04] [INFO ] Invariant cache hit.
[2024-06-07 20:23:05] [INFO ] [Real]Absence check using 145 positive place invariants in 127 ms returned sat
[2024-06-07 20:23:05] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-06-07 20:23:06] [INFO ] [Nat]Absence check using 145 positive place invariants in 132 ms returned sat
[2024-06-07 20:23:12] [INFO ] After 6535ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-07 20:23:12] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-07 20:23:16] [INFO ] After 3119ms SMT Verify possible using 119 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-06-07 20:23:16] [INFO ] After 3762ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 472 ms.
[2024-06-07 20:23:17] [INFO ] After 11470ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 139 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 23 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 322 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration timeout after 98360 steps with 0 reset in 10001 ms.
Product exploration timeout after 96810 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin4552278917073827951
[2024-06-07 20:23:37] [INFO ] Too many transitions (10497) to apply POR reductions. Disabling POR matrices.
[2024-06-07 20:23:37] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4552278917073827951
Running compilation step : cd /tmp/ltsmin4552278917073827951;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4552278917073827951;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4552278917073827951;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5393/5393 places, 10497/10497 transitions.
Applied a total of 0 rules in 2494 ms. Remains 5393 /5393 variables (removed 0) and now considering 10497/10497 (removed 0) transitions.
[2024-06-07 20:23:43] [INFO ] Invariant cache hit.
[2024-06-07 20:23:47] [INFO ] Implicit Places using invariants in 4109 ms returned []
Implicit Place search using SMT only with invariants took 4111 ms to find 0 implicit places.
[2024-06-07 20:23:47] [INFO ] Invariant cache hit.
[2024-06-07 20:23:54] [INFO ] Dead Transitions using invariants and state equation in 6661 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5393/5393 places, 10495/10497 transitions.
Graph (complete) has 30807 edges and 5393 vertex of which 5392 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2569 ms. Remains 5392 /5393 variables (removed 1) and now considering 10495/10495 (removed 0) transitions.
// Phase 1: matrix 10495 rows 5392 cols
[2024-06-07 20:23:56] [INFO ] Computed 145 invariants in 58 ms
[2024-06-07 20:24:00] [INFO ] Implicit Places using invariants in 4049 ms returned []
Implicit Place search using SMT only with invariants took 4050 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5392/5393 places, 10495/10497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19889 ms. Remains : 5392/5393 places, 10495/10497 transitions.
Built C files in :
/tmp/ltsmin11568246043601325197
[2024-06-07 20:24:00] [INFO ] Too many transitions (10495) to apply POR reductions. Disabling POR matrices.
[2024-06-07 20:24:00] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11568246043601325197
Running compilation step : cd /tmp/ltsmin11568246043601325197;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11568246043601325197;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11568246043601325197;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 20:24:04] [INFO ] Flatten gal took : 329 ms
[2024-06-07 20:24:05] [INFO ] Flatten gal took : 331 ms
[2024-06-07 20:24:05] [INFO ] Time to serialize gal into /tmp/LTL6858861057079336731.gal : 58 ms
[2024-06-07 20:24:05] [INFO ] Time to serialize properties into /tmp/LTL17273335581029085044.prop : 3 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/LTL6858861057079336731.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8372042445030477529.hoa' '-atoms' '/tmp/LTL17273335581029085044.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...318
Loading property file /tmp/LTL17273335581029085044.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8372042445030477529.hoa
Detected timeout of ITS tools.
[2024-06-07 20:24:21] [INFO ] Flatten gal took : 427 ms
[2024-06-07 20:24:21] [INFO ] Flatten gal took : 334 ms
[2024-06-07 20:24:21] [INFO ] Time to serialize gal into /tmp/LTL5233056989295385126.gal : 93 ms
[2024-06-07 20:24:21] [INFO ] Time to serialize properties into /tmp/LTL15651443341389851237.ltl : 0 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/LTL5233056989295385126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15651443341389851237.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 : !((F((G("((pred_clear_14<1)||(pred_holding_65<1))"))||(G("((pred_holding_35<1)||(pred_clear_45<1))")))))
Formula 0 simplified : G(F!"((pred_clear_14<1)||(pred_holding_65<1))" & F!"((pred_holding_35<1)||(pred_clear_45<1))")
Detected timeout of ITS tools.
[2024-06-07 20:24:36] [INFO ] Flatten gal took : 325 ms
[2024-06-07 20:24:36] [INFO ] Applying decomposition
[2024-06-07 20:24:37] [INFO ] Flatten gal took : 404 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/graph10782898832955137017.txt' '-o' '/tmp/graph10782898832955137017.bin' '-w' '/tmp/graph10782898832955137017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10782898832955137017.bin' '-l' '-1' '-v' '-w' '/tmp/graph10782898832955137017.weights' '-q' '0' '-e' '0.001'
[2024-06-07 20:24:38] [INFO ] Decomposing Gal with order
[2024-06-07 20:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 20:24:39] [INFO ] Removed a total of 20142 redundant transitions.
[2024-06-07 20:24:39] [INFO ] Flatten gal took : 1168 ms
[2024-06-07 20:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 702 labels/synchronizations in 196 ms.
[2024-06-07 20:24:40] [INFO ] Time to serialize gal into /tmp/LTL11829416465221932589.gal : 68 ms
[2024-06-07 20:24:40] [INFO ] Time to serialize properties into /tmp/LTL17735494250588492107.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/LTL11829416465221932589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17735494250588492107.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 : !((F((G("((u14.pred_clear_14<1)||(u65.pred_holding_65<1))"))||(G("((u35.pred_holding_35<1)||(u45.pred_clear_45<1))")))))
Formula 0 simplified : G(F!"((u14.pred_clear_14<1)||(u65.pred_holding_65<1))" & F!"((u35.pred_holding_35<1)||(u45.pred_clear_45<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6121488315271256204
[2024-06-07 20:24:55] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6121488315271256204
Running compilation step : cd /tmp/ltsmin6121488315271256204;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6121488315271256204;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6121488315271256204;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BlocksWorld-PT-14-LTLFireability-14 finished in 291681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 5398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5398/5398 places, 10507/10507 transitions.
Applied a total of 0 rules in 2654 ms. Remains 5398 /5398 variables (removed 0) and now considering 10507/10507 (removed 0) transitions.
// Phase 1: matrix 10507 rows 5398 cols
[2024-06-07 20:25:01] [INFO ] Computed 145 invariants in 62 ms
[2024-06-07 20:25:04] [INFO ] Implicit Places using invariants in 3874 ms returned []
Implicit Place search using SMT only with invariants took 3874 ms to find 0 implicit places.
[2024-06-07 20:25:04] [INFO ] Invariant cache hit.
[2024-06-07 20:25:11] [INFO ] Dead Transitions using invariants and state equation in 6348 ms found 4 transitions.
Found 4 dead transitions using SMT.
Drop transitions removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 5398/5398 places, 10503/10507 transitions.
Graph (complete) has 30827 edges and 5398 vertex of which 5396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2735 ms. Remains 5396 /5398 variables (removed 2) and now considering 10503/10503 (removed 0) transitions.
// Phase 1: matrix 10503 rows 5396 cols
[2024-06-07 20:25:14] [INFO ] Computed 145 invariants in 62 ms
[2024-06-07 20:25:18] [INFO ] Implicit Places using invariants in 4236 ms returned []
Implicit Place search using SMT only with invariants took 4236 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5396/5398 places, 10503/10507 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19847 ms. Remains : 5396/5398 places, 10503/10507 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-14-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s199 1) (LT s200 1)), p1:(GEQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 93220 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-14-LTLFireability-15 finished in 30064 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((X(p0)||G(!p1)))))'
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(p1))))'
[2024-06-07 20:25:28] [INFO ] Flatten gal took : 402 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13625728077347466229
[2024-06-07 20:25:29] [INFO ] Too many transitions (10507) to apply POR reductions. Disabling POR matrices.
[2024-06-07 20:25:29] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13625728077347466229
Running compilation step : cd /tmp/ltsmin13625728077347466229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
[2024-06-07 20:25:29] [INFO ] Applying decomposition
[2024-06-07 20:25:29] [INFO ] Flatten gal took : 376 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/graph18285016733659406409.txt' '-o' '/tmp/graph18285016733659406409.bin' '-w' '/tmp/graph18285016733659406409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18285016733659406409.bin' '-l' '-1' '-v' '-w' '/tmp/graph18285016733659406409.weights' '-q' '0' '-e' '0.001'
[2024-06-07 20:25:30] [INFO ] Decomposing Gal with order
[2024-06-07 20:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 20:25:32] [INFO ] Removed a total of 20152 redundant transitions.
[2024-06-07 20:25:32] [INFO ] Flatten gal took : 1222 ms
[2024-06-07 20:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 199 ms.
[2024-06-07 20:25:32] [INFO ] Time to serialize gal into /tmp/LTLFireability3671561778949081082.gal : 68 ms
[2024-06-07 20:25:32] [INFO ] Time to serialize properties into /tmp/LTLFireability15328487456788674464.ltl : 14 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/LTLFireability3671561778949081082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15328487456788674464.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...277
Read 2 LTL properties
Checking formula 0 : !((X(X((X("(((((((((((((((i41.u10.pred_holding_10>=1)&&(u66.pred_clear_66>=1))||((u8.pred_clear_8>=1)&&(u28.pred_holding_28>=1)))||(((...282211
Formula 0 simplified : XX(X!"(((((((((((((((i41.u10.pred_holding_10>=1)&&(u66.pred_clear_66>=1))||((u8.pred_clear_8>=1)&&(u28.pred_holding_28>=1)))||(((u15...282197
Compilation finished in 68182 ms.
Running link step : cd /tmp/ltsmin13625728077347466229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 108 ms.
Running LTSmin : cd /tmp/ltsmin13625728077347466229;'/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' 'X(X((X((LTLAPp0==true))||[](!(LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 12088 ms.
FORMULA BlocksWorld-PT-14-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13625728077347466229;'/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' '<>(([]((LTLAPp2==true))||[]((LTLAPp3==true))))' '--buchi-type=spotba'

BK_STOP 1717792123607

--------------------
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-14"
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-14, 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-171774435600168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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