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-165277017200780.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 PolyORBNT-COL-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 9.4K Apr 30 04:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:39 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.0K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652944716838

Running Version 202205111006
[2022-05-19 07:18:37] [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-19 07:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:18:38] [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-19 07:18:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 07:18:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2022-05-19 07:18:38] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 07:18:38] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 8 ms.
[2022-05-19 07:18:38] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10005 steps, including 572 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 22) seen :15
Finished Best-First random walk after 1406 steps, including 26 resets, run visited all 7 properties in 10 ms. (steps per millisecond=140 )
[2022-05-19 07:18:39] [INFO ] Flatten gal took : 20 ms
[2022-05-19 07:18:39] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 07:18:39] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 223 ms.
[2022-05-19 07:18:39] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2022-05-19 07:18:39] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-19 07:18:39] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-19 07:18:39] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 30 places in 26 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 558 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 1939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 1939
Applied a total of 2 rules in 69 ms. Remains 663 /664 variables (removed 1) and now considering 1939/1940 (removed 1) transitions.
[2022-05-19 07:18:39] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 663 cols
[2022-05-19 07:18:39] [INFO ] Computed 92 place invariants in 108 ms
[2022-05-19 07:18:41] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 07:18:41] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:18:41] [INFO ] Computed 92 place invariants in 63 ms
[2022-05-19 07:18:41] [INFO ] Implicit Places using invariants in 222 ms returned []
[2022-05-19 07:18:41] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:18:41] [INFO ] Computed 92 place invariants in 31 ms
[2022-05-19 07:18:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:18:42] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 663/664 places, 1324/1940 transitions.
Applied a total of 0 rules in 18 ms. Remains 663 /663 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 663/664 places, 1324/1940 transitions.
Support contains 558 out of 663 places after structural reductions.
[2022-05-19 07:18:42] [INFO ] Flatten gal took : 181 ms
[2022-05-19 07:18:42] [INFO ] Flatten gal took : 159 ms
[2022-05-19 07:18:42] [INFO ] Input system was already deterministic with 1324 transitions.
Support contains 557 out of 663 places (down from 558) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 729 ms. (steps per millisecond=13 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :11
Running SMT prover for 6 properties.
[2022-05-19 07:18:43] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:18:43] [INFO ] Computed 92 place invariants in 18 ms
[2022-05-19 07:18:44] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2022-05-19 07:18:44] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-19 07:18:47] [INFO ] After 2243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2022-05-19 07:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:18:48] [INFO ] After 1366ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2022-05-19 07:18:49] [INFO ] After 2779ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 1415 ms.
[2022-05-19 07:18:51] [INFO ] After 6794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2022-05-19 07:18:51] [INFO ] [Nat]Absence check using 85 positive place invariants in 24 ms returned sat
[2022-05-19 07:18:51] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 19 ms returned sat
[2022-05-19 07:18:55] [INFO ] After 4037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 07:19:07] [INFO ] After 12234ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-19 07:19:10] [INFO ] After 15030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2629 ms.
[2022-05-19 07:19:13] [INFO ] After 22002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 27 ms.
Support contains 104 out of 663 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 663 transition count 1291
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 630 transition count 1290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 629 transition count 1290
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 68 place count 629 transition count 1257
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 134 place count 596 transition count 1257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 595 transition count 1256
Applied a total of 136 rules in 159 ms. Remains 595 /663 variables (removed 68) and now considering 1256/1324 (removed 68) transitions.
[2022-05-19 07:19:13] [INFO ] Flow matrix only has 1247 transitions (discarded 9 similar events)
// Phase 1: matrix 1247 rows 595 cols
[2022-05-19 07:19:13] [INFO ] Computed 92 place invariants in 17 ms
[2022-05-19 07:19:14] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 595/663 places, 1256/1324 transitions.
Finished random walk after 2509 steps, including 170 resets, run visited all 6 properties in 24 ms. (steps per millisecond=104 )
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' '!(((!G(p0)&&F(p1)) U !F((F(p0) U p2))))'
Support contains 415 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 653 transition count 1320
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 649 transition count 1320
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 649 transition count 1285
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 614 transition count 1285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 611 transition count 1282
Applied a total of 84 rules in 73 ms. Remains 611 /663 variables (removed 52) and now considering 1282/1324 (removed 42) transitions.
[2022-05-19 07:19:14] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 07:19:14] [INFO ] Computed 82 place invariants in 25 ms
[2022-05-19 07:19:15] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2022-05-19 07:19:15] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 07:19:15] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:19:15] [INFO ] Implicit Places using invariants in 261 ms returned []
[2022-05-19 07:19:15] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 07:19:15] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:16] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
[2022-05-19 07:19:16] [INFO ] Redundant transitions in 90 ms returned []
[2022-05-19 07:19:16] [INFO ] Flow matrix only has 1273 transitions (discarded 9 similar events)
// Phase 1: matrix 1273 rows 611 cols
[2022-05-19 07:19:16] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:17] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 611/663 places, 1282/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 611/663 places, 1282/1324 transitions.
Stuttering acceptance computed with spot in 246 ms :[p2, p0, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ s59 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ s40 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 159 steps with 10 reset in 25 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-00 finished in 3036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U ((p0&&F(p1))||G(!p0))))'
Support contains 32 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 653 transition count 1320
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 649 transition count 1320
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 649 transition count 1317
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 646 transition count 1317
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 643 transition count 1314
Applied a total of 20 rules in 87 ms. Remains 643 /663 variables (removed 20) and now considering 1314/1324 (removed 10) transitions.
[2022-05-19 07:19:17] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 07:19:17] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:19:18] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2022-05-19 07:19:18] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 07:19:18] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:19:18] [INFO ] Implicit Places using invariants in 483 ms returned []
[2022-05-19 07:19:18] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 07:19:18] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:21] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 2988 ms to find 0 implicit places.
[2022-05-19 07:19:21] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-19 07:19:21] [INFO ] Flow matrix only has 1305 transitions (discarded 9 similar events)
// Phase 1: matrix 1305 rows 643 cols
[2022-05-19 07:19:21] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:21] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 643/663 places, 1314/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 643/663 places, 1314/1324 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (GEQ s631 1) (GEQ s632 1) (GEQ s630 1) (GEQ s633 1) (GEQ s636 1) (GEQ s637 1) (GEQ s634 1) (GEQ s635 1) (GEQ s623 1) (GEQ s622 1) (GEQ s625 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 347 steps with 28 reset in 16 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-01 finished in 4708 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(!(p0 U X(p1)))))'
Support contains 34 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1324
Applied a total of 10 rules in 17 ms. Remains 653 /663 variables (removed 10) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:19:22] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:22] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:19:22] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
[2022-05-19 07:19:22] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:22] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:19:23] [INFO ] Implicit Places using invariants in 473 ms returned []
[2022-05-19 07:19:23] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:23] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:19:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:26] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 3981 ms to find 0 implicit places.
[2022-05-19 07:19:26] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:26] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:19:27] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1324/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s45 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s55 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6830 steps with 2300 reset in 85 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-03 finished in 5570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U X(p1)) U X(G(((p2 U p1)&&p0))))))'
Support contains 35 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1290
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 585 transition count 1256
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 582 transition count 1253
Applied a total of 142 rules in 60 ms. Remains 582 /663 variables (removed 81) and now considering 1253/1324 (removed 71) transitions.
[2022-05-19 07:19:27] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:27] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:19:28] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
[2022-05-19 07:19:28] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:28] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:19:28] [INFO ] Implicit Places using invariants in 402 ms returned []
[2022-05-19 07:19:28] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:28] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:19:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:31] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
[2022-05-19 07:19:31] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 07:19:31] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2022-05-19 07:19:31] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:19:31] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/663 places, 1253/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/663 places, 1253/1324 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s576 1), p1:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ s59 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ s40 1) (GEQ s161 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-05 finished in 4002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&(p1||((!p1 U (p2 U !p1))&&p3)))))'
Support contains 4 out of 663 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 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 653 transition count 1292
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 621 transition count 1290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 619 transition count 1290
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 68 place count 619 transition count 1258
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 132 place count 587 transition count 1258
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 584 transition count 1255
Applied a total of 138 rules in 76 ms. Remains 584 /663 variables (removed 79) and now considering 1255/1324 (removed 69) transitions.
[2022-05-19 07:19:31] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 07:19:31] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:19:32] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
[2022-05-19 07:19:32] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 07:19:32] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:32] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-05-19 07:19:32] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 07:19:32] [INFO ] Computed 82 place invariants in 25 ms
[2022-05-19 07:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:35] [INFO ] Implicit Places using invariants and state equation in 2315 ms returned []
Implicit Place search using SMT with State Equation took 2751 ms to find 0 implicit places.
[2022-05-19 07:19:35] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 07:19:35] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2022-05-19 07:19:35] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:19:35] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/663 places, 1255/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/663 places, 1255/1324 transitions.
Stuttering acceptance computed with spot in 1435 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p3), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s580 1), p3:(GEQ s33 1), p0:(AND (GEQ s164 1) (GEQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-06 finished in 5375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((p0&&(X((p1 U p2))||G(p3)))))))'
Support contains 376 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1324
Applied a total of 10 rules in 6 ms. Remains 653 /663 variables (removed 10) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:19:37] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:37] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:19:37] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
[2022-05-19 07:19:37] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:37] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:19:38] [INFO ] Implicit Places using invariants in 314 ms returned []
[2022-05-19 07:19:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:38] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:19:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:40] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2022-05-19 07:19:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:40] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:19:41] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1324/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 907 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p3 (NOT p2)) (AND p3 (NOT p2) p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s500 1) (GEQ s614 1)) (AND (GEQ s288 1) (GEQ s593 1)) (AND (GEQ s229 1) (GEQ s587 1)) (AND (GEQ s347 1) (GEQ s599 1)) (AND (GEQ s323 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 7 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-07 finished in 5048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0))))||G(p1)))'
Support contains 45 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1324
Applied a total of 10 rules in 11 ms. Remains 653 /663 variables (removed 10) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:19:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:42] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:19:42] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
[2022-05-19 07:19:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:42] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:19:43] [INFO ] Implicit Places using invariants in 394 ms returned []
[2022-05-19 07:19:43] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:43] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:19:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:46] [INFO ] Implicit Places using invariants and state equation in 2927 ms returned []
Implicit Place search using SMT with State Equation took 3323 ms to find 0 implicit places.
[2022-05-19 07:19:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:46] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:19:46] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1324/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 930 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 8}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 6}, { cond=(NOT p1), acceptance={} source=10 dest: 7}]], initial=10, aps=[p0:(AND (OR (LT s32 1) (LT s97 1) (LT s117 1)) (OR (LT s32 1) (LT s97 1) (LT s118 1)) (OR (LT s32 1) (LT s97 1) (LT s115 1)) (OR (LT s32 1) (LT s97 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 696 ms.
Product exploration explored 100000 steps with 20000 reset in 802 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 11 states, 17 edges and 2 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327136 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327136 steps, saw 93052 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 07:19:52] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:52] [INFO ] Computed 82 place invariants in 26 ms
[2022-05-19 07:19:52] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2022-05-19 07:19:52] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-19 07:19:52] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:19:53] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2022-05-19 07:19:53] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2022-05-19 07:19:53] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:19:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:53] [INFO ] After 408ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:19:54] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-19 07:19:54] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 33 out of 653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 54 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2022-05-19 07:19:54] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 07:19:54] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:19:54] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/653 places, 1251/1324 transitions.
Finished random walk after 96 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 33 out of 653 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 16 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:19:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:55] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:19:55] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
[2022-05-19 07:19:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:55] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:19:56] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-05-19 07:19:56] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:56] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:19:59] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 3774 ms to find 0 implicit places.
[2022-05-19 07:19:59] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:19:59] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:20:00] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335342 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335342 steps, saw 95418 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 07:20:03] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:03] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:20:03] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2022-05-19 07:20:03] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-19 07:20:03] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:20:04] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2022-05-19 07:20:04] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned sat
[2022-05-19 07:20:04] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:20:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:04] [INFO ] After 393ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:20:04] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-19 07:20:05] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 33 out of 653 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 583 transition count 1254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 580 transition count 1251
Applied a total of 146 rules in 51 ms. Remains 580 /653 variables (removed 73) and now considering 1251/1324 (removed 73) transitions.
[2022-05-19 07:20:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2022-05-19 07:20:05] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:20:05] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/653 places, 1251/1324 transitions.
Finished random walk after 172 steps, including 10 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 613 ms.
Product exploration explored 100000 steps with 20000 reset in 615 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 33 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 653 transition count 1324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 34 place count 653 transition count 1325
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 653 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 652 transition count 1324
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 652 transition count 1324
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 652 transition count 1324
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 109 place count 618 transition count 1290
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 143 place count 618 transition count 1290
Deduced a syphon composed of 38 places in 1 ms
Applied a total of 143 rules in 152 ms. Remains 618 /653 variables (removed 35) and now considering 1290/1324 (removed 34) transitions.
[2022-05-19 07:20:08] [INFO ] Flow matrix only has 1281 transitions (discarded 9 similar events)
// Phase 1: matrix 1281 rows 618 cols
[2022-05-19 07:20:08] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:20:08] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
[2022-05-19 07:20:08] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-19 07:20:08] [INFO ] Flow matrix only has 1281 transitions (discarded 9 similar events)
// Phase 1: matrix 1281 rows 618 cols
[2022-05-19 07:20:09] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:20:09] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/653 places, 1290/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/653 places, 1290/1324 transitions.
Product exploration explored 100000 steps with 20000 reset in 1851 ms.
Product exploration explored 100000 steps with 20000 reset in 1813 ms.
Built C files in :
/tmp/ltsmin9365668057217338345
[2022-05-19 07:20:13] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9365668057217338345
Running compilation step : cd /tmp/ltsmin9365668057217338345;'/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/ltsmin9365668057217338345;'/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/ltsmin9365668057217338345;'/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 33 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1324/1324 transitions.
Applied a total of 0 rules in 15 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:20:16] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:16] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:20:17] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
[2022-05-19 07:20:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:17] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:20:17] [INFO ] Implicit Places using invariants in 468 ms returned []
[2022-05-19 07:20:17] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:17] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:21] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 3942 ms to find 0 implicit places.
[2022-05-19 07:20:21] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:21] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:20:21] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/653 places, 1324/1324 transitions.
Built C files in :
/tmp/ltsmin6329797912601621575
[2022-05-19 07:20:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6329797912601621575
Running compilation step : cd /tmp/ltsmin6329797912601621575;'/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'
Compilation finished in 2574 ms.
Running link step : cd /tmp/ltsmin6329797912601621575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6329797912601621575;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4350623416171971204.hoa' '--buchi-type=spotba'
LTSmin run took 327 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-08 finished in 42548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(X(p0))))'
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1324
Applied a total of 10 rules in 18 ms. Remains 653 /663 variables (removed 10) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:20:24] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:24] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:20:25] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
[2022-05-19 07:20:25] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:25] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:20:25] [INFO ] Implicit Places using invariants in 465 ms returned []
[2022-05-19 07:20:25] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:25] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:20:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:30] [INFO ] Implicit Places using invariants and state equation in 4148 ms returned []
Implicit Place search using SMT with State Equation took 4615 ms to find 0 implicit places.
[2022-05-19 07:20:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:30] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:20:30] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1324/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 790 ms.
Product exploration explored 100000 steps with 50000 reset in 802 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-09 finished in 7850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((p0 U F(p1))||p2))))'
Support contains 24 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Applied a total of 0 rules in 22 ms. Remains 663 /663 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:20:32] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:20:32] [INFO ] Computed 92 place invariants in 19 ms
[2022-05-19 07:20:33] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2022-05-19 07:20:33] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:20:33] [INFO ] Computed 92 place invariants in 23 ms
[2022-05-19 07:20:33] [INFO ] Implicit Places using invariants in 461 ms returned []
[2022-05-19 07:20:33] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:20:33] [INFO ] Computed 92 place invariants in 22 ms
[2022-05-19 07:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:36] [INFO ] Implicit Places using invariants and state equation in 3150 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2022-05-19 07:20:36] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2022-05-19 07:20:36] [INFO ] Computed 92 place invariants in 23 ms
[2022-05-19 07:20:37] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 663/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s590 1) (AND (GEQ s214 1) (GEQ s574 1) (GEQ s584 1) (GEQ s591 1)) (AND (GEQ s214 1) (GEQ s572 1) (GEQ s582 1) (GEQ s591 1)) (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-10 finished in 5224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&p1))))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1324
Applied a total of 10 rules in 18 ms. Remains 653 /663 variables (removed 10) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:20:37] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:37] [INFO ] Computed 82 place invariants in 34 ms
[2022-05-19 07:20:38] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2022-05-19 07:20:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:38] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:20:38] [INFO ] Implicit Places using invariants in 461 ms returned []
[2022-05-19 07:20:38] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:38] [INFO ] Computed 82 place invariants in 22 ms
[2022-05-19 07:20:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:41] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 3007 ms to find 0 implicit places.
[2022-05-19 07:20:41] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:20:41] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:20:42] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1324/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s648 1), p1:(GEQ s202 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-12 finished in 4936 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 653 transition count 1289
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 584 transition count 1255
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 581 transition count 1252
Applied a total of 144 rules in 51 ms. Remains 581 /663 variables (removed 82) and now considering 1252/1324 (removed 72) transitions.
[2022-05-19 07:20:42] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:42] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:20:43] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
[2022-05-19 07:20:43] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:43] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:20:43] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-05-19 07:20:43] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:43] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:45] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2022-05-19 07:20:45] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 07:20:45] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:45] [INFO ] Computed 82 place invariants in 23 ms
[2022-05-19 07:20:46] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/663 places, 1252/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/663 places, 1252/1324 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s33 1)], 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 8101 reset in 954 ms.
Product exploration explored 100000 steps with 8095 reset in 1045 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 46 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 07:20:48] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:48] [INFO ] Computed 82 place invariants in 21 ms
[2022-05-19 07:20:49] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
[2022-05-19 07:20:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:49] [INFO ] Computed 82 place invariants in 17 ms
[2022-05-19 07:20:49] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-05-19 07:20:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:49] [INFO ] Computed 82 place invariants in 14 ms
[2022-05-19 07:20:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:20:52] [INFO ] Implicit Places using invariants and state equation in 3033 ms returned []
Implicit Place search using SMT with State Equation took 3481 ms to find 0 implicit places.
[2022-05-19 07:20:52] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-19 07:20:52] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:52] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:20:53] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 85 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8037 reset in 914 ms.
Product exploration explored 100000 steps with 8142 reset in 959 ms.
Built C files in :
/tmp/ltsmin17059897737721397872
[2022-05-19 07:20:55] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2022-05-19 07:20:55] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:20:55] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2022-05-19 07:20:55] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:20:56] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2022-05-19 07:20:56] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:20:56] [INFO ] Built C files in 312ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17059897737721397872
Running compilation step : cd /tmp/ltsmin17059897737721397872;'/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/ltsmin17059897737721397872;'/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/ltsmin17059897737721397872;'/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 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 27 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2022-05-19 07:20:59] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:59] [INFO ] Computed 82 place invariants in 15 ms
[2022-05-19 07:20:59] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
[2022-05-19 07:20:59] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:20:59] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:21:00] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-05-19 07:21:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:21:00] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-19 07:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:21:02] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
[2022-05-19 07:21:02] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-19 07:21:02] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2022-05-19 07:21:02] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:21:02] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1252/1252 transitions.
Built C files in :
/tmp/ltsmin9060786793540615288
[2022-05-19 07:21:04] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2022-05-19 07:21:04] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:21:04] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2022-05-19 07:21:04] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:21:04] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2022-05-19 07:21:04] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:21:04] [INFO ] Built C files in 252ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9060786793540615288
Running compilation step : cd /tmp/ltsmin9060786793540615288;'/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/ltsmin9060786793540615288;'/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/ltsmin9060786793540615288;'/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-19 07:21:08] [INFO ] Flatten gal took : 92 ms
[2022-05-19 07:21:08] [INFO ] Flatten gal took : 89 ms
[2022-05-19 07:21:08] [INFO ] Time to serialize gal into /tmp/LTL607671384619835166.gal : 15 ms
[2022-05-19 07:21:08] [INFO ] Time to serialize properties into /tmp/LTL3229510352575065725.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/LTL607671384619835166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3229510352575065725.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/LTL6076713...265
Read 1 LTL properties
Checking formula 0 : !((G(F("(QueueJobE_0<1)"))))
Formula 0 simplified : !GF"(QueueJobE_0<1)"
Detected timeout of ITS tools.
[2022-05-19 07:21:23] [INFO ] Flatten gal took : 78 ms
[2022-05-19 07:21:23] [INFO ] Applying decomposition
[2022-05-19 07:21:23] [INFO ] Flatten gal took : 79 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/graph16698336625956454720.txt' '-o' '/tmp/graph16698336625956454720.bin' '-w' '/tmp/graph16698336625956454720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16698336625956454720.bin' '-l' '-1' '-v' '-w' '/tmp/graph16698336625956454720.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:21:23] [INFO ] Decomposing Gal with order
[2022-05-19 07:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:21:24] [INFO ] Removed a total of 3066 redundant transitions.
[2022-05-19 07:21:24] [INFO ] Flatten gal took : 278 ms
[2022-05-19 07:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 49 ms.
[2022-05-19 07:21:24] [INFO ] Time to serialize gal into /tmp/LTL13183360823557199729.gal : 11 ms
[2022-05-19 07:21:24] [INFO ] Time to serialize properties into /tmp/LTL4980268159758741664.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/LTL13183360823557199729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4980268159758741664.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/LTL1318336...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(i0.u0.QueueJobE_0<1)"))))
Formula 0 simplified : !GF"(i0.u0.QueueJobE_0<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11876176490334897807
[2022-05-19 07:21:39] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11876176490334897807
Running compilation step : cd /tmp/ltsmin11876176490334897807;'/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'
Compilation finished in 2415 ms.
Running link step : cd /tmp/ltsmin11876176490334897807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11876176490334897807;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-13 finished in 71662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 1324/1324 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 653 transition count 1324
Applied a total of 10 rules in 19 ms. Remains 653 /663 variables (removed 10) and now considering 1324/1324 (removed 0) transitions.
[2022-05-19 07:21:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:21:54] [INFO ] Computed 82 place invariants in 19 ms
[2022-05-19 07:21:55] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2022-05-19 07:21:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:21:55] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-19 07:21:55] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-05-19 07:21:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:21:55] [INFO ] Computed 82 place invariants in 18 ms
[2022-05-19 07:21:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:21:58] [INFO ] Implicit Places using invariants and state equation in 3144 ms returned []
Implicit Place search using SMT with State Equation took 3554 ms to find 0 implicit places.
[2022-05-19 07:21:58] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2022-05-19 07:21:58] [INFO ] Computed 82 place invariants in 16 ms
[2022-05-19 07:21:59] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/663 places, 1324/1324 transitions.
Finished structural reductions, in 1 iterations. Remains : 653/663 places, 1324/1324 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s203 1) (GEQ s208 1) (GEQ s209 1) (GEQ s210 1) (GEQ s214 7)) (AND (GEQ s203 1) (GEQ s204 1) (GEQ s205 1) (GEQ s213 1) (GEQ s214 7)) (AND ...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-15 finished in 5045 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-19 07:21:59] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2763696184217591512
[2022-05-19 07:21:59] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2022-05-19 07:21:59] [INFO ] Applying decomposition
[2022-05-19 07:21:59] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:21:59] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2022-05-19 07:21:59] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:21:59] [INFO ] Flatten gal took : 73 ms
[2022-05-19 07:21:59] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
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/graph10673889026376792971.txt' '-o' '/tmp/graph10673889026376792971.bin' '-w' '/tmp/graph10673889026376792971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10673889026376792971.bin' '-l' '-1' '-v' '-w' '/tmp/graph10673889026376792971.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:21:59] [INFO ] Decomposing Gal with order
[2022-05-19 07:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:21:59] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:21:59] [INFO ] Built C files in 308ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2763696184217591512
Running compilation step : cd /tmp/ltsmin2763696184217591512;'/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-19 07:22:00] [INFO ] Removed a total of 3265 redundant transitions.
[2022-05-19 07:22:00] [INFO ] Flatten gal took : 167 ms
[2022-05-19 07:22:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 45 ms.
[2022-05-19 07:22:00] [INFO ] Time to serialize gal into /tmp/LTLFireability12374822126363282762.gal : 10 ms
[2022-05-19 07:22:00] [INFO ] Time to serialize properties into /tmp/LTLFireability6417299520210526307.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/LTLFireability12374822126363282762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6417299520210526307.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 : !((G(F("(i0.u14.QueueJobE_0<1)"))))
Formula 0 simplified : !GF"(i0.u14.QueueJobE_0<1)"
Compilation finished in 4998 ms.
Running link step : cd /tmp/ltsmin2763696184217591512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin2763696184217591512;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 07:43:18] [INFO ] Applying decomposition
[2022-05-19 07:43:18] [INFO ] Flatten gal took : 575 ms
[2022-05-19 07:43:19] [INFO ] Decomposing Gal with order
[2022-05-19 07:43:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:43:20] [INFO ] Removed a total of 6716 redundant transitions.
[2022-05-19 07:43:20] [INFO ] Flatten gal took : 1055 ms
[2022-05-19 07:43:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 132 ms.
[2022-05-19 07:43:23] [INFO ] Time to serialize gal into /tmp/LTLFireability344197381811341670.gal : 141 ms
[2022-05-19 07:43:23] [INFO ] Time to serialize properties into /tmp/LTLFireability322126688269035010.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/LTLFireability344197381811341670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability322126688269035010.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...265
Read 1 LTL properties
Checking formula 0 : !((G(F("(QueueJobE.QueueJobE_0<1)"))))
Formula 0 simplified : !GF"(QueueJobE.QueueJobE_0<1)"
Detected timeout of ITS tools.
[2022-05-19 08:04:35] [INFO ] Flatten gal took : 677 ms
[2022-05-19 08:04:42] [INFO ] Input system was already deterministic with 1324 transitions.
[2022-05-19 08:04:42] [INFO ] Transformed 663 places.
[2022-05-19 08:04:42] [INFO ] Transformed 1324 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-19 08:05:13] [INFO ] Time to serialize gal into /tmp/LTLFireability15489062807536527888.gal : 26 ms
[2022-05-19 08:05:13] [INFO ] Time to serialize properties into /tmp/LTLFireability15286398926070600627.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/LTLFireability15489062807536527888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15286398926070600627.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...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(QueueJobE_0<1)"))))
Formula 0 simplified : !GF"(QueueJobE_0<1)"

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="PolyORBNT-COL-S10J30"
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 PolyORBNT-COL-S10J30, 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-165277017200780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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