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-165251918100163.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-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 11K Apr 29 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 21:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 21:14 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 5.3K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 9 07:06 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 37K 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-V04P05N02-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652578528705

Running Version 202205111006
[2022-05-15 01:35:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 01:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 01:35:30] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2022-05-15 01:35:30] [INFO ] Transformed 28 places.
[2022-05-15 01:35:30] [INFO ] Transformed 52 transitions.
[2022-05-15 01:35:30] [INFO ] Parsed PT model containing 28 places and 52 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 15 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:35:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 01:35:30] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-15 01:35:30] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
[2022-05-15 01:35:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 01:35:30] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:35:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-15 01:35:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 01:35:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:35:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-15 01:35:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 01:35:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:35:30] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 52/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/28 places, 52/52 transitions.
Support contains 14 out of 27 places after structural reductions.
[2022-05-15 01:35:30] [INFO ] Flatten gal took : 24 ms
[2022-05-15 01:35:30] [INFO ] Flatten gal took : 10 ms
[2022-05-15 01:35:30] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:35:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 01:35:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:35:31] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:35:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2022-05-15 01:35:31] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:35:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:31] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:35:31] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 01:35:31] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 145 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 13 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:35:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/27 places, 51/52 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 36 ms. (steps per millisecond=278 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 14 ms. (steps per millisecond=716 ) properties seen :0
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 18 stabilizing places and 20 stable transitions
Graph (complete) has 213 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:35:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2022-05-15 01:35:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:31] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:35:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-15 01:35:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:35:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:31] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 115 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/27 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-00 finished in 1018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p0)||G(p1)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 213 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
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 6 place count 23 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 48
Applied a total of 10 rules in 12 ms. Remains 21 /27 variables (removed 6) and now considering 48/52 (removed 4) transitions.
[2022-05-15 01:35:32] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2022-05-15 01:35:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 01:35:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-15 01:35:32] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2022-05-15 01:35:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:35:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/27 places, 48/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/27 places, 48/52 transitions.
Stuttering acceptance computed with spot in 1059 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s13), p1:(LEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26592 reset in 198 ms.
Product exploration explored 100000 steps with 26640 reset in 142 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Computed a total of 13 stabilizing places and 18 stable transitions
Detected a total of 13/20 stabilizing places and 18/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:35:34] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 20 cols
[2022-05-15 01:35:34] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 01:35:34] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 522 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01 finished in 2536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((X(F(G(F(p0))))||X(!p0)||p1)))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:35:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:35] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 88 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/27 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 204 ms :[false, false, false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 1 (ADD s17 s18)), p0:(GT (ADD s17 s18) (ADD s15 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2508 steps with 111 reset in 12 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(p0))))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(X(F((p0||G(p1)))))))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 51
Applied a total of 2 rules in 5 ms. Remains 26 /27 variables (removed 1) and now considering 51/52 (removed 1) transitions.
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 26 cols
[2022-05-15 01:35:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:35:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 26 cols
[2022-05-15 01:35:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:35:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-15 01:35:35] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 26 cols
[2022-05-15 01:35:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:35:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 51/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s1 s6), p0:(LEQ s16 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3266 reset in 152 ms.
Product exploration explored 100000 steps with 3218 reset in 177 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 199 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Detected a total of 16/25 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 335 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2022-05-15 01:35:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:37] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2022-05-15 01:35:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 01:35:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:37] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-15 01:35:37] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 01:35:37] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2022-05-15 01:35:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 51/51 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 199 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Detected a total of 16/25 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 80 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3223 reset in 111 ms.
Product exploration explored 100000 steps with 3269 reset in 136 ms.
Built C files in :
/tmp/ltsmin3599403816441290427
[2022-05-15 01:35:38] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-15 01:35:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:35:38] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-15 01:35:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:35:38] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-15 01:35:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:35:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3599403816441290427
Running compilation step : cd /tmp/ltsmin3599403816441290427;'/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 242 ms.
Running link step : cd /tmp/ltsmin3599403816441290427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3599403816441290427;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased900352557874508844.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 finished in 3072 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !((p1 U G(!p1))||X(!p1)||p0)))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 2 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:35:38] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:38] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2022-05-15 01:35:38] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-15 01:35:38] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s7 s6), p1:(GT 2 s21)], 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 88 steps with 2 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0)||p1)&&p2) U X(p3)))'
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:35:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2022-05-15 01:35:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 01:35:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:39] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-05-15 01:35:39] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/27 places, 52/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p3) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GT s7 s1) (LEQ s6 s16)), p1:(GT s6 s16), p3:(LEQ s7 s1), p0:(AND (LEQ s20 s22) (LEQ s6 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/26 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p3 p0), (X p3), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND p2 (NOT p1) (NOT p3) p0))), (X (NOT (AND p2 p1 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p1 (NOT p3) p0))), (X (X p3)), true, (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 21 factoid took 293 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13 finished in 979 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((true U X(p0)))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 213 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:35:40] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:40] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2022-05-15 01:35:40] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 01:35:40] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2022-05-15 01:35:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:40] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 52/52 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 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:(LEQ s6 s17)], 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 6383 reset in 97 ms.
Product exploration explored 100000 steps with 6483 reset in 101 ms.
Computed a total of 15 stabilizing places and 20 stable transitions
Computed a total of 15 stabilizing places and 20 stable transitions
Detected a total of 15/24 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2022-05-15 01:35:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2022-05-15 01:35:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2022-05-15 01:35:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2022-05-15 01:35:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-15 01:35:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2022-05-15 01:35:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:35:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-15 01:35:41] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 01:35:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 24 cols
[2022-05-15 01:35:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:35:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 52/52 transitions.
Computed a total of 15 stabilizing places and 20 stable transitions
Computed a total of 15 stabilizing places and 20 stable transitions
Detected a total of 15/24 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 445 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 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6413 reset in 108 ms.
Product exploration explored 100000 steps with 6434 reset in 101 ms.
Built C files in :
/tmp/ltsmin3148274569792179315
[2022-05-15 01:35:42] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-15 01:35:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:35:42] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-15 01:35:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:35:42] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-15 01:35:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:35:42] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3148274569792179315
Running compilation step : cd /tmp/ltsmin3148274569792179315;'/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 146 ms.
Running link step : cd /tmp/ltsmin3148274569792179315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3148274569792179315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13147224165649231181.hoa' '--buchi-type=spotba'
LTSmin run took 100 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 finished in 2566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(F(G(p0)))))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 213 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
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 6 place count 23 transition count 50
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 10 place count 21 transition count 48
Applied a total of 10 rules in 8 ms. Remains 21 /27 variables (removed 6) and now considering 48/52 (removed 4) transitions.
[2022-05-15 01:35:42] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2022-05-15 01:35:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:35:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-15 01:35:42] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 21 cols
[2022-05-15 01:35:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:35:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 01:35:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [6, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 76 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/27 places, 48/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/27 places, 48/52 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15 finished in 126 ms.
All properties solved by simple procedures.
Total runtime 12894 ms.

BK_STOP 1652578542799

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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-V04P05N02"
export BK_EXAMINATION="LTLCardinality"
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-V04P05N02, examination is LTLCardinality"
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-165251918100163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;