Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540000428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r265-smll-167863540000428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 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 1679000341398

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 20:59:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 20:59:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:59:04] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-16 20:59:04] [INFO ] Transformed 305 places.
[2023-03-16 20:59:04] [INFO ] Transformed 433 transitions.
[2023-03-16 20:59:04] [INFO ] Found NUPN structural information;
[2023-03-16 20:59:04] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 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-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 67 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2023-03-16 20:59:04] [INFO ] Computed 76 place invariants in 19 ms
[2023-03-16 20:59:05] [INFO ] Implicit Places using invariants in 636 ms returned [48, 56, 64, 72, 88, 90, 118, 126, 134, 158, 160, 187, 195, 203, 211, 227, 264, 272, 280, 296, 298]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 682 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 281/305 places, 254/257 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 269 transition count 242
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 269 transition count 242
Applied a total of 24 rules in 19 ms. Remains 269 /281 variables (removed 12) and now considering 242/254 (removed 12) transitions.
// Phase 1: matrix 242 rows 269 cols
[2023-03-16 20:59:05] [INFO ] Computed 55 place invariants in 5 ms
[2023-03-16 20:59:05] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-16 20:59:05] [INFO ] Invariant cache hit.
[2023-03-16 20:59:05] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:05] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 269/305 places, 242/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1419 ms. Remains : 269/305 places, 242/257 transitions.
Support contains 38 out of 269 places after structural reductions.
[2023-03-16 20:59:06] [INFO ] Flatten gal took : 69 ms
[2023-03-16 20:59:06] [INFO ] Flatten gal took : 31 ms
[2023-03-16 20:59:06] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-16 20:59:06] [INFO ] Invariant cache hit.
[2023-03-16 20:59:07] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-16 20:59:07] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 20:59:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2023-03-16 20:59:07] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 20:59:07] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:07] [INFO ] After 156ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-16 20:59:07] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 7 ms to minimize.
[2023-03-16 20:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-16 20:59:08] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-16 20:59:08] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 107 ms.
Support contains 11 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 242/242 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 269 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 262 transition count 235
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 262 transition count 228
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 255 transition count 228
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 238 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 237 transition count 230
Free-agglomeration rule applied 53 times.
Iterating global reduction 2 with 53 rules applied. Total rules applied 117 place count 237 transition count 177
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 170 place count 184 transition count 177
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 184 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 182 transition count 175
Applied a total of 174 rules in 102 ms. Remains 182 /269 variables (removed 87) and now considering 175/242 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 182/269 places, 175/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 175 rows 182 cols
[2023-03-16 20:59:08] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-16 20:59:08] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:59:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-16 20:59:08] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:08] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-16 20:59:09] [INFO ] After 37ms SMT Verify possible using 151 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:09] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 20:59:09] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F(p1))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 17 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:09] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:09] [INFO ] Implicit Places using invariants in 193 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 202 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 12 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-16 20:59:09] [INFO ] Computed 52 place invariants in 3 ms
[2023-03-16 20:59:09] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-16 20:59:09] [INFO ] Invariant cache hit.
[2023-03-16 20:59:10] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:10] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 849 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s149 1) (NEQ s171 1)), p0:(OR (EQ s104 0) (EQ s142 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1055 ms.
Product exploration explored 100000 steps with 50000 reset in 859 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-00 finished in 3279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 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 268 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 261 transition count 234
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 261 transition count 227
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 254 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 251 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 251 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 234 transition count 207
Applied a total of 68 rules in 38 ms. Remains 234 /269 variables (removed 35) and now considering 207/242 (removed 35) transitions.
// Phase 1: matrix 207 rows 234 cols
[2023-03-16 20:59:12] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:12] [INFO ] Implicit Places using invariants in 167 ms returned [109, 177, 201]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 170 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/269 places, 207/242 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 230 transition count 206
Applied a total of 2 rules in 17 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2023-03-16 20:59:12] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-16 20:59:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-16 20:59:13] [INFO ] Invariant cache hit.
[2023-03-16 20:59:13] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/269 places, 206/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 647 ms. Remains : 230/269 places, 206/242 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s205 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 78 steps with 0 reset in 5 ms.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-01 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 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 269 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 261 transition count 234
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 261 transition count 226
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 253 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 250 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 250 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 233 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 231 transition count 244
Applied a total of 76 rules in 51 ms. Remains 231 /269 variables (removed 38) and now considering 244/242 (removed -2) transitions.
// Phase 1: matrix 244 rows 231 cols
[2023-03-16 20:59:13] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:13] [INFO ] Implicit Places using invariants in 172 ms returned [109, 176, 200]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 173 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/269 places, 244/242 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 227 transition count 259
Applied a total of 2 rules in 24 ms. Remains 227 /228 variables (removed 1) and now considering 259/244 (removed -15) transitions.
// Phase 1: matrix 259 rows 227 cols
[2023-03-16 20:59:13] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-16 20:59:13] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-16 20:59:13] [INFO ] Invariant cache hit.
[2023-03-16 20:59:14] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-16 20:59:14] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 227/269 places, 259/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 893 ms. Remains : 227/269 places, 259/242 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s78 1) (EQ s112 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 74 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-02 finished in 954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1) U p2))||G(p3)))'
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 8 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:14] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:14] [INFO ] Implicit Places using invariants in 170 ms returned [126, 201]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 172 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 8 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-16 20:59:14] [INFO ] Computed 53 place invariants in 2 ms
[2023-03-16 20:59:14] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-16 20:59:14] [INFO ] Invariant cache hit.
[2023-03-16 20:59:14] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:15] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 733 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Parking-PT-416-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s115 0), p2:(AND (EQ s225 1) (EQ s259 1)), p1:(OR (EQ s115 1) (AND (EQ s225 1) (EQ s259 1))), p0:(AND (EQ s18 1) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 840 ms.
Product exploration explored 100000 steps with 50000 reset in 996 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (NOT (OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), true, (X (X (NOT (OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (OR (AND p3 (NOT p2) p1) (AND p3 (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 23 factoid took 654 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-03 finished in 3647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 9 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:18] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:18] [INFO ] Implicit Places using invariants in 182 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 183 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 7 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-16 20:59:18] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:18] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-16 20:59:18] [INFO ] Invariant cache hit.
[2023-03-16 20:59:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:18] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 806 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s156 1) (EQ s97 1)), p0:(OR (EQ s3 0) (EQ s191 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 1 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-04 finished in 955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((p1&&X(p2)))))&&p0)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 7 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:19] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:19] [INFO ] Implicit Places using invariants in 187 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 189 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 7 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-16 20:59:19] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:19] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-16 20:59:19] [INFO ] Invariant cache hit.
[2023-03-16 20:59:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:19] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 774 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT 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=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (EQ s206 1) (EQ s254 1)), p1:(EQ s28 1), p2:(EQ s0 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, null][false, false, 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-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 1023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G((p0 U p1)))))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 240
Applied a total of 4 rules in 7 ms. Remains 267 /269 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 267 cols
[2023-03-16 20:59:20] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-16 20:59:20] [INFO ] Implicit Places using invariants in 190 ms returned [127, 202, 229]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 192 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 262 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 262 transition count 238
Applied a total of 4 rules in 9 ms. Remains 262 /264 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 262 cols
[2023-03-16 20:59:20] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:20] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-16 20:59:20] [INFO ] Invariant cache hit.
[2023-03-16 20:59:20] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:20] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 799 ms. Remains : 262/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s82 1), p1:(AND (EQ s234 1) (EQ s82 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 90 steps with 0 reset in 5 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-06 finished in 1009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 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 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
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 260 transition count 225
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 252 transition count 225
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 249 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 249 transition count 222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 70 place count 233 transition count 206
Applied a total of 70 rules in 23 ms. Remains 233 /269 variables (removed 36) and now considering 206/242 (removed 36) transitions.
// Phase 1: matrix 206 rows 233 cols
[2023-03-16 20:59:21] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-16 20:59:21] [INFO ] Implicit Places using invariants in 182 ms returned [110, 178, 202]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 185 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/269 places, 206/242 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 229 transition count 205
Applied a total of 2 rules in 10 ms. Remains 229 /230 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 229 cols
[2023-03-16 20:59:21] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:21] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-16 20:59:21] [INFO ] Invariant cache hit.
[2023-03-16 20:59:21] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/269 places, 205/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 684 ms. Remains : 229/269 places, 205/242 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-07 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 s98 0)], 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 1336 reset in 319 ms.
Product exploration explored 100000 steps with 1339 reset in 481 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 209 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-16 20:59:23] [INFO ] Invariant cache hit.
[2023-03-16 20:59:23] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-16 20:59:23] [INFO ] Invariant cache hit.
[2023-03-16 20:59:23] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-16 20:59:23] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 20:59:23] [INFO ] Invariant cache hit.
[2023-03-16 20:59:23] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 229/229 places, 205/205 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 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1337 reset in 375 ms.
Product exploration explored 100000 steps with 1340 reset in 601 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 16 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-16 20:59:25] [INFO ] Invariant cache hit.
[2023-03-16 20:59:25] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-16 20:59:25] [INFO ] Invariant cache hit.
[2023-03-16 20:59:26] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-16 20:59:26] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 20:59:26] [INFO ] Invariant cache hit.
[2023-03-16 20:59:26] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1032 ms. Remains : 229/229 places, 205/205 transitions.
Treatment of property Parking-PT-416-LTLFireability-07 finished in 5468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F(p2)&&p0))))'
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 10 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:26] [INFO ] Computed 55 place invariants in 4 ms
[2023-03-16 20:59:26] [INFO ] Implicit Places using invariants in 232 ms returned [201, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/269 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 13 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-16 20:59:26] [INFO ] Computed 53 place invariants in 2 ms
[2023-03-16 20:59:27] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-16 20:59:27] [INFO ] Invariant cache hit.
[2023-03-16 20:59:27] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:27] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1046 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Parking-PT-416-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s141 1)), p1:(OR (EQ s28 0) (EQ s69 0)), p2:(OR (EQ s209 0) (EQ s227 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-08 finished in 1345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 11 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:27] [INFO ] Computed 55 place invariants in 9 ms
[2023-03-16 20:59:28] [INFO ] Implicit Places using invariants in 307 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 309 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 10 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-16 20:59:28] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:28] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-16 20:59:28] [INFO ] Invariant cache hit.
[2023-03-16 20:59:28] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:29] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1229 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 301 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s117 1) (EQ s142 1)), p1:(EQ s57 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1285 reset in 606 ms.
Product exploration explored 100000 steps with 1283 reset in 682 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 128 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :3
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.
[2023-03-16 20:59:31] [INFO ] Invariant cache hit.
[2023-03-16 20:59:31] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2023-03-16 20:59:31] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:59:31] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-16 20:59:31] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:31] [INFO ] After 38ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:31] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-16 20:59:31] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 237/237 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 261 transition count 230
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 254 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 253 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 246 transition count 222
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 231 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 230 transition count 226
Free-agglomeration rule applied 62 times.
Iterating global reduction 3 with 62 rules applied. Total rules applied 124 place count 230 transition count 164
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 379 edges and 168 vertex of which 92 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.2 ms
Discarding 76 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Iterating post reduction 3 with 63 rules applied. Total rules applied 187 place count 92 transition count 104
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 195 place count 92 transition count 96
Applied a total of 195 rules in 64 ms. Remains 92 /261 variables (removed 169) and now considering 96/237 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 92/261 places, 96/237 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished Best-First random walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) p0)]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 237/237 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 261 transition count 230
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 254 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 253 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 246 transition count 222
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 231 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 230 transition count 226
Applied a total of 62 rules in 40 ms. Remains 230 /261 variables (removed 31) and now considering 226/237 (removed 11) transitions.
// Phase 1: matrix 226 rows 230 cols
[2023-03-16 20:59:32] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-16 20:59:32] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-16 20:59:32] [INFO ] Invariant cache hit.
[2023-03-16 20:59:32] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-16 20:59:33] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-16 20:59:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 20:59:33] [INFO ] Invariant cache hit.
[2023-03-16 20:59:33] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/261 places, 226/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1242 ms. Remains : 230/261 places, 226/237 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 481 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:59:34] [INFO ] Invariant cache hit.
[2023-03-16 20:59:34] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2023-03-16 20:59:34] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:59:34] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2023-03-16 20:59:34] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:34] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-16 20:59:34] [INFO ] After 49ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:34] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-16 20:59:34] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 226/226 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 230 transition count 164
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 379 edges and 168 vertex of which 92 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 92 transition count 104
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 92 transition count 96
Applied a total of 133 rules in 24 ms. Remains 92 /230 variables (removed 138) and now considering 96/226 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 92/230 places, 96/226 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 612 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1314 reset in 411 ms.
Product exploration explored 100000 steps with 1320 reset in 401 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-16 20:59:36] [INFO ] Invariant cache hit.
[2023-03-16 20:59:36] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-16 20:59:36] [INFO ] Invariant cache hit.
[2023-03-16 20:59:36] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-16 20:59:37] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2023-03-16 20:59:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 20:59:37] [INFO ] Invariant cache hit.
[2023-03-16 20:59:37] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 823 ms. Remains : 230/230 places, 226/226 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 9515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1||X(p0)))))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 240
Applied a total of 4 rules in 14 ms. Remains 267 /269 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 267 cols
[2023-03-16 20:59:37] [INFO ] Computed 55 place invariants in 4 ms
[2023-03-16 20:59:37] [INFO ] Implicit Places using invariants in 373 ms returned [126, 229]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 376 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/269 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 238
Applied a total of 4 rules in 20 ms. Remains 263 /265 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 263 cols
[2023-03-16 20:59:37] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-16 20:59:37] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-16 20:59:37] [INFO ] Invariant cache hit.
[2023-03-16 20:59:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:38] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/269 places, 238/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1122 ms. Remains : 263/269 places, 238/242 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
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 p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s235 1), p0:(AND (EQ s178 1) (EQ s200 1))], 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 83 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 1309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Reduce places removed 1 places and 1 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 268 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 260 transition count 233
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 260 transition count 225
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 252 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 250 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 250 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 70 place count 233 transition count 206
Applied a total of 70 rules in 45 ms. Remains 233 /269 variables (removed 36) and now considering 206/242 (removed 36) transitions.
// Phase 1: matrix 206 rows 233 cols
[2023-03-16 20:59:38] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-16 20:59:39] [INFO ] Implicit Places using invariants in 290 ms returned [109, 202]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/269 places, 206/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 231/269 places, 206/242 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s43 1) (EQ s73 1)), p1:(AND (EQ s161 1) (EQ s177 1))], 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 141 steps with 1 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1&&X(G(p0))))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 11 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:39] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:39] [INFO ] Implicit Places using invariants in 281 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 287 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 9 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-16 20:59:39] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:39] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-16 20:59:39] [INFO ] Invariant cache hit.
[2023-03-16 20:59:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:40] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1143 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s62 1), p0:(EQ s95 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]]
Entered a terminal (fully accepting) state of product in 20 steps with 4 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 1414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X((p0&&F(p1)))||G(p0)))||(!p0&&(X((p0&&F(p1)))||G(p0)))))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 239
Applied a total of 6 rules in 9 ms. Remains 266 /269 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 266 cols
[2023-03-16 20:59:40] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:40] [INFO ] Implicit Places using invariants in 301 ms returned [126, 201, 228]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 315 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/269 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 9 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2023-03-16 20:59:40] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-16 20:59:41] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-16 20:59:41] [INFO ] Invariant cache hit.
[2023-03-16 20:59:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-16 20:59:41] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/269 places, 237/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1075 ms. Remains : 261/269 places, 237/242 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s205 1), p0:(EQ s56 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][false, 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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 1355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Found a Shortening insensitive property : Parking-PT-416-LTLFireability-09
Stuttering acceptance computed with spot in 311 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 269/269 places, 242/242 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 269 transition count 235
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 262 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 261 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 261 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 254 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 251 transition count 224
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 251 transition count 224
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 68 place count 235 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 233 transition count 246
Applied a total of 72 rules in 44 ms. Remains 233 /269 variables (removed 36) and now considering 246/242 (removed -4) transitions.
// Phase 1: matrix 246 rows 233 cols
[2023-03-16 20:59:42] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-16 20:59:43] [INFO ] Implicit Places using invariants in 275 ms returned [110, 178, 202]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 277 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 230/269 places, 246/242 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 229 transition count 261
Applied a total of 2 rules in 15 ms. Remains 229 /230 variables (removed 1) and now considering 261/246 (removed -15) transitions.
// Phase 1: matrix 261 rows 229 cols
[2023-03-16 20:59:43] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-16 20:59:43] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-16 20:59:43] [INFO ] Invariant cache hit.
[2023-03-16 20:59:43] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-16 20:59:43] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 229/269 places, 261/242 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1069 ms. Remains : 229/269 places, 261/242 transitions.
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s104 1) (EQ s127 1)), p1:(EQ s53 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1342 reset in 357 ms.
Product exploration explored 100000 steps with 1332 reset in 402 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 p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 133 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:59:44] [INFO ] Invariant cache hit.
[2023-03-16 20:59:45] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2023-03-16 20:59:45] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:59:45] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-16 20:59:45] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:45] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-16 20:59:45] [INFO ] After 137ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:45] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-16 20:59:45] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 261/261 transitions.
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 229 transition count 204
Reduce places removed 57 places and 0 transitions.
Graph (complete) has 423 edges and 172 vertex of which 92 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 76 output transitions
Drop transitions removed 76 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 115 place count 92 transition count 128
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 92 transition count 96
Applied a total of 147 rules in 39 ms. Remains 92 /229 variables (removed 137) and now considering 96/261 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 92/229 places, 96/261 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 107 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 385 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) p0)]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 15 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-16 20:59:46] [INFO ] Invariant cache hit.
[2023-03-16 20:59:46] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-16 20:59:46] [INFO ] Invariant cache hit.
[2023-03-16 20:59:47] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-16 20:59:47] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
[2023-03-16 20:59:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 20:59:47] [INFO ] Invariant cache hit.
[2023-03-16 20:59:47] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 229/229 places, 261/261 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 p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 436 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:59:48] [INFO ] Invariant cache hit.
[2023-03-16 20:59:48] [INFO ] [Real]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-16 20:59:48] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:59:48] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2023-03-16 20:59:49] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:49] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-16 20:59:49] [INFO ] After 133ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:59:49] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-16 20:59:49] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 261/261 transitions.
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 229 transition count 204
Reduce places removed 57 places and 0 transitions.
Graph (complete) has 423 edges and 172 vertex of which 92 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 76 output transitions
Drop transitions removed 76 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 115 place count 92 transition count 128
Drop transitions removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 92 transition count 96
Applied a total of 147 rules in 29 ms. Remains 92 /229 variables (removed 137) and now considering 96/261 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 92/229 places, 96/261 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished Best-First random walk after 208 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=208 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 646 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1329 reset in 606 ms.
Product exploration explored 100000 steps with 1332 reset in 669 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 16 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-16 20:59:51] [INFO ] Invariant cache hit.
[2023-03-16 20:59:51] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-16 20:59:51] [INFO ] Invariant cache hit.
[2023-03-16 20:59:52] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-16 20:59:52] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-16 20:59:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 20:59:52] [INFO ] Invariant cache hit.
[2023-03-16 20:59:52] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1154 ms. Remains : 229/229 places, 261/261 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 10547 ms.
[2023-03-16 20:59:52] [INFO ] Flatten gal took : 20 ms
[2023-03-16 20:59:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 20:59:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 242 transitions and 805 arcs took 3 ms.
Total runtime 48877 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1435/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1435/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Parking-PT-416-LTLFireability-07
Could not compute solution for formula : Parking-PT-416-LTLFireability-09

BK_STOP 1679000394769

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Parking-PT-416-LTLFireability-07
ltl formula formula --ltl=/tmp/1435/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 269 places, 242 transitions and 805 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1435/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563da92bf3f4]
1: pnml2lts-mc(+0xa2496) [0x563da92bf496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7feaed805140]
3: pnml2lts-mc(+0x405be5) [0x563da9622be5]
4: pnml2lts-mc(+0x16b3f9) [0x563da93883f9]
5: pnml2lts-mc(+0x164ac4) [0x563da9381ac4]
6: pnml2lts-mc(+0x272e0a) [0x563da948fe0a]
7: pnml2lts-mc(+0xb61f0) [0x563da92d31f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7feaed6584d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7feaed65867a]
10: pnml2lts-mc(+0xa1581) [0x563da92be581]
11: pnml2lts-mc(+0xa1910) [0x563da92be910]
12: pnml2lts-mc(+0xa32a2) [0x563da92c02a2]
13: pnml2lts-mc(+0xa50f4) [0x563da92c20f4]
14: pnml2lts-mc(+0xa516b) [0x563da92c216b]
15: pnml2lts-mc(+0x3f34b3) [0x563da96104b3]
16: pnml2lts-mc(+0x7c63d) [0x563da929963d]
17: pnml2lts-mc(+0x67d86) [0x563da9284d86]
18: pnml2lts-mc(+0x60a8a) [0x563da927da8a]
19: pnml2lts-mc(+0x5eb15) [0x563da927bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7feaed640d0a]
21: pnml2lts-mc(+0x6075e) [0x563da927d75e]
ltl formula name Parking-PT-416-LTLFireability-09
ltl formula formula --ltl=/tmp/1435/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 269 places, 242 transitions and 805 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1435/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r265-smll-167863540000428"
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 ;