fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016100044
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Peterson-COL-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.111 3600000.00 13643154.00 6403.80 FFFTFFFFFFFT?FFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016100044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.8K Apr 30 10:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 10:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 47K May 10 09:34 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 Peterson-COL-7-LTLFireability-00
FORMULA_NAME Peterson-COL-7-LTLFireability-01
FORMULA_NAME Peterson-COL-7-LTLFireability-02
FORMULA_NAME Peterson-COL-7-LTLFireability-03
FORMULA_NAME Peterson-COL-7-LTLFireability-04
FORMULA_NAME Peterson-COL-7-LTLFireability-05
FORMULA_NAME Peterson-COL-7-LTLFireability-06
FORMULA_NAME Peterson-COL-7-LTLFireability-07
FORMULA_NAME Peterson-COL-7-LTLFireability-08
FORMULA_NAME Peterson-COL-7-LTLFireability-09
FORMULA_NAME Peterson-COL-7-LTLFireability-10
FORMULA_NAME Peterson-COL-7-LTLFireability-11
FORMULA_NAME Peterson-COL-7-LTLFireability-12
FORMULA_NAME Peterson-COL-7-LTLFireability-13
FORMULA_NAME Peterson-COL-7-LTLFireability-14
FORMULA_NAME Peterson-COL-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652778764843

Running Version 202205111006
[2022-05-17 09:12:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 09:12:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:12:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 09:12:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 09:12:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2022-05-17 09:12:46] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 09:12:46] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2022-05-17 09:12:46] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 3253 steps, including 0 resets, run visited all 12 properties in 31 ms. (steps per millisecond=104 )
[2022-05-17 09:12:46] [INFO ] Flatten gal took : 24 ms
[2022-05-17 09:12:46] [INFO ] Flatten gal took : 2 ms
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 09:12:46] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 45 ms.
[2022-05-17 09:12:46] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 56 places in 21 ms
Reduce places removed 56 places and 112 transitions.
FORMULA Peterson-COL-7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1600 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 69 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:12:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:12:47] [INFO ] Computed 31 place invariants in 42 ms
[2022-05-17 09:12:47] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-05-17 09:12:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:12:47] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-17 09:12:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:12:48] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2022-05-17 09:12:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:12:48] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-17 09:12:50] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1600 out of 1992 places after structural reductions.
[2022-05-17 09:12:50] [INFO ] Flatten gal took : 202 ms
[2022-05-17 09:12:51] [INFO ] Flatten gal took : 180 ms
[2022-05-17 09:12:51] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:12:52] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:12:52] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-17 09:12:52] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2022-05-17 09:12:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 26 ms returned sat
[2022-05-17 09:12:52] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:12:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 09:12:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2022-05-17 09:12:53] [INFO ] After 912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:12:53] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:12:54] [INFO ] After 198ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:12:54] [INFO ] Deduced a trap composed of 60 places in 764 ms of which 9 ms to minimize.
[2022-05-17 09:12:55] [INFO ] Deduced a trap composed of 13 places in 695 ms of which 2 ms to minimize.
[2022-05-17 09:12:56] [INFO ] Deduced a trap composed of 49 places in 675 ms of which 2 ms to minimize.
[2022-05-17 09:12:57] [INFO ] Deduced a trap composed of 49 places in 703 ms of which 2 ms to minimize.
[2022-05-17 09:12:58] [INFO ] Deduced a trap composed of 49 places in 719 ms of which 1 ms to minimize.
[2022-05-17 09:12:59] [INFO ] Deduced a trap composed of 58 places in 862 ms of which 1 ms to minimize.
[2022-05-17 09:13:00] [INFO ] Deduced a trap composed of 138 places in 873 ms of which 2 ms to minimize.
[2022-05-17 09:13:01] [INFO ] Deduced a trap composed of 157 places in 883 ms of which 1 ms to minimize.
[2022-05-17 09:13:02] [INFO ] Deduced a trap composed of 167 places in 877 ms of which 2 ms to minimize.
[2022-05-17 09:13:03] [INFO ] Deduced a trap composed of 115 places in 832 ms of which 2 ms to minimize.
[2022-05-17 09:13:04] [INFO ] Deduced a trap composed of 142 places in 830 ms of which 1 ms to minimize.
[2022-05-17 09:13:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 10320 ms
[2022-05-17 09:13:04] [INFO ] After 10663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-17 09:13:04] [INFO ] After 12048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 56 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 455 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 455 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1759
Deduced a syphon composed of 455 places in 1 ms
Reduce places removed 455 places and 0 transitions.
Iterating global reduction 2 with 910 rules applied. Total rules applied 2674 place count 655 transition count 1759
Applied a total of 2674 rules in 241 ms. Remains 655 /1992 variables (removed 1337) and now considering 1759/3096 (removed 1337) transitions.
Finished structural reductions, in 1 iterations. Remains : 655/1992 places, 1759/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 97 steps, run visited all 1 properties in 6 ms. (steps per millisecond=16 )
Probabilistic random walk after 97 steps, saw 89 distinct states, run finished after 7 ms. (steps per millisecond=13 ) properties seen :1
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(G(F(G(p0)))) U ((p2 U p0)||p1))))'
Support contains 560 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 39 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:05] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-17 09:13:05] [INFO ] Implicit Places using invariants in 468 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 471 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 37 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR p0 p1), (OR p0 p1), true, p0, p0, p0]
Running random walk in product with property : Peterson-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s80 1)) (AND (GEQ s32 1) (GEQ s94 1)) (AND (GEQ s64 1) (GEQ s120 1)) (AND (GEQ s48 1) (GEQ s107 1)) (AND (GEQ s62 1) (GEQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Peterson-COL-7-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-00 finished in 942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(X(p1) U p1)||p0))))'
Support contains 520 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 37 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:06] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-17 09:13:06] [INFO ] Implicit Places using invariants in 550 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 553 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 49 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s690 1)) (AND (GEQ s9 1) (GEQ s692 1)) (AND (GEQ s13 1) (GEQ s694 1)) (AND (GEQ s15 1) (GEQ s695 1)) (AND (GEQ s7 1) (GEQ s691...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2544 steps with 0 reset in 74 ms.
FORMULA Peterson-COL-7-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-01 finished in 855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||G(X(G(p1)))))))'
Support contains 160 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 57 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:07] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-17 09:13:07] [INFO ] Implicit Places using invariants in 492 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 495 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 60 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (AND (GEQ s31 1) (GEQ s80 1)) (AND (GEQ s32 1) (GEQ s94 1)) (AND (GEQ s64 1) (GEQ s120 1)) (AND (GEQ s48 1) (GEQ s107 1)) (AND (GEQ s62 1) (GEQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 3 ms.
FORMULA Peterson-COL-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-02 finished in 833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1)))&&F(X(((p1 U F(p1))||p2)))))'
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 2592
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 1 with 504 rules applied. Total rules applied 1008 place count 1488 transition count 2592
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1008 place count 1488 transition count 2144
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 1904 place count 1040 transition count 2144
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2016 place count 984 transition count 2088
Applied a total of 2016 rules in 164 ms. Remains 984 /1992 variables (removed 1008) and now considering 2088/3096 (removed 1008) transitions.
[2022-05-17 09:13:08] [INFO ] Flow matrix only has 1752 transitions (discarded 336 similar events)
// Phase 1: matrix 1752 rows 984 cols
[2022-05-17 09:13:08] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-17 09:13:08] [INFO ] Implicit Places using invariants in 167 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 169 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1992 places, 2088/3096 transitions.
Applied a total of 0 rules in 35 ms. Remains 976 /976 variables (removed 0) and now considering 2088/2088 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 976/1992 places, 2088/3096 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s283 1)) (AND (GEQ s0 1) (GEQ s430 1)) (AND (GEQ s4 1) (GEQ s593 1)) (AND (GEQ s8 1) (GEQ s300 1)) (AND (GEQ s10 1) (GEQ s610 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 8414 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 6 ms.
FORMULA Peterson-COL-7-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-04 finished in 8892 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U G((F(p2)||(p0 U p3))))))'
Support contains 192 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1815
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 2562 place count 711 transition count 1815
Applied a total of 2562 rules in 116 ms. Remains 711 /1992 variables (removed 1281) and now considering 1815/3096 (removed 1281) transitions.
[2022-05-17 09:13:17] [INFO ] Flow matrix only has 1479 transitions (discarded 336 similar events)
// Phase 1: matrix 1479 rows 711 cols
[2022-05-17 09:13:17] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-17 09:13:17] [INFO ] Implicit Places using invariants in 268 ms returned []
[2022-05-17 09:13:17] [INFO ] Flow matrix only has 1479 transitions (discarded 336 similar events)
// Phase 1: matrix 1479 rows 711 cols
[2022-05-17 09:13:17] [INFO ] Computed 31 place invariants in 4 ms
[2022-05-17 09:13:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:13:20] [INFO ] Implicit Places using invariants and state equation in 2972 ms returned []
Implicit Place search using SMT with State Equation took 3246 ms to find 0 implicit places.
[2022-05-17 09:13:20] [INFO ] Redundant transitions in 103 ms returned []
[2022-05-17 09:13:20] [INFO ] Flow matrix only has 1479 transitions (discarded 336 similar events)
// Phase 1: matrix 1479 rows 711 cols
[2022-05-17 09:13:20] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-17 09:13:20] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 711/1992 places, 1815/3096 transitions.
Finished structural reductions, in 1 iterations. Remains : 711/1992 places, 1815/3096 transitions.
Stuttering acceptance computed with spot in 589 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p0 p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1))), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p2) p0)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s40 1) (GEQ s102 1)) (AND (GEQ s72 1) (GEQ s128 1)) (AND (GEQ s56 1) (GEQ s115 1)) (AND (GEQ s70 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 369 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 5 ms.
FORMULA Peterson-COL-7-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-05 finished in 5057 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(G(p2)&&p1))))'
Support contains 184 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1767
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2658 place count 663 transition count 1767
Applied a total of 2658 rules in 96 ms. Remains 663 /1992 variables (removed 1329) and now considering 1767/3096 (removed 1329) transitions.
[2022-05-17 09:13:22] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
// Phase 1: matrix 1431 rows 663 cols
[2022-05-17 09:13:22] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-17 09:13:22] [INFO ] Implicit Places using invariants in 258 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 261 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 655/1992 places, 1767/3096 transitions.
Applied a total of 0 rules in 24 ms. Remains 655 /655 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 655/1992 places, 1767/3096 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s5 1) (GEQ s250 1)) (AND (GEQ s9 1) (GEQ s252 1)) (AND (GEQ s13 1) (GEQ s254 1)) (AND (GEQ s15 1) (GEQ s255 1)) (AND (GEQ s7 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 504 reset in 638 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Peterson-COL-7-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-06 finished in 1119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G((X(p0)||(p0 U p1))))))))'
Support contains 160 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 59 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:23] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-17 09:13:23] [INFO ] Implicit Places using invariants in 488 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 490 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 51 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s31 1) (GEQ s80 1)) (AND (GEQ s32 1) (GEQ s94 1)) (AND (GEQ s64 1) (GEQ s120 1)) (AND (GEQ s48 1) (GEQ s107 1)) (AND (GEQ s62 1) (GEQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5316 ms.
Stack based approach found an accepted trace after 809 steps with 0 reset with depth 810 and stack size 810 in 39 ms.
FORMULA Peterson-COL-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-7-LTLFireability-07 finished in 6104 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(G(p2)))))'
Support contains 424 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 45 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:29] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 09:13:29] [INFO ] Implicit Places using invariants in 520 ms returned []
[2022-05-17 09:13:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:29] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 09:13:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:13:42] [INFO ] Implicit Places using invariants and state equation in 12287 ms returned []
Implicit Place search using SMT with State Equation took 12809 ms to find 0 implicit places.
[2022-05-17 09:13:42] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:42] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-17 09:13:43] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s13 1) (GEQ s698 1)) (AND (GEQ s17 1) (GEQ s700 1)) (AND (GEQ s21 1) (GEQ s702 1)) (AND (GEQ s23 1) (GEQ s703 1)) (AND (GEQ s15 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-09 finished in 14369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X((X(p1)||G(p2)||p0))))))'
Support contains 560 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 52 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:43] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-17 09:13:43] [INFO ] Implicit Places using invariants in 294 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 299 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(AND (OR (LT s125 1) (LT s162 1)) (OR (LT s79 1) (LT s135 1)) (OR (LT s122 1) (LT s169 1)) (OR (LT s123 1) (LT s183 1)) (OR (LT s116 1) (LT s182 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-10 finished in 704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 504 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 38 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:13:44] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:13:44] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-17 09:13:44] [INFO ] Implicit Places using invariants in 495 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 498 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 34 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-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:(OR (GEQ s1098 1) (GEQ s838 1) (GEQ s903 1) (GEQ s708 1) (GEQ s773 1) (GEQ s952 1) (GEQ s1017 1) (GEQ s789 1) (GEQ s919 1) (GEQ s1082 1) (GEQ s854 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, null][false, false, false]]
Product exploration explored 100000 steps with 5039 reset in 1523 ms.
Product exploration explored 100000 steps with 4995 reset in 1559 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 (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 656 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2022-05-17 09:13:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:13:49] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 09:13:51] [INFO ] [Real]Absence check using 23 positive place invariants in 67 ms returned sat
[2022-05-17 09:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:03] [INFO ] [Real]Absence check using state equation in 11482 ms returned sat
[2022-05-17 09:14:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 57 ms returned sat
[2022-05-17 09:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 8725 ms returned sat
[2022-05-17 09:14:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:14:15] [INFO ] [Nat]Added 497 Read/Feed constraints in 596 ms returned sat
[2022-05-17 09:14:16] [INFO ] Deduced a trap composed of 18 places in 1073 ms of which 1 ms to minimize.
[2022-05-17 09:14:17] [INFO ] Deduced a trap composed of 108 places in 922 ms of which 2 ms to minimize.
[2022-05-17 09:14:19] [INFO ] Deduced a trap composed of 61 places in 976 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 392 out of 1984 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1984 transition count 2935
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1823 transition count 2935
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 322 place count 1823 transition count 2536
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1120 place count 1424 transition count 2536
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1232 place count 1368 transition count 2480
Applied a total of 1232 rules in 125 ms. Remains 1368 /1984 variables (removed 616) and now considering 2480/3096 (removed 616) transitions.
[2022-05-17 09:14:19] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:14:19] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:14:19] [INFO ] Implicit Places using invariants in 351 ms returned []
[2022-05-17 09:14:19] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:14:19] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:14:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:14:26] [INFO ] Implicit Places using invariants and state equation in 6368 ms returned []
Implicit Place search using SMT with State Equation took 6720 ms to find 0 implicit places.
[2022-05-17 09:14:26] [INFO ] Redundant transitions in 160 ms returned []
[2022-05-17 09:14:26] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:14:26] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:14:27] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1368/1984 places, 2480/3096 transitions.
Finished structural reductions, in 1 iterations. Remains : 1368/1984 places, 2480/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
[2022-05-17 09:14:27] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:14:27] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 09:14:30] [INFO ] [Real]Absence check using 23 positive place invariants in 60 ms returned sat
[2022-05-17 09:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:34] [INFO ] [Real]Absence check using state equation in 4715 ms returned sat
[2022-05-17 09:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-05-17 09:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:41] [INFO ] [Nat]Absence check using state equation in 3563 ms returned sat
[2022-05-17 09:14:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:14:41] [INFO ] [Nat]Added 497 Read/Feed constraints in 364 ms returned sat
[2022-05-17 09:14:42] [INFO ] Deduced a trap composed of 102 places in 484 ms of which 1 ms to minimize.
[2022-05-17 09:14:42] [INFO ] Deduced a trap composed of 34 places in 455 ms of which 1 ms to minimize.
[2022-05-17 09:14:43] [INFO ] Deduced a trap composed of 177 places in 451 ms of which 1 ms to minimize.
[2022-05-17 09:14:43] [INFO ] Deduced a trap composed of 16 places in 542 ms of which 1 ms to minimize.
[2022-05-17 09:14:44] [INFO ] Deduced a trap composed of 36 places in 532 ms of which 1 ms to minimize.
[2022-05-17 09:14:45] [INFO ] Deduced a trap composed of 39 places in 565 ms of which 1 ms to minimize.
[2022-05-17 09:14:45] [INFO ] Deduced a trap composed of 17 places in 531 ms of which 1 ms to minimize.
[2022-05-17 09:14:46] [INFO ] Deduced a trap composed of 46 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:14:47] [INFO ] Deduced a trap composed of 42 places in 540 ms of which 1 ms to minimize.
[2022-05-17 09:14:47] [INFO ] Deduced a trap composed of 46 places in 534 ms of which 1 ms to minimize.
[2022-05-17 09:14:48] [INFO ] Deduced a trap composed of 109 places in 529 ms of which 1 ms to minimize.
[2022-05-17 09:14:49] [INFO ] Deduced a trap composed of 32 places in 547 ms of which 1 ms to minimize.
[2022-05-17 09:14:49] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:14:50] [INFO ] Deduced a trap composed of 69 places in 482 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5575 reset in 1434 ms.
Product exploration explored 100000 steps with 5481 reset in 1434 ms.
Built C files in :
/tmp/ltsmin10931424189960937425
[2022-05-17 09:14:53] [INFO ] Too many transitions (2480) to apply POR reductions. Disabling POR matrices.
[2022-05-17 09:14:53] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10931424189960937425
Running compilation step : cd /tmp/ltsmin10931424189960937425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10931424189960937425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10931424189960937425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 392 out of 1368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1368/1368 places, 2480/2480 transitions.
Applied a total of 0 rules in 37 ms. Remains 1368 /1368 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2022-05-17 09:14:56] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:14:56] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:14:56] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-05-17 09:14:56] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:14:56] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:14:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:15:04] [INFO ] Implicit Places using invariants and state equation in 7688 ms returned []
Implicit Place search using SMT with State Equation took 8093 ms to find 0 implicit places.
[2022-05-17 09:15:04] [INFO ] Redundant transitions in 65 ms returned []
[2022-05-17 09:15:04] [INFO ] Flow matrix only has 2144 transitions (discarded 336 similar events)
// Phase 1: matrix 2144 rows 1368 cols
[2022-05-17 09:15:04] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:15:05] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1368/1368 places, 2480/2480 transitions.
Built C files in :
/tmp/ltsmin6410166587029671234
[2022-05-17 09:15:05] [INFO ] Too many transitions (2480) to apply POR reductions. Disabling POR matrices.
[2022-05-17 09:15:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6410166587029671234
Running compilation step : cd /tmp/ltsmin6410166587029671234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6410166587029671234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6410166587029671234;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 09:15:08] [INFO ] Flatten gal took : 73 ms
[2022-05-17 09:15:08] [INFO ] Flatten gal took : 93 ms
[2022-05-17 09:15:08] [INFO ] Time to serialize gal into /tmp/LTL10349121658574554837.gal : 22 ms
[2022-05-17 09:15:08] [INFO ] Time to serialize properties into /tmp/LTL15951706309419837527.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10349121658574554837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15951706309419837527.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1034912...268
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((Turn_53>=1)&&(TestTurn_34>=1))||((Turn_7>=1)&&(TestTurn_7>=1)))||(((Turn_50>=1)&&(TestTurn_41>=1))||((Turn_51>=1)&&(...23711
Formula 0 simplified : !(X"(((((((((((Turn_53>=1)&&(TestTurn_34>=1))||((Turn_7>=1)&&(TestTurn_7>=1)))||(((Turn_50>=1)&&(TestTurn_41>=1))||((Turn_51>=1)&&(T...23704
Detected timeout of ITS tools.
[2022-05-17 09:15:23] [INFO ] Flatten gal took : 63 ms
[2022-05-17 09:15:23] [INFO ] Applying decomposition
[2022-05-17 09:15:24] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18372787887393152599.txt' '-o' '/tmp/graph18372787887393152599.bin' '-w' '/tmp/graph18372787887393152599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18372787887393152599.bin' '-l' '-1' '-v' '-w' '/tmp/graph18372787887393152599.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:15:24] [INFO ] Decomposing Gal with order
[2022-05-17 09:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:15:24] [INFO ] Removed a total of 3272 redundant transitions.
[2022-05-17 09:15:24] [INFO ] Flatten gal took : 184 ms
[2022-05-17 09:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 55 ms.
[2022-05-17 09:15:24] [INFO ] Time to serialize gal into /tmp/LTL10393502022954852860.gal : 18 ms
[2022-05-17 09:15:24] [INFO ] Time to serialize properties into /tmp/LTL4397844601277648505.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10393502022954852860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4397844601277648505.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1039350...246
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((i20.u23.Turn_53>=1)&&(i18.u69.TestTurn_34>=1))||((i1.u28.Turn_7>=1)&&(i1.u10.TestTurn_7>=1)))||(((i15.u58.Turn_50>=1...33173
Formula 0 simplified : !(X"(((((((((((i20.u23.Turn_53>=1)&&(i18.u69.TestTurn_34>=1))||((i1.u28.Turn_7>=1)&&(i1.u10.TestTurn_7>=1)))||(((i15.u58.Turn_50>=1)...33166
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4703379631167203211
[2022-05-17 09:15:39] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4703379631167203211
Running compilation step : cd /tmp/ltsmin4703379631167203211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4703379631167203211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4703379631167203211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Peterson-COL-7-LTLFireability-12 finished in 118593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(X(G(p0)))&&p1)))&&X(p1)))'
Support contains 496 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 36 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:15:42] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:15:42] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-17 09:15:43] [INFO ] Implicit Places using invariants in 599 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 601 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 61 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 3}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s641 1) (GEQ s642 1) (GEQ s640 1) (GEQ s643 1) (GEQ s646 1) (GEQ s647 1) (GEQ s644 1) (GEQ s633 1) (GEQ s632 1) (GEQ s635 1) (GEQ s634 1) (GEQ...], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-13 finished in 987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(!p0 U p0))))'
Support contains 400 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 56 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:15:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:15:43] [INFO ] Computed 31 place invariants in 30 ms
[2022-05-17 09:15:44] [INFO ] Implicit Places using invariants in 404 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 407 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 50 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Running random walk in product with property : Peterson-COL-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s1179 1)) (AND (GEQ s0 1) (GEQ s1326 1)) (AND (GEQ s4 1) (GEQ s1489 1)) (AND (GEQ s8 1) (GEQ s1196 1)) (AND (GEQ s10 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1851 steps with 0 reset in 74 ms.
FORMULA Peterson-COL-7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-7-LTLFireability-14 finished in 724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((X(p1)||!(p2 U !p1))))&&p0)))'
Support contains 64 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 57 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:15:44] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:15:44] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-17 09:15:45] [INFO ] Implicit Places using invariants in 561 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 568 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 50 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s659 1) (LT s673 1) (LT s645 1) (LT s666 1) (LT s680 1) (LT s687 1) (LT s652 1) (LT s638 1)), p2:(OR (GEQ s704 1) (GEQ s769 1) (GEQ s964 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1530 reset in 633 ms.
Product exploration explored 100000 steps with 1510 reset in 651 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 719 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 09:15:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:15:47] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:15:48] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X p1)), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND p0 p2 p1)), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 15 factoid took 701 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 64 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 53 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:15:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:15:49] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:15:49] [INFO ] Implicit Places using invariants in 500 ms returned []
[2022-05-17 09:15:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:15:49] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:15:50] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:16:02] [INFO ] Implicit Places using invariants and state equation in 13015 ms returned []
Implicit Place search using SMT with State Equation took 13517 ms to find 0 implicit places.
[2022-05-17 09:16:02] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:16:02] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:16:03] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1984/1984 places, 3096/3096 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 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p1 p2))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 342 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 316 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p1 p2))), (X (NOT (OR (NOT p0) (NOT p1)))), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND p2 p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 10 factoid took 515 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1502 reset in 516 ms.
Product exploration explored 100000 steps with 1483 reset in 527 ms.
Built C files in :
/tmp/ltsmin8818610406473263183
[2022-05-17 09:16:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8818610406473263183
Running compilation step : cd /tmp/ltsmin8818610406473263183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin8818610406473263183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin8818610406473263183;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 64 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 58 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 09:16:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:16:09] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 09:16:10] [INFO ] Implicit Places using invariants in 520 ms returned []
[2022-05-17 09:16:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:16:10] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:16:11] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:16:23] [INFO ] Implicit Places using invariants and state equation in 12780 ms returned []
Implicit Place search using SMT with State Equation took 13302 ms to find 0 implicit places.
[2022-05-17 09:16:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2022-05-17 09:16:23] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-17 09:16:24] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1984/1984 places, 3096/3096 transitions.
Built C files in :
/tmp/ltsmin16698453756077080984
[2022-05-17 09:16:24] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16698453756077080984
Running compilation step : cd /tmp/ltsmin16698453756077080984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16698453756077080984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16698453756077080984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 09:16:27] [INFO ] Flatten gal took : 76 ms
[2022-05-17 09:16:27] [INFO ] Flatten gal took : 77 ms
[2022-05-17 09:16:27] [INFO ] Time to serialize gal into /tmp/LTL4136352454092834620.gal : 9 ms
[2022-05-17 09:16:27] [INFO ] Time to serialize properties into /tmp/LTL13438594310208645425.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4136352454092834620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13438594310208645425.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4136352...267
Read 1 LTL properties
Checking formula 0 : !((F(((((X(G((X("((((EndTurn_27<1)&&(EndTurn_41<1))&&((EndTurn_13<1)&&(EndTurn_34<1)))&&(((EndTurn_48<1)&&(EndTurn_55<1))&&((EndTurn_2...1884
Formula 0 simplified : !F("(((EndTurn_34<1)&&(EndTurn_48<1))&&((EndTurn_55<1)&&(EndTurn_20<1)))" & "((EndTurn_41<1)&&(EndTurn_13<1))" & "(EndTurn_6<1)" & "...1861
Detected timeout of ITS tools.
[2022-05-17 09:16:42] [INFO ] Flatten gal took : 70 ms
[2022-05-17 09:16:42] [INFO ] Applying decomposition
[2022-05-17 09:16:42] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12864594370135863104.txt' '-o' '/tmp/graph12864594370135863104.bin' '-w' '/tmp/graph12864594370135863104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12864594370135863104.bin' '-l' '-1' '-v' '-w' '/tmp/graph12864594370135863104.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:16:42] [INFO ] Decomposing Gal with order
[2022-05-17 09:16:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:16:43] [INFO ] Removed a total of 2840 redundant transitions.
[2022-05-17 09:16:43] [INFO ] Flatten gal took : 132 ms
[2022-05-17 09:16:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-17 09:16:43] [INFO ] Time to serialize gal into /tmp/LTL6362552584819759716.gal : 15 ms
[2022-05-17 09:16:43] [INFO ] Time to serialize properties into /tmp/LTL4601342861234718253.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6362552584819759716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4601342861234718253.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6362552...245
Read 1 LTL properties
Checking formula 0 : !((F(((((X(G((X("((((i21.u306.EndTurn_27<1)&&(i21.u314.EndTurn_41<1))&&((i21.u300.EndTurn_13<1)&&(i21.u308.EndTurn_34<1)))&&(((i21.u26...2600
Formula 0 simplified : !F("(((i21.u308.EndTurn_34<1)&&(i21.u26.EndTurn_48<1))&&((i21.u322.EndTurn_55<1)&&(i21.u302.EndTurn_20<1)))" & "((i21.u314.EndTurn_4...2577
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9541941201850928465
[2022-05-17 09:16:58] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9541941201850928465
Running compilation step : cd /tmp/ltsmin9541941201850928465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9541941201850928465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9541941201850928465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Peterson-COL-7-LTLFireability-15 finished in 76968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((X(p1)||!(p2 U !p1))))&&p0)))'
Found a SL insensitive property : Peterson-COL-7-LTLFireability-15
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 64 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 735 transitions
Trivial Post-agglo rules discarded 735 transitions
Performed 735 trivial Post agglomeration. Transition count delta: 735
Iterating post reduction 0 with 735 rules applied. Total rules applied 735 place count 1992 transition count 2361
Reduce places removed 735 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 790 rules applied. Total rules applied 1525 place count 1257 transition count 2306
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 1580 place count 1202 transition count 2306
Performed 440 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 440 Pre rules applied. Total rules applied 1580 place count 1202 transition count 1866
Deduced a syphon composed of 440 places in 0 ms
Reduce places removed 440 places and 0 transitions.
Iterating global reduction 3 with 880 rules applied. Total rules applied 2460 place count 762 transition count 1866
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 2544 place count 720 transition count 1824
Applied a total of 2544 rules in 115 ms. Remains 720 /1992 variables (removed 1272) and now considering 1824/3096 (removed 1272) transitions.
[2022-05-17 09:17:01] [INFO ] Flow matrix only has 1488 transitions (discarded 336 similar events)
// Phase 1: matrix 1488 rows 720 cols
[2022-05-17 09:17:01] [INFO ] Computed 31 place invariants in 4 ms
[2022-05-17 09:17:02] [INFO ] Implicit Places using invariants in 340 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 343 ms to find 8 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 712/1992 places, 1824/3096 transitions.
Applied a total of 0 rules in 17 ms. Remains 712 /712 variables (removed 0) and now considering 1824/1824 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 712/1992 places, 1824/3096 transitions.
Running random walk in product with property : Peterson-COL-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s219 1) (LT s233 1) (LT s205 1) (LT s226 1) (LT s240 1) (LT s247 1) (LT s212 1) (LT s198 1)), p2:(OR (GEQ s257 1) (GEQ s265 1) (GEQ s289 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1808 reset in 567 ms.
Stack based approach found an accepted trace after 642 steps with 8 reset with depth 176 and stack size 167 in 4 ms.
Treatment of property Peterson-COL-7-LTLFireability-15 finished in 1311 ms.
FORMULA Peterson-COL-7-LTLFireability-15 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-17 09:17:02] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15648256623594344639
[2022-05-17 09:17:03] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2022-05-17 09:17:03] [INFO ] Applying decomposition
[2022-05-17 09:17:03] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15648256623594344639
Running compilation step : cd /tmp/ltsmin15648256623594344639;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 09:17:03] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16989409391512455278.txt' '-o' '/tmp/graph16989409391512455278.bin' '-w' '/tmp/graph16989409391512455278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16989409391512455278.bin' '-l' '-1' '-v' '-w' '/tmp/graph16989409391512455278.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:17:03] [INFO ] Decomposing Gal with order
[2022-05-17 09:17:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:17:03] [INFO ] Removed a total of 2834 redundant transitions.
[2022-05-17 09:17:03] [INFO ] Flatten gal took : 194 ms
[2022-05-17 09:17:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-17 09:17:03] [INFO ] Time to serialize gal into /tmp/LTLFireability11036435143026059336.gal : 31 ms
[2022-05-17 09:17:03] [INFO ] Time to serialize properties into /tmp/LTLFireability12245397586179413101.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11036435143026059336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12245397586179413101.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((i17.u34.Turn_53>=1)&&(i17.u301.TestTurn_34>=1))||((i15.u307.Turn_7>=1)&&(i15.u13.TestTurn_7>=1)))||(((i17.u23.Turn_5...34888
Formula 0 simplified : !(X"(((((((((((i17.u34.Turn_53>=1)&&(i17.u301.TestTurn_34>=1))||((i15.u307.Turn_7>=1)&&(i15.u13.TestTurn_7>=1)))||(((i17.u23.Turn_50...34881
Compilation finished in 7193 ms.
Running link step : cd /tmp/ltsmin15648256623594344639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin15648256623594344639;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 09:38:31] [INFO ] Applying decomposition
[2022-05-17 09:38:33] [INFO ] Flatten gal took : 1672 ms
[2022-05-17 09:38:33] [INFO ] Decomposing Gal with order
[2022-05-17 09:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:38:47] [INFO ] Removed a total of 2952 redundant transitions.
[2022-05-17 09:38:47] [INFO ] Flatten gal took : 13532 ms
[2022-05-17 09:38:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 77 ms.
[2022-05-17 09:38:47] [INFO ] Time to serialize gal into /tmp/LTLFireability12638703233791584059.gal : 30 ms
[2022-05-17 09:38:47] [INFO ] Time to serialize properties into /tmp/LTLFireability6814645976907109445.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12638703233791584059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6814645976907109445.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((TourProcess53.Turn_53>=1)&&(ProcessTour34.TestTurn_34>=1))||((TourProcess7.Turn_7>=1)&&(ProcessTour7.TestTurn_7>=1))...43076
Formula 0 simplified : !(X"(((((((((((TourProcess53.Turn_53>=1)&&(ProcessTour34.TestTurn_34>=1))||((TourProcess7.Turn_7>=1)&&(ProcessTour7.TestTurn_7>=1)))...43069
Detected timeout of ITS tools.
[2022-05-17 10:00:29] [INFO ] Flatten gal took : 1121 ms
[2022-05-17 10:00:33] [INFO ] Input system was already deterministic with 3096 transitions.
[2022-05-17 10:00:34] [INFO ] Transformed 1992 places.
[2022-05-17 10:00:34] [INFO ] Transformed 3096 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 10:00:34] [INFO ] Time to serialize gal into /tmp/LTLFireability4332718704145528099.gal : 21 ms
[2022-05-17 10:00:34] [INFO ] Time to serialize properties into /tmp/LTLFireability8681684311626496776.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4332718704145528099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8681684311626496776.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X("(((((((((((Turn_53>=1)&&(TestTurn_34>=1))||((Turn_7>=1)&&(TestTurn_7>=1)))||(((Turn_50>=1)&&(TestTurn_41>=1))||((Turn_51>=1)&&(...23711
Formula 0 simplified : !(X"(((((((((((Turn_53>=1)&&(TestTurn_34>=1))||((Turn_7>=1)&&(TestTurn_7>=1)))||(((Turn_50>=1)&&(TestTurn_41>=1))||((Turn_51>=1)&&(T...23704

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Peterson-COL-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-7, 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 r168-tall-165277016100044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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