Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r114-smll-171624275300115.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DLCround-PT-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275300115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 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 DLCround-PT-03a-LTLCardinality-00
FORMULA_NAME DLCround-PT-03a-LTLCardinality-01
FORMULA_NAME DLCround-PT-03a-LTLCardinality-02
FORMULA_NAME DLCround-PT-03a-LTLCardinality-03
FORMULA_NAME DLCround-PT-03a-LTLCardinality-04
FORMULA_NAME DLCround-PT-03a-LTLCardinality-05
FORMULA_NAME DLCround-PT-03a-LTLCardinality-06
FORMULA_NAME DLCround-PT-03a-LTLCardinality-07
FORMULA_NAME DLCround-PT-03a-LTLCardinality-08
FORMULA_NAME DLCround-PT-03a-LTLCardinality-09
FORMULA_NAME DLCround-PT-03a-LTLCardinality-10
FORMULA_NAME DLCround-PT-03a-LTLCardinality-11
FORMULA_NAME DLCround-PT-03a-LTLCardinality-12
FORMULA_NAME DLCround-PT-03a-LTLCardinality-13
FORMULA_NAME DLCround-PT-03a-LTLCardinality-14
FORMULA_NAME DLCround-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716336189394

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:03:11] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-22 00:03:11] [INFO ] Transformed 113 places.
[2024-05-22 00:03:11] [INFO ] Transformed 617 transitions.
[2024-05-22 00:03:11] [INFO ] Found NUPN structural information;
[2024-05-22 00:03:11] [INFO ] Parsed PT model containing 113 places and 617 transitions and 2269 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-03a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 545/545 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 489
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 105 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 1 with 144 rules applied. Total rules applied 162 place count 105 transition count 343
Applied a total of 162 rules in 72 ms. Remains 105 /113 variables (removed 8) and now considering 343/545 (removed 202) transitions.
[2024-05-22 00:03:12] [INFO ] Flow matrix only has 96 transitions (discarded 247 similar events)
// Phase 1: matrix 96 rows 105 cols
[2024-05-22 00:03:12] [INFO ] Computed 52 invariants in 29 ms
[2024-05-22 00:03:12] [INFO ] Implicit Places using invariants in 597 ms returned [61, 63, 66, 67, 68, 71, 72, 73, 75, 76, 78, 80, 81, 82, 83, 87, 88, 89, 90, 91, 92, 93, 94, 95, 97, 98, 99, 101, 102, 103, 104]
Discarding 31 places :
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Implicit Place search using SMT only with invariants took 648 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/113 places, 200/545 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 74 transition count 127
Applied a total of 73 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 127/200 (removed 73) transitions.
[2024-05-22 00:03:12] [INFO ] Flow matrix only has 96 transitions (discarded 31 similar events)
// Phase 1: matrix 96 rows 74 cols
[2024-05-22 00:03:12] [INFO ] Computed 21 invariants in 4 ms
[2024-05-22 00:03:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 00:03:12] [INFO ] Flow matrix only has 96 transitions (discarded 31 similar events)
[2024-05-22 00:03:12] [INFO ] Invariant cache hit.
[2024-05-22 00:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:13] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 74/113 places, 127/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1027 ms. Remains : 74/113 places, 127/545 transitions.
Support contains 32 out of 74 places after structural reductions.
[2024-05-22 00:03:13] [INFO ] Flatten gal took : 70 ms
[2024-05-22 00:03:13] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:03:13] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 30 out of 74 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2259 ms. (17 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
[2024-05-22 00:03:14] [INFO ] Flow matrix only has 96 transitions (discarded 31 similar events)
[2024-05-22 00:03:14] [INFO ] Invariant cache hit.
[2024-05-22 00:03:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/41 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 33/74 variables, 11/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 95/169 variables, 74/95 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 96 constraints, problems are : Problem set: 1 solved, 5 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Int declared 21/170 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/74 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 604ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-03a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 1 stable transitions
Graph (complete) has 147 edges and 74 vertex of which 61 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
FORMULA DLCround-PT-03a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 127/127 transitions.
Graph (trivial) has 126 edges and 74 vertex of which 60 / 74 are part of one of the 8 SCC in 5 ms
Free SCC test removed 52 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Graph (complete) has 29 edges and 22 vertex of which 10 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 9 place count 3 transition count 2
Iterating global reduction 0 with 7 rules applied. Total rules applied 16 place count 3 transition count 2
Applied a total of 16 rules in 25 ms. Remains 3 /74 variables (removed 71) and now considering 2/127 (removed 125) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-22 00:03:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 00:03:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 00:03:15] [INFO ] Invariant cache hit.
[2024-05-22 00:03:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-22 00:03:15] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 00:03:15] [INFO ] Invariant cache hit.
[2024-05-22 00:03:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/74 places, 2/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 3/74 places, 2/127 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-03a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 353 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-22 00:03:17] [INFO ] Invariant cache hit.
[2024-05-22 00:03:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 00:03:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-22 00:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 00:03:17] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 00:03:17] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 2/2 transitions.
Applied a total of 0 rules in 2 ms. Remains 3 /3 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-22 00:03:17] [INFO ] Invariant cache hit.
[2024-05-22 00:03:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 00:03:17] [INFO ] Invariant cache hit.
[2024-05-22 00:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-22 00:03:17] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 00:03:17] [INFO ] Invariant cache hit.
[2024-05-22 00:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 3/3 places, 2/2 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-05-22 00:03:17] [INFO ] Invariant cache hit.
[2024-05-22 00:03:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 00:03:17] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-22 00:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 00:03:17] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-22 00:03:17] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 166 ms.
Built C files in :
/tmp/ltsmin4233144392297331782
[2024-05-22 00:03:18] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-22 00:03:18] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:03:18] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-22 00:03:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:03:18] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-22 00:03:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:03:18] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4233144392297331782
Running compilation step : cd /tmp/ltsmin4233144392297331782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 420 ms.
Running link step : cd /tmp/ltsmin4233144392297331782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4233144392297331782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9070839337889350958.hoa' '--buchi-type=spotba'
LTSmin run took 326 ms.
FORMULA DLCround-PT-03a-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCround-PT-03a-LTLCardinality-03 finished in 3826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 127/127 transitions.
Graph (trivial) has 113 edges and 74 vertex of which 50 / 74 are part of one of the 8 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 54 edges and 32 vertex of which 19 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 12 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 11 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 10 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 10 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 10 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 10 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 31 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 32 place count 8 transition count 12
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 6 with 2 rules applied. Total rules applied 34 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 35 place count 7 transition count 10
Applied a total of 35 rules in 21 ms. Remains 7 /74 variables (removed 67) and now considering 10/127 (removed 117) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-22 00:03:19] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 00:03:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 00:03:19] [INFO ] Invariant cache hit.
[2024-05-22 00:03:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-22 00:03:19] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 00:03:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/74 places, 10/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 7/74 places, 10/127 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-03a-LTLCardinality-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLCardinality-06 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 127/127 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 127
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 55 transition count 115
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 55 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 55 transition count 114
Applied a total of 26 rules in 8 ms. Remains 55 /74 variables (removed 19) and now considering 114/127 (removed 13) transitions.
[2024-05-22 00:03:19] [INFO ] Flow matrix only has 89 transitions (discarded 25 similar events)
// Phase 1: matrix 89 rows 55 cols
[2024-05-22 00:03:19] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 00:03:19] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 00:03:19] [INFO ] Flow matrix only has 89 transitions (discarded 25 similar events)
[2024-05-22 00:03:19] [INFO ] Invariant cache hit.
[2024-05-22 00:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:20] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 00:03:20] [INFO ] Flow matrix only has 89 transitions (discarded 25 similar events)
[2024-05-22 00:03:20] [INFO ] Invariant cache hit.
[2024-05-22 00:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/144 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 64 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3559 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 113/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/144 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 177 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 6226ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6232ms
Starting structural reductions in LTL mode, iteration 1 : 55/74 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6395 ms. Remains : 55/74 places, 114/127 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DLCround-PT-03a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 257 steps with 0 reset in 7 ms.
FORMULA DLCround-PT-03a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLCardinality-09 finished in 6618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 127/127 transitions.
Graph (trivial) has 112 edges and 74 vertex of which 52 / 74 are part of one of the 7 SCC in 0 ms
Free SCC test removed 45 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (complete) has 45 edges and 29 vertex of which 16 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 16 transition count 23
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 14 transition count 22
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 11 transition count 19
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 11 transition count 19
Applied a total of 13 rules in 6 ms. Remains 11 /74 variables (removed 63) and now considering 19/127 (removed 108) transitions.
[2024-05-22 00:03:26] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
// Phase 1: matrix 12 rows 11 cols
[2024-05-22 00:03:26] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 00:03:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 00:03:26] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 00:03:26] [INFO ] Invariant cache hit.
[2024-05-22 00:03:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 00:03:26] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 00:03:26] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 00:03:26] [INFO ] Invariant cache hit.
[2024-05-22 00:03:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 11/22 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 11/22 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/74 places, 19/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 11/74 places, 19/127 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-03a-LTLCardinality-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLCardinality-10 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G((F(!p1)&&X(p2)))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 127/127 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 18 place count 56 transition count 111
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 56 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 56 transition count 109
Applied a total of 28 rules in 3 ms. Remains 56 /74 variables (removed 18) and now considering 109/127 (removed 18) transitions.
[2024-05-22 00:03:27] [INFO ] Flow matrix only has 86 transitions (discarded 23 similar events)
// Phase 1: matrix 86 rows 56 cols
[2024-05-22 00:03:27] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 00:03:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 00:03:27] [INFO ] Flow matrix only has 86 transitions (discarded 23 similar events)
[2024-05-22 00:03:27] [INFO ] Invariant cache hit.
[2024-05-22 00:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:27] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-22 00:03:27] [INFO ] Flow matrix only has 86 transitions (discarded 23 similar events)
[2024-05-22 00:03:27] [INFO ] Invariant cache hit.
[2024-05-22 00:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 85/141 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 68 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3759 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 85/141 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 108/175 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 176 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6237ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6239ms
Starting structural reductions in LTL mode, iteration 1 : 56/74 places, 109/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6385 ms. Remains : 56/74 places, 109/127 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) p1), (NOT p2), (AND p0 (NOT p2)), p1, p0]
Running random walk in product with property : DLCround-PT-03a-LTLCardinality-13
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLCardinality-13 finished in 6665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 127/127 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 127
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 54 transition count 113
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 54 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 54 transition count 111
Applied a total of 29 rules in 14 ms. Remains 54 /74 variables (removed 20) and now considering 111/127 (removed 16) transitions.
[2024-05-22 00:03:33] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-22 00:03:33] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 00:03:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 00:03:33] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
[2024-05-22 00:03:33] [INFO ] Invariant cache hit.
[2024-05-22 00:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 00:03:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-22 00:03:33] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
[2024-05-22 00:03:33] [INFO ] Invariant cache hit.
[2024-05-22 00:03:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 86/140 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/141 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 63 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3127 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 86/140 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 110/172 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 173 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6334ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6336ms
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 111/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6472 ms. Remains : 54/74 places, 111/127 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-03a-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLCardinality-15 finished in 6623 ms.
All properties solved by simple procedures.
Total runtime 29099 ms.

BK_STOP 1716336220458

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCround-PT-03a"
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-5568"
echo " Executing tool itstools"
echo " Input is DLCround-PT-03a, 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 r114-smll-171624275300115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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