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.r150-smll-165276998700316.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 Parking-PT-416, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 05:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 05:56 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 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 107K 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 Parking-PT-416-LTLFireability-00
FORMULA_NAME Parking-PT-416-LTLFireability-01
FORMULA_NAME Parking-PT-416-LTLFireability-02
FORMULA_NAME Parking-PT-416-LTLFireability-03
FORMULA_NAME Parking-PT-416-LTLFireability-04
FORMULA_NAME Parking-PT-416-LTLFireability-05
FORMULA_NAME Parking-PT-416-LTLFireability-06
FORMULA_NAME Parking-PT-416-LTLFireability-07
FORMULA_NAME Parking-PT-416-LTLFireability-08
FORMULA_NAME Parking-PT-416-LTLFireability-09
FORMULA_NAME Parking-PT-416-LTLFireability-10
FORMULA_NAME Parking-PT-416-LTLFireability-11
FORMULA_NAME Parking-PT-416-LTLFireability-12
FORMULA_NAME Parking-PT-416-LTLFireability-13
FORMULA_NAME Parking-PT-416-LTLFireability-14
FORMULA_NAME Parking-PT-416-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653054299386

Running Version 202205111006
[2022-05-20 13:45:01] [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-20 13:45:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 13:45:02] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2022-05-20 13:45:02] [INFO ] Transformed 305 places.
[2022-05-20 13:45:02] [INFO ] Transformed 433 transitions.
[2022-05-20 13:45:02] [INFO ] Found NUPN structural information;
[2022-05-20 13:45:02] [INFO ] Parsed PT model containing 305 places and 433 transitions in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 139 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 301 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 301 transition count 253
Applied a total of 8 rules in 104 ms. Remains 301 /305 variables (removed 4) and now considering 253/257 (removed 4) transitions.
// Phase 1: matrix 253 rows 301 cols
[2022-05-20 13:45:03] [INFO ] Computed 76 place invariants in 32 ms
[2022-05-20 13:45:03] [INFO ] Implicit Places using invariants in 817 ms returned [48, 56, 64, 72, 88, 90, 117, 125, 133, 141, 157, 186, 194, 202, 210, 226, 228, 255, 263, 271, 279, 295]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 886 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 279/305 places, 253/257 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 265 transition count 239
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 265 transition count 239
Applied a total of 28 rules in 27 ms. Remains 265 /279 variables (removed 14) and now considering 239/253 (removed 14) transitions.
// Phase 1: matrix 239 rows 265 cols
[2022-05-20 13:45:03] [INFO ] Computed 54 place invariants in 6 ms
[2022-05-20 13:45:04] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 239 rows 265 cols
[2022-05-20 13:45:04] [INFO ] Computed 54 place invariants in 5 ms
[2022-05-20 13:45:04] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-05-20 13:45:04] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/305 places, 239/257 transitions.
Finished structural reductions, in 2 iterations. Remains : 265/305 places, 239/257 transitions.
Support contains 40 out of 265 places after structural reductions.
[2022-05-20 13:45:05] [INFO ] Flatten gal took : 119 ms
[2022-05-20 13:45:06] [INFO ] Flatten gal took : 54 ms
[2022-05-20 13:45:06] [INFO ] Input system was already deterministic with 239 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 31) seen :24
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 239 rows 265 cols
[2022-05-20 13:45:07] [INFO ] Computed 54 place invariants in 4 ms
[2022-05-20 13:45:07] [INFO ] [Real]Absence check using 54 positive place invariants in 21 ms returned sat
[2022-05-20 13:45:07] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-20 13:45:08] [INFO ] [Nat]Absence check using 54 positive place invariants in 39 ms returned sat
[2022-05-20 13:45:08] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-20 13:45:08] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-05-20 13:45:08] [INFO ] After 200ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2022-05-20 13:45:08] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 10 ms to minimize.
[2022-05-20 13:45:08] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2022-05-20 13:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2022-05-20 13:45:09] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-20 13:45:09] [INFO ] After 1625ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 56 ms.
Support contains 11 out of 265 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 265/265 places, 239/239 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 265 transition count 233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 259 transition count 233
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 259 transition count 227
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 253 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 252 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 252 transition count 226
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 52 place count 239 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 237 transition count 251
Free-agglomeration rule applied 49 times.
Iterating global reduction 2 with 49 rules applied. Total rules applied 105 place count 237 transition count 202
Reduce places removed 49 places and 0 transitions.
Graph (complete) has 408 edges and 188 vertex of which 151 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.7 ms
Discarding 37 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Iterating post reduction 2 with 50 rules applied. Total rules applied 155 place count 151 transition count 174
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 151 transition count 168
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 151 transition count 168
Applied a total of 162 rules in 196 ms. Remains 151 /265 variables (removed 114) and now considering 168/239 (removed 71) transitions.
Finished structural reductions, in 1 iterations. Remains : 151/265 places, 168/239 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 168 rows 151 cols
[2022-05-20 13:45:10] [INFO ] Computed 44 place invariants in 3 ms
[2022-05-20 13:45:10] [INFO ] [Real]Absence check using 44 positive place invariants in 19 ms returned sat
[2022-05-20 13:45:10] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:45:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned sat
[2022-05-20 13:45:10] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:45:10] [INFO ] State equation strengthened by 123 read => feed constraints.
[2022-05-20 13:45:10] [INFO ] After 60ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 13:45:10] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-20 13:45:10] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p0 U (p1 U G(p2))))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 25 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:11] [INFO ] Computed 54 place invariants in 4 ms
[2022-05-20 13:45:12] [INFO ] Implicit Places using invariants in 687 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 693 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 12 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 649 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Parking-PT-416-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s174 1), p2:(OR (EQ s121 1) (EQ s40 1)), p1:(OR (EQ s121 1) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Parking-PT-416-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-00 finished in 1505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U X(p1))&&p1&&(F(p0)||p2)))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 23 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:12] [INFO ] Computed 54 place invariants in 4 ms
[2022-05-20 13:45:13] [INFO ] Implicit Places using invariants in 293 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 295 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 724 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(EQ s93 1), p0:(EQ s32 1), p2:(AND (EQ s121 1) (EQ s32 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 311 steps with 82 reset in 26 ms.
FORMULA Parking-PT-416-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-02 finished in 1110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(X(p0))&&G(p0)))) U p1))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 13 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:13] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 13:45:14] [INFO ] Implicit Places using invariants in 255 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s19 1) (EQ s75 1)), p1:(AND (EQ s110 1) (EQ s142 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-03 finished in 493 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 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 264 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 257 transition count 231
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 257 transition count 224
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 250 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 248 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 248 transition count 222
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 234 transition count 208
Applied a total of 60 rules in 54 ms. Remains 234 /265 variables (removed 31) and now considering 208/239 (removed 31) transitions.
// Phase 1: matrix 208 rows 234 cols
[2022-05-20 13:45:14] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 13:45:14] [INFO ] Implicit Places using invariants in 239 ms returned [125, 231]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/265 places, 208/239 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 230 transition count 206
Applied a total of 4 rules in 45 ms. Remains 230 /232 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 230 cols
[2022-05-20 13:45:14] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 13:45:15] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 206 rows 230 cols
[2022-05-20 13:45:15] [INFO ] Computed 52 place invariants in 4 ms
[2022-05-20 13:45:15] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/265 places, 206/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 230/265 places, 206/239 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-04 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:(EQ s158 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]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 3 ms.
FORMULA Parking-PT-416-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-04 finished in 1316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(!(X(p0) U p1))))))'
Support contains 1 out of 265 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 16 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:15] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 13:45:16] [INFO ] Implicit Places using invariants in 327 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 329 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 6 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, p1, p1, p1, p1]
Running random walk in product with property : Parking-PT-416-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 1 reset in 2 ms.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G(F(X(!(!p0 U p1)))))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 265 transition count 231
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 257 transition count 231
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 257 transition count 223
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 249 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 248 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 248 transition count 222
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 60 place count 235 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 233 transition count 247
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 233 transition count 247
Applied a total of 65 rules in 106 ms. Remains 233 /265 variables (removed 32) and now considering 247/239 (removed -8) transitions.
// Phase 1: matrix 247 rows 233 cols
[2022-05-20 13:45:16] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-20 13:45:16] [INFO ] Implicit Places using invariants in 202 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/265 places, 247/239 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 262
Applied a total of 2 rules in 36 ms. Remains 231 /232 variables (removed 1) and now considering 262/247 (removed -15) transitions.
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:16] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-20 13:45:16] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:16] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-20 13:45:17] [INFO ] State equation strengthened by 124 read => feed constraints.
[2022-05-20 13:45:17] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/265 places, 262/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 231/265 places, 262/239 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, p1]
Running random walk in product with property : Parking-PT-416-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s76 1) (EQ s93 1)), p0:(AND (EQ s103 1) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1343 reset in 1090 ms.
Product exploration explored 100000 steps with 1339 reset in 828 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:20] [INFO ] Computed 53 place invariants in 3 ms
[2022-05-20 13:45:20] [INFO ] [Real]Absence check using 53 positive place invariants in 24 ms returned sat
[2022-05-20 13:45:20] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 13:45:20] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2022-05-20 13:45:20] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 13:45:20] [INFO ] State equation strengthened by 124 read => feed constraints.
[2022-05-20 13:45:20] [INFO ] After 62ms SMT Verify possible using 124 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 13:45:20] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 13:45:21] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 123 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[p1, p1]
Stuttering acceptance computed with spot in 98 ms :[p1, p1]
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 231 /231 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:21] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-20 13:45:21] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:21] [INFO ] Computed 53 place invariants in 7 ms
[2022-05-20 13:45:22] [INFO ] State equation strengthened by 124 read => feed constraints.
[2022-05-20 13:45:22] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2022-05-20 13:45:22] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:22] [INFO ] Computed 53 place invariants in 3 ms
[2022-05-20 13:45:23] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 262/262 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 825 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Finished Best-First random walk after 3736 steps, including 1 resets, run visited all 2 properties in 12 ms. (steps per millisecond=311 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 324 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[p1, p1]
Stuttering acceptance computed with spot in 117 ms :[p1, p1]
Stuttering acceptance computed with spot in 88 ms :[p1, p1]
Product exploration explored 100000 steps with 1343 reset in 344 ms.
Product exploration explored 100000 steps with 1344 reset in 612 ms.
Built C files in :
/tmp/ltsmin10942384149704564483
[2022-05-20 13:45:26] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2022-05-20 13:45:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:45:26] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2022-05-20 13:45:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:45:26] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2022-05-20 13:45:26] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:45:26] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10942384149704564483
Running compilation step : cd /tmp/ltsmin10942384149704564483;'/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 1509 ms.
Running link step : cd /tmp/ltsmin10942384149704564483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10942384149704564483;'/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' '--hoa' '/tmp/stateBased3457291349994383662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 231 /231 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:41] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-20 13:45:41] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:41] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 13:45:41] [INFO ] State equation strengthened by 124 read => feed constraints.
[2022-05-20 13:45:41] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2022-05-20 13:45:41] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 262 rows 231 cols
[2022-05-20 13:45:41] [INFO ] Computed 53 place invariants in 1 ms
[2022-05-20 13:45:42] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin17225841568239256589
[2022-05-20 13:45:42] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2022-05-20 13:45:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:45:42] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2022-05-20 13:45:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:45:42] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2022-05-20 13:45:42] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 13:45:42] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17225841568239256589
Running compilation step : cd /tmp/ltsmin17225841568239256589;'/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 874 ms.
Running link step : cd /tmp/ltsmin17225841568239256589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17225841568239256589;'/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' '--hoa' '/tmp/stateBased154785672619338303.hoa' '--buchi-type=spotba'
LTSmin run took 11191 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-416-LTLFireability-06 finished in 37915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F((F(p1)&&p0)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 264 transition count 232
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 258 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 257 transition count 231
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 257 transition count 225
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 251 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 250 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 250 transition count 224
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 56 place count 236 transition count 210
Applied a total of 56 rules in 26 ms. Remains 236 /265 variables (removed 29) and now considering 210/239 (removed 29) transitions.
// Phase 1: matrix 210 rows 236 cols
[2022-05-20 13:45:54] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 13:45:54] [INFO ] Implicit Places using invariants in 282 ms returned [127]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/265 places, 210/239 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 209
Applied a total of 2 rules in 16 ms. Remains 234 /235 variables (removed 1) and now considering 209/210 (removed 1) transitions.
// Phase 1: matrix 209 rows 234 cols
[2022-05-20 13:45:54] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-20 13:45:54] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 209 rows 234 cols
[2022-05-20 13:45:54] [INFO ] Computed 53 place invariants in 2 ms
[2022-05-20 13:45:55] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 234/265 places, 209/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 234/265 places, 209/239 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s56 1), p0:(AND (EQ s207 1) (EQ s231 1) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-09 finished in 1277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(G(F((F(G(X(G(p0))))||p1))))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 264 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 257 transition count 231
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 257 transition count 224
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 250 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 248 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 248 transition count 222
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 234 transition count 208
Applied a total of 60 rules in 30 ms. Remains 234 /265 variables (removed 31) and now considering 208/239 (removed 31) transitions.
// Phase 1: matrix 208 rows 234 cols
[2022-05-20 13:45:55] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-20 13:45:55] [INFO ] Implicit Places using invariants in 297 ms returned [127, 231]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 298 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/265 places, 208/239 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 230 transition count 206
Applied a total of 4 rules in 22 ms. Remains 230 /232 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 230 cols
[2022-05-20 13:45:55] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 13:45:56] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 206 rows 230 cols
[2022-05-20 13:45:56] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 13:45:56] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/265 places, 206/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 230/265 places, 206/239 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s107 1), p1:(AND (EQ s191 1) (EQ s226 1))], 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 81 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-10 finished in 1264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||G(p2)))))'
Support contains 5 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 10 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:56] [INFO ] Computed 54 place invariants in 7 ms
[2022-05-20 13:45:57] [INFO ] Implicit Places using invariants in 311 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 11 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-416-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s222 1) (EQ s260 1)), p0:(AND (EQ s35 1) (EQ s59 1)), p2:(EQ s121 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-11 finished in 646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p1)&&p2)||p0))))'
Support contains 5 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 10 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:57] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 13:45:57] [INFO ] Implicit Places using invariants in 336 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Parking-PT-416-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s233 0) (AND (OR (EQ s98 0) (EQ s124 0)) (OR (EQ s6 0) (EQ s68 0)))), p2:(EQ s233 1), p1:(AND (EQ s98 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 49407 steps with 635 reset in 339 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 918 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 264 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 257 transition count 231
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 257 transition count 224
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 250 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 248 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 248 transition count 222
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 60 place count 234 transition count 208
Applied a total of 60 rules in 36 ms. Remains 234 /265 variables (removed 31) and now considering 208/239 (removed 31) transitions.
// Phase 1: matrix 208 rows 234 cols
[2022-05-20 13:45:58] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-20 13:45:58] [INFO ] Implicit Places using invariants in 219 ms returned [125, 231]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 221 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/265 places, 208/239 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 230 transition count 206
Applied a total of 4 rules in 16 ms. Remains 230 /232 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 230 cols
[2022-05-20 13:45:58] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 13:45:58] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 206 rows 230 cols
[2022-05-20 13:45:58] [INFO ] Computed 52 place invariants in 4 ms
[2022-05-20 13:45:59] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/265 places, 206/239 transitions.
Finished structural reductions, in 2 iterations. Remains : 230/265 places, 206/239 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 2 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 1081 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(!(p0 U p1))&&X(p2)&&p3))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 239/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 237
Applied a total of 4 rules in 11 ms. Remains 263 /265 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 263 cols
[2022-05-20 13:45:59] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-20 13:45:59] [INFO ] Implicit Places using invariants in 313 ms returned [140, 259]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 315 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/265 places, 237/239 transitions.
Applied a total of 0 rules in 11 ms. Remains 261 /261 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 261/265 places, 237/239 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : Parking-PT-416-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=p3, acceptance={0} source=1 dest: 2}, { cond=(OR (AND p3 p0) (AND p3 p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p3 p0 (NOT p2)) (AND p3 p1 (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s239 1), p0:(EQ s181 1), p1:(EQ s103 1), p2:(EQ s181 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 674 ms.
All properties solved by simple procedures.
Total runtime 58226 ms.

BK_STOP 1653054360329

--------------------
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="Parking-PT-416"
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 Parking-PT-416, 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 r150-smll-165276998700316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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