Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 19K Apr 29 23:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 29 23:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 110K Apr 29 23:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 448K Apr 29 23:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 149K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 790K May 10 09:33 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 BridgeAndVehicles-PT-V20P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652586542588

Running Version 202205111006
[2022-05-15 03:49:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 03:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 03:49:04] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2022-05-15 03:49:04] [INFO ] Transformed 78 places.
[2022-05-15 03:49:04] [INFO ] Transformed 968 transitions.
[2022-05-15 03:49:04] [INFO ] Parsed PT model containing 78 places and 968 transitions in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Applied a total of 2 rules in 24 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
[2022-05-15 03:49:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:04] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-15 03:49:04] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
[2022-05-15 03:49:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-15 03:49:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:04] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-15 03:49:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:05] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/78 places, 968/968 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/78 places, 968/968 transitions.
Support contains 76 out of 76 places after structural reductions.
[2022-05-15 03:49:05] [INFO ] Flatten gal took : 115 ms
[2022-05-15 03:49:05] [INFO ] Flatten gal took : 93 ms
[2022-05-15 03:49:06] [INFO ] Input system was already deterministic with 968 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-15 03:49:06] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:07] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2022-05-15 03:49:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:49:07] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-05-15 03:49:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:07] [INFO ] After 129ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2022-05-15 03:49:07] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 183 ms.
[2022-05-15 03:49:07] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 73 transition count 966
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 71 transition count 964
Applied a total of 9 rules in 157 ms. Remains 71 /76 variables (removed 5) and now considering 964/968 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/76 places, 964/968 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 462320 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 462320 steps, saw 129313 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :2
Running SMT prover for 1 properties.
[2022-05-15 03:49:11] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:11] [INFO ] Computed 4 place invariants in 16 ms
[2022-05-15 03:49:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:11] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 03:49:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:11] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:11] [INFO ] After 23ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:11] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-15 03:49:11] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 964/964 transitions.
Applied a total of 0 rules in 57 ms. Remains 71 /71 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/71 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 630374 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 630374 steps, saw 174564 distinct states, run finished after 3002 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 03:49:15] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:15] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 03:49:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:15] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 03:49:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:15] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:15] [INFO ] After 18ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:15] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-15 03:49:15] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 964/964 transitions.
Applied a total of 0 rules in 53 ms. Remains 71 /71 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/71 places, 964/964 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 964/964 transitions.
Applied a total of 0 rules in 64 ms. Remains 71 /71 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2022-05-15 03:49:15] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:15] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 03:49:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-15 03:49:15] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:15] [INFO ] Implicit Places using invariants and state equation in 359 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 516 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 69/71 places, 964/964 transitions.
Applied a total of 0 rules in 46 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/71 places, 964/964 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 672847 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 672847 steps, saw 185885 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 03:49:19] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 69 cols
[2022-05-15 03:49:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 03:49:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:19] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 03:49:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:19] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:19] [INFO ] After 30ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:19] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 03:49:19] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 964/964 transitions.
Applied a total of 0 rules in 44 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 964/964 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 964/964 transitions.
Applied a total of 0 rules in 39 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2022-05-15 03:49:19] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 69 cols
[2022-05-15 03:49:19] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 03:49:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2022-05-15 03:49:19] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 69 cols
[2022-05-15 03:49:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:19] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2022-05-15 03:49:19] [INFO ] Redundant transitions in 64 ms returned []
[2022-05-15 03:49:19] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 69 cols
[2022-05-15 03:49:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:20] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 964/964 transitions.
Ensure Unique test removed 798 transitions
Reduce isomorphic transitions removed 798 transitions.
Iterating post reduction 0 with 798 rules applied. Total rules applied 798 place count 69 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 800 place count 69 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 802 place count 67 transition count 164
Applied a total of 802 rules in 12 ms. Remains 67 /69 variables (removed 2) and now considering 164/964 (removed 800) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 164 rows 67 cols
[2022-05-15 03:49:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 03:49:20] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 03:49:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 03:49:20] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 03:49:20] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:20] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 03:49:20] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 03:49:20] [INFO ] Flatten gal took : 11 ms
[2022-05-15 03:49:20] [INFO ] Flatten gal took : 8 ms
[2022-05-15 03:49:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15499765894359143723.gal : 2 ms
[2022-05-15 03:49:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18374960378169576108.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10568537643733461812;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15499765894359143723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18374960378169576108.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18374960378169576108.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 4510
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :37720 after 56580
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.3378e+06,0.065071,5352,2,479,13,4901,7,0,440,3673,0
Total reachable state count : 4337800

Verifying 1 reachability properties.
Reachability property AtomicPropp21 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp21,21,0.065969,5352,2,68,13,4901,7,0,447,3673,0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 45 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 93 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:20] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:20] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:49:21] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
[2022-05-15 03:49:21] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-15 03:49:21] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:21] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 380 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 56 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (AND (GEQ s19 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s18 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s22 1) (GEQ s24 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-00 finished in 1115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((p0 U G(p1)) U p1))||F(p0))))'
Support contains 23 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 03:49:21] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:22] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
[2022-05-15 03:49:22] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-15 03:49:22] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:22] [INFO ] Implicit Places using invariants and state equation in 330 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 454 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 968/968 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s49 1), p1:(OR (AND (GEQ s48 1) (GEQ s53 1)) (AND (GEQ s48 1) (GEQ s54 1)) (AND (GEQ s48 1) (GEQ s55 1)) (AND (GEQ s48 1) (GEQ s56 1)) (AND (GEQ s...], 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 1248 reset in 417 ms.
Product exploration explored 100000 steps with 1245 reset in 363 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/74 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 23 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 968/968 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 03:49:24] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2022-05-15 03:49:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:24] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
[2022-05-15 03:49:24] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2022-05-15 03:49:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:24] [INFO ] Implicit Places using invariants in 125 ms returned []
[2022-05-15 03:49:24] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2022-05-15 03:49:24] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 03:49:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:25] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2022-05-15 03:49:25] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2022-05-15 03:49:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:25] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 968/968 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/74 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 108 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1267 reset in 328 ms.
Product exploration explored 100000 steps with 1278 reset in 338 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 23 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 968/968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 968
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 75 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 03:49:27] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2022-05-15 03:49:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:27] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
[2022-05-15 03:49:27] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-15 03:49:27] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 74 cols
[2022-05-15 03:49:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:28] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 968/968 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 968/968 transitions.
Product exploration explored 100000 steps with 1541 reset in 391 ms.
Product exploration explored 100000 steps with 1549 reset in 397 ms.
Built C files in :
/tmp/ltsmin13196056121209038194
[2022-05-15 03:49:29] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13196056121209038194
Running compilation step : cd /tmp/ltsmin13196056121209038194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1871 ms.
Running link step : cd /tmp/ltsmin13196056121209038194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13196056121209038194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2109146779670590913.hoa' '--buchi-type=spotba'
LTSmin run took 3730 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-01 finished in 12752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((F(p0)&&!p1) U (X(X(!p2)) U p1)))'
Support contains 67 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 10 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:34] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:35] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
[2022-05-15 03:49:35] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-05-15 03:49:35] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:35] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 03:49:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:35] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (AND p0 p1), p1, p0, (OR (AND p1 (NOT p2)) (AND p0 p1)), (OR (AND p1 (NOT p2)) (AND p0 p1)), (OR (NOT p2) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s23 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s36 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s41 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-02 finished in 841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!X(p0) U p1))&&p2)))'
Support contains 48 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 03:49:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:35] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
[2022-05-15 03:49:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-15 03:49:35] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:49:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:36] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 361 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 968/968 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s30 1) (GEQ s52 1)) (AND (GEQ s35 1) (GEQ s52 1)) (AND (GEQ s37 1) (GEQ s52 1)) (AND (GEQ s42 1) (GEQ s52 1)) (AND (GEQ s40 1) (GEQ s52 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 BridgeAndVehicles-PT-V20P20N20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-04 finished in 908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((p0 U p0)))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 9 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:36] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
[2022-05-15 03:49:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-15 03:49:36] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:37] [INFO ] Implicit Places using invariants and state equation in 388 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 545 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 967/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s48 1) (GEQ s72 1)) (AND (GEQ s47 1) (GEQ s72 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 56964 steps with 559 reset in 190 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-05 finished in 1113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((X(p0)||p0) U p1) U G(!p2)))'
Support contains 47 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 03:49:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:37] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
[2022-05-15 03:49:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-05-15 03:49:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 03:49:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:38] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 314 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 968/968 transitions.
Stuttering acceptance computed with spot in 169 ms :[p2, true, (AND p1 (NOT p2)), p2, (AND (NOT p2) p1 p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s49 1) (AND (GEQ s10 1) (GEQ s25 1) (GEQ s26 1) (GEQ s63 1)) (AND (GEQ s11 1) (GEQ s25 1) (GEQ s26 1) (GEQ s58 1)) (AND (GEQ s12 1) (GEQ s25 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 104 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-06 finished in 827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(F(p0))))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 73 transition count 966
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 71 transition count 964
Applied a total of 9 rules in 74 ms. Remains 71 /76 variables (removed 5) and now considering 964/968 (removed 4) transitions.
[2022-05-15 03:49:38] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:38] [INFO ] Implicit Places using invariants in 124 ms returned []
[2022-05-15 03:49:38] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 03:49:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:38] [INFO ] Implicit Places using invariants and state equation in 380 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 507 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/76 places, 964/968 transitions.
Applied a total of 0 rules in 58 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/76 places, 964/968 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-08 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:(OR (AND (GEQ s1 1) (GEQ s22 1) (GEQ s28 1) (GEQ s48 1)) (AND (GEQ s39 1) (GEQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-08 finished in 724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X((X(p0)&&G(p1)))) U p2))))'
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 9 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:39] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
[2022-05-15 03:49:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:39] [INFO ] Implicit Places using invariants in 124 ms returned []
[2022-05-15 03:49:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:40] [INFO ] Implicit Places using invariants and state equation in 413 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 541 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s24 20) (GEQ s50 1)), p0:(AND (GEQ s3 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)), p2:(AND (GEQ s27 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-09 finished in 1194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(G(p0))))||X(p0))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 12 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:40] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
[2022-05-15 03:49:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:40] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-15 03:49:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:41] [INFO ] Implicit Places using invariants and state equation in 388 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 542 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 967/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s23 20) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 411 ms.
Product exploration explored 100000 steps with 33333 reset in 409 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-11 finished in 1893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F((!p0 U X(p1)))||(G(p2)&&p0)) U p3))'
Support contains 9 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 57 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:42] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
[2022-05-15 03:49:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:42] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 03:49:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2022-05-15 03:49:42] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:49:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:43] [INFO ] Implicit Places using invariants and state equation in 448 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 587 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/76 places, 967/968 transitions.
Applied a total of 0 rules in 71 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GEQ s47 1) (GEQ s53 1)), p0:(GEQ s48 1), p2:(AND (GEQ s1 1) (GEQ s23 1) (GEQ s43 1) (GEQ s66 1)), p1:(AND (GEQ s46 1) (GEQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 373 steps with 2 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-13 finished in 1123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(F(p0))))&&F(G(X(X(p1))))))'
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 73 transition count 966
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 71 transition count 964
Applied a total of 9 rules in 66 ms. Remains 71 /76 variables (removed 5) and now considering 964/968 (removed 4) transitions.
[2022-05-15 03:49:43] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:49:43] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 03:49:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:49:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:43] [INFO ] Implicit Places using invariants and state equation in 351 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 463 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/76 places, 964/968 transitions.
Applied a total of 0 rules in 45 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/76 places, 964/968 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s22 1) (GEQ s30 1) (GEQ s61 1)), p1:(OR (LT s14 1) (LT s23 1) (LT s24 1) (LT s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-14 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 968/968 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 967
Applied a total of 2 rules in 51 ms. Remains 75 /76 variables (removed 1) and now considering 967/968 (removed 1) transitions.
[2022-05-15 03:49:44] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:44] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
[2022-05-15 03:49:44] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:44] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:44] [INFO ] Implicit Places using invariants in 141 ms returned []
[2022-05-15 03:49:44] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 03:49:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:44] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 533 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/76 places, 967/968 transitions.
Applied a total of 0 rules in 60 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/76 places, 967/968 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N20-LTLFireability-15 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:(OR (LT s10 1) (LT s22 1) (LT s24 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 961 reset in 348 ms.
Product exploration explored 100000 steps with 954 reset in 359 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 145 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 967/967 transitions.
Applied a total of 0 rules in 60 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-15 03:49:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:49:46] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
[2022-05-15 03:49:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:46] [INFO ] Implicit Places using invariants in 138 ms returned []
[2022-05-15 03:49:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:49:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:47] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2022-05-15 03:49:47] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 03:49:47] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:47] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 967/967 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 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 to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 974 reset in 357 ms.
Product exploration explored 100000 steps with 940 reset in 356 ms.
Built C files in :
/tmp/ltsmin2038027675559019231
[2022-05-15 03:49:48] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-15 03:49:48] [INFO ] Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:49:48] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-15 03:49:48] [INFO ] Computation of Complete enable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:49:48] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-15 03:49:49] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:49:49] [INFO ] Built C files in 328ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2038027675559019231
Running compilation step : cd /tmp/ltsmin2038027675559019231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2038027675559019231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2038027675559019231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 967/967 transitions.
Applied a total of 0 rules in 47 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-15 03:49:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:52] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:49:52] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
[2022-05-15 03:49:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:52] [INFO ] Implicit Places using invariants in 141 ms returned []
[2022-05-15 03:49:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 03:49:52] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2022-05-15 03:49:52] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 03:49:52] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 03:49:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:49:53] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin14307556546439943540
[2022-05-15 03:49:53] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-15 03:49:53] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:49:53] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-15 03:49:53] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:49:53] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-15 03:49:53] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:49:53] [INFO ] Built C files in 242ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14307556546439943540
Running compilation step : cd /tmp/ltsmin14307556546439943540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14307556546439943540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14307556546439943540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 03:49:56] [INFO ] Flatten gal took : 49 ms
[2022-05-15 03:49:56] [INFO ] Flatten gal took : 52 ms
[2022-05-15 03:49:56] [INFO ] Time to serialize gal into /tmp/LTL1156238295789925219.gal : 10 ms
[2022-05-15 03:49:56] [INFO ] Time to serialize properties into /tmp/LTL2142223041027597997.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1156238295789925219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2142223041027597997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1156238...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((NB_ATTENTE_A_9<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"))))
Formula 0 simplified : !GF"(((NB_ATTENTE_A_9<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"
Detected timeout of ITS tools.
[2022-05-15 03:50:11] [INFO ] Flatten gal took : 42 ms
[2022-05-15 03:50:11] [INFO ] Applying decomposition
[2022-05-15 03:50:11] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3009416048793787119.txt' '-o' '/tmp/graph3009416048793787119.bin' '-w' '/tmp/graph3009416048793787119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3009416048793787119.bin' '-l' '-1' '-v' '-w' '/tmp/graph3009416048793787119.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:50:12] [INFO ] Decomposing Gal with order
[2022-05-15 03:50:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:50:12] [INFO ] Removed a total of 1832 redundant transitions.
[2022-05-15 03:50:12] [INFO ] Flatten gal took : 338 ms
[2022-05-15 03:50:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 215 labels/synchronizations in 18 ms.
[2022-05-15 03:50:12] [INFO ] Time to serialize gal into /tmp/LTL10337510868111498927.gal : 2 ms
[2022-05-15 03:50:12] [INFO ] Time to serialize properties into /tmp/LTL10717192297456756328.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10337510868111498927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10717192297456756328.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1033751...247
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i1.u3.NB_ATTENTE_A_9<1)||(i0.u0.ATTENTE_A<1))||((i0.u2.CAPACITE<1)||(u1.CONTROLEUR_1<1)))"))))
Formula 0 simplified : !GF"(((i1.u3.NB_ATTENTE_A_9<1)||(i0.u0.ATTENTE_A<1))||((i0.u2.CAPACITE<1)||(u1.CONTROLEUR_1<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14822994376572784563
[2022-05-15 03:50:27] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14822994376572784563
Running compilation step : cd /tmp/ltsmin14822994376572784563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1819 ms.
Running link step : cd /tmp/ltsmin14822994376572784563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14822994376572784563;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N20-LTLFireability-15 finished in 58665 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-15 03:50:42] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4368953534861261023
[2022-05-15 03:50:42] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2022-05-15 03:50:42] [INFO ] Applying decomposition
[2022-05-15 03:50:42] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:50:42] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2022-05-15 03:50:42] [INFO ] Flatten gal took : 36 ms
[2022-05-15 03:50:42] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7582584794007191334.txt' '-o' '/tmp/graph7582584794007191334.bin' '-w' '/tmp/graph7582584794007191334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7582584794007191334.bin' '-l' '-1' '-v' '-w' '/tmp/graph7582584794007191334.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:50:43] [INFO ] Decomposing Gal with order
[2022-05-15 03:50:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:50:43] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2022-05-15 03:50:43] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:50:43] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4368953534861261023
Running compilation step : cd /tmp/ltsmin4368953534861261023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 03:50:43] [INFO ] Removed a total of 1871 redundant transitions.
[2022-05-15 03:50:43] [INFO ] Flatten gal took : 245 ms
[2022-05-15 03:50:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 10 ms.
[2022-05-15 03:50:43] [INFO ] Time to serialize gal into /tmp/LTLFireability5112886920984006728.gal : 2 ms
[2022-05-15 03:50:43] [INFO ] Time to serialize properties into /tmp/LTLFireability8569009575365636792.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5112886920984006728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8569009575365636792.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i1.u3.NB_ATTENTE_A_9<1)||(i1.u0.ATTENTE_A<1))||((i0.u1.CAPACITE<1)||(i2.u4.CONTROLEUR_1<1)))"))))
Formula 0 simplified : !GF"(((i1.u3.NB_ATTENTE_A_9<1)||(i1.u0.ATTENTE_A<1))||((i0.u1.CAPACITE<1)||(i2.u4.CONTROLEUR_1<1)))"
Compilation finished in 3763 ms.
Running link step : cd /tmp/ltsmin4368953534861261023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin4368953534861261023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t42, t43, t45, t106, t107, t651, t653, i0.u1.t21, i0.u1.t44, i2.t149, i2.t136, Intersect...242
Computing Next relation with stutter on 40 deadlock states
Detected timeout of ITS tools.
[2022-05-15 04:11:16] [INFO ] Flatten gal took : 120 ms
[2022-05-15 04:11:16] [INFO ] Time to serialize gal into /tmp/LTLFireability18370467724005831210.gal : 24 ms
[2022-05-15 04:11:16] [INFO ] Time to serialize properties into /tmp/LTLFireability17864575103816500024.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18370467724005831210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17864575103816500024.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((G(F("(((NB_ATTENTE_A_9<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"))))
Formula 0 simplified : !GF"(((NB_ATTENTE_A_9<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"
Detected timeout of ITS tools.
[2022-05-15 04:31:50] [INFO ] Flatten gal took : 129 ms
[2022-05-15 04:31:50] [INFO ] Input system was already deterministic with 968 transitions.
[2022-05-15 04:31:50] [INFO ] Transformed 76 places.
[2022-05-15 04:31:50] [INFO ] Transformed 968 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 04:31:50] [INFO ] Time to serialize gal into /tmp/LTLFireability2353323654920877663.gal : 13 ms
[2022-05-15 04:31:50] [INFO ] Time to serialize properties into /tmp/LTLFireability10537260582992993507.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2353323654920877663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10537260582992993507.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((NB_ATTENTE_A_9<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"))))
Formula 0 simplified : !GF"(((NB_ATTENTE_A_9<1)||(ATTENTE_A<1))||((CAPACITE<1)||(CONTROLEUR_1<1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t42, t43, t44, t45, t106, t107, t109, t110, t111, t112, t113, t114, t115, t116, t117...4885
Computing Next relation with stutter on 40 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P20N20, 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 r024-tall-165251918200212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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