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.r060-tall-165254772300603.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 Dekker-PT-015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 5.7K Apr 30 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 05:15 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 3.8K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K 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 Dekker-PT-015-LTLCardinality-00
FORMULA_NAME Dekker-PT-015-LTLCardinality-01
FORMULA_NAME Dekker-PT-015-LTLCardinality-02
FORMULA_NAME Dekker-PT-015-LTLCardinality-03
FORMULA_NAME Dekker-PT-015-LTLCardinality-04
FORMULA_NAME Dekker-PT-015-LTLCardinality-05
FORMULA_NAME Dekker-PT-015-LTLCardinality-06
FORMULA_NAME Dekker-PT-015-LTLCardinality-07
FORMULA_NAME Dekker-PT-015-LTLCardinality-08
FORMULA_NAME Dekker-PT-015-LTLCardinality-09
FORMULA_NAME Dekker-PT-015-LTLCardinality-10
FORMULA_NAME Dekker-PT-015-LTLCardinality-11
FORMULA_NAME Dekker-PT-015-LTLCardinality-12
FORMULA_NAME Dekker-PT-015-LTLCardinality-13
FORMULA_NAME Dekker-PT-015-LTLCardinality-14
FORMULA_NAME Dekker-PT-015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652631160676

Running Version 202205111006
[2022-05-15 16:12:41] [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 16:12:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:12:42] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2022-05-15 16:12:42] [INFO ] Transformed 75 places.
[2022-05-15 16:12:42] [INFO ] Transformed 255 transitions.
[2022-05-15 16:12:42] [INFO ] Found NUPN structural information;
[2022-05-15 16:12:42] [INFO ] Parsed PT model containing 75 places and 255 transitions in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-015-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 17 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:42] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2022-05-15 16:12:42] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-15 16:12:42] [INFO ] Implicit Places using invariants in 226 ms returned [30, 39, 42, 45, 57, 60, 63, 66]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 269 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/75 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/75 places, 255/255 transitions.
Support contains 26 out of 67 places after structural reductions.
[2022-05-15 16:12:42] [INFO ] Flatten gal took : 53 ms
[2022-05-15 16:12:42] [INFO ] Flatten gal took : 29 ms
[2022-05-15 16:12:42] [INFO ] Input system was already deterministic with 255 transitions.
Support contains 25 out of 67 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-15 16:12:43] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:43] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 16:12:43] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-15 16:12:43] [INFO ] [Real]Absence check using 30 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-15 16:12:43] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:1
[2022-05-15 16:12:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 16:12:43] [INFO ] After 5ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :3 sat :1 real:1
[2022-05-15 16:12:43] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-15 16:12:43] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :1 real:1
[2022-05-15 16:12:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2022-05-15 16:12:43] [INFO ] [Nat]Absence check using 30 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-15 16:12:43] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-05-15 16:12:43] [INFO ] After 9ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 16:12:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 334 ms
[2022-05-15 16:12:43] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 16:12:43] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 18 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1457792 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1457792 steps, saw 109418 distinct states, run finished after 3005 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 16:12:47] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:47] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-15 16:12:47] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2022-05-15 16:12:47] [INFO ] [Real]Absence check using 30 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-15 16:12:47] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:12:47] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 16:12:47] [INFO ] After 7ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:12:47] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 16:12:47] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:12:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-15 16:12:47] [INFO ] [Nat]Absence check using 30 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-15 16:12:47] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:12:47] [INFO ] After 13ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 8 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 16:12:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 235 ms
[2022-05-15 16:12:47] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-15 16:12:47] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 255/255 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:47] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:47] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 16:12:47] [INFO ] Implicit Places using invariants in 90 ms returned [32, 44, 47, 50, 61, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 91 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 61/67 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/67 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1697440 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :{}
Probabilistic random walk after 1697440 steps, saw 116416 distinct states, run finished after 3001 ms. (steps per millisecond=565 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 16:12:50] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2022-05-15 16:12:50] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-15 16:12:50] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2022-05-15 16:12:50] [INFO ] [Real]Absence check using 30 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:12:50] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 16:12:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 16:12:50] [INFO ] After 4ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 16:12:50] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 16:12:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-15 16:12:50] [INFO ] [Nat]Absence check using 30 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:12:51] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 16:12:51] [INFO ] After 11ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 16:12:51] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-15 16:12:51] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 255/255 transitions.
Applied a total of 0 rules in 13 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 255/255 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2022-05-15 16:12:51] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-15 16:12:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-15 16:12:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2022-05-15 16:12:51] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-15 16:12:51] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 16:12:51] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2022-05-15 16:12:51] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-15 16:12:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2022-05-15 16:12:51] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-15 16:12:51] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 255/255 transitions.
Graph (complete) has 95 edges and 61 vertex of which 9 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.3 ms
Discarding 52 places :
Also discarding 221 output transitions
Drop transitions removed 221 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 8 transition count 8
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 1 with 3 rules applied. Total rules applied 31 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 4 transition count 4
Applied a total of 36 rules in 7 ms. Remains 4 /61 variables (removed 57) and now considering 4/255 (removed 251) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 16:12:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:12:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:12:51] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 16:12:51] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-15 16:12:51] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2022-05-15 16:12:51] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:12:51] [INFO ] Flatten gal took : 0 ms
[2022-05-15 16:12:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality845863744163055992.gal : 1 ms
[2022-05-15 16:12:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality328400408583763461.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6852639917109946650;'/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/ReachabilityCardinality845863744163055992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality328400408583763461.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...317
Loading property file /tmp/ReachabilityCardinality328400408583763461.prop.
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,0.011997,3720,2,7,5,25,8,0,26,14,0
Total reachable state count : 4

Verifying 2 reachability properties.
Reachability property AtomicPropp7 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
AtomicPropp7,2,0.012148,3720,2,6,6,25,8,0,28,14,0
Reachability property AtomicPropp14 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
AtomicPropp14,1,0.012313,3720,2,5,7,25,8,0,29,14,0
FORMULA Dekker-PT-015-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Dekker-PT-015-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA Dekker-PT-015-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(p0) U (!(X(p1)&&p2)&&X(p1)))))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:51] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 16:12:51] [INFO ] Implicit Places using invariants in 95 ms returned [35, 44, 47, 50, 61, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 96 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/67 places, 255/255 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) p2), (NOT p1), (AND p1 p2)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(NEQ s32 1), p0:(OR (EQ s59 0) (EQ s41 1)), p1:(OR (EQ s37 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27870 reset in 429 ms.
Stack based approach found an accepted trace after 486 steps with 139 reset with depth 9 and stack size 9 in 2 ms.
FORMULA Dekker-PT-015-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-01 finished in 871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:52] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:52] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 16:12:52] [INFO ] Implicit Places using invariants in 85 ms returned [32, 35, 44, 47, 50, 61, 64]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 255/255 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s43 1), p0:(OR (EQ s6 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLCardinality-03 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||X(G(F(p0))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 11 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:52] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:52] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 16:12:52] [INFO ] Implicit Places using invariants in 108 ms returned [32, 35, 44, 47, 50, 61, 64]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 109 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/67 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 255/255 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-05 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:(AND (EQ s33 0) (EQ s27 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 5432 reset in 309 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-05 finished in 565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:53] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 16:12:53] [INFO ] Implicit Places using invariants in 102 ms returned [32, 35, 44, 47, 50, 61, 64]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 115 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 255/255 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (NEQ s30 0) (NEQ s10 1)) (AND (NEQ s42 0) (NEQ s41 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLCardinality-06 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:53] [INFO ] Computed 37 place invariants in 12 ms
[2022-05-15 16:12:53] [INFO ] Implicit Places using invariants in 102 ms returned [32, 35, 44, 47, 50, 61]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 103 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/67 places, 255/255 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s50 0) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32686 reset in 260 ms.
Stack based approach found an accepted trace after 185 steps with 58 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Dekker-PT-015-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-13 finished in 502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p0))&&p1))&&X(G(X(p0)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2022-05-15 16:12:54] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 67 cols
[2022-05-15 16:12:54] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 16:12:54] [INFO ] Implicit Places using invariants in 149 ms returned [32, 44, 47, 50, 61, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 156 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/67 places, 255/255 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s34 0) (EQ s44 1)), p1:(OR (EQ s32 0) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-015-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLCardinality-15 finished in 425 ms.
All properties solved by simple procedures.
Total runtime 12703 ms.

BK_STOP 1652631174576

--------------------
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="Dekker-PT-015"
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 Dekker-PT-015, 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 r060-tall-165254772300603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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