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.r550-tall-171734898700147.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 CO4-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 332K Jun 2 16: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 CO4-PT-19-LTLCardinality-00
FORMULA_NAME CO4-PT-19-LTLCardinality-01
FORMULA_NAME CO4-PT-19-LTLCardinality-02
FORMULA_NAME CO4-PT-19-LTLCardinality-03
FORMULA_NAME CO4-PT-19-LTLCardinality-04
FORMULA_NAME CO4-PT-19-LTLCardinality-05
FORMULA_NAME CO4-PT-19-LTLCardinality-06
FORMULA_NAME CO4-PT-19-LTLCardinality-07
FORMULA_NAME CO4-PT-19-LTLCardinality-08
FORMULA_NAME CO4-PT-19-LTLCardinality-09
FORMULA_NAME CO4-PT-19-LTLCardinality-10
FORMULA_NAME CO4-PT-19-LTLCardinality-11
FORMULA_NAME CO4-PT-19-LTLCardinality-12
FORMULA_NAME CO4-PT-19-LTLCardinality-13
FORMULA_NAME CO4-PT-19-LTLCardinality-14
FORMULA_NAME CO4-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717355310118

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 19:08:31] [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-06-02 19:08:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:08:31] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-02 19:08:31] [INFO ] Transformed 1174 places.
[2024-06-02 19:08:31] [INFO ] Transformed 1447 transitions.
[2024-06-02 19:08:31] [INFO ] Found NUPN structural information;
[2024-06-02 19:08:31] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 274 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-19-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 164 places :
Symmetric choice reduction at 1 with 164 rule applications. Total rules 197 place count 784 transition count 999
Iterating global reduction 1 with 164 rules applied. Total rules applied 361 place count 784 transition count 999
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 505 place count 640 transition count 851
Iterating global reduction 1 with 144 rules applied. Total rules applied 649 place count 640 transition count 851
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 657 place count 640 transition count 843
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 725 place count 572 transition count 769
Iterating global reduction 2 with 68 rules applied. Total rules applied 793 place count 572 transition count 769
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 796 place count 572 transition count 766
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 840 place count 528 transition count 722
Iterating global reduction 3 with 44 rules applied. Total rules applied 884 place count 528 transition count 722
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 892 place count 528 transition count 714
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 911 place count 509 transition count 695
Iterating global reduction 4 with 19 rules applied. Total rules applied 930 place count 509 transition count 695
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 932 place count 509 transition count 693
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 938 place count 503 transition count 687
Iterating global reduction 5 with 6 rules applied. Total rules applied 944 place count 503 transition count 687
Applied a total of 944 rules in 259 ms. Remains 503 /973 variables (removed 470) and now considering 687/1173 (removed 486) transitions.
// Phase 1: matrix 687 rows 503 cols
[2024-06-02 19:08:31] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 19:08:32] [INFO ] Implicit Places using invariants in 440 ms returned [6, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 473 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/973 places, 687/1173 transitions.
Applied a total of 0 rules in 20 ms. Remains 501 /501 variables (removed 0) and now considering 687/687 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 769 ms. Remains : 501/973 places, 687/1173 transitions.
Support contains 10 out of 501 places after structural reductions.
[2024-06-02 19:08:32] [INFO ] Flatten gal took : 68 ms
[2024-06-02 19:08:32] [INFO ] Flatten gal took : 33 ms
[2024-06-02 19:08:32] [INFO ] Input system was already deterministic with 687 transitions.
RANDOM walk for 40000 steps (823 resets) in 946 ms. (42 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (139 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (144 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (139 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (142 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
// Phase 1: matrix 687 rows 501 cols
[2024-06-02 19:08:33] [INFO ] Computed 5 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 86/110 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 330/440 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/457 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 16/473 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 428/901 variables, 213/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 209/1110 variables, 122/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 59/1169 variables, 36/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1169 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 18/1187 variables, 12/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1187 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/1188 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1188 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1188 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 506 constraints, problems are : Problem set: 0 solved, 4 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 86/110 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 330/440 variables, 88/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 17/457 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 16/473 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 428/901 variables, 213/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 209/1110 variables, 122/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 59/1169 variables, 36/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1169 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 18/1187 variables, 12/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1187 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1/1188 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1188 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1188 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1188/1188 variables, and 510 constraints, problems are : Problem set: 0 solved, 4 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 108 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=21 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 10 ms.
Computed a total of 18 stabilizing places and 21 stable transitions
Graph (complete) has 976 edges and 501 vertex of which 496 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 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(G(p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 496 transition count 682
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 496 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 496 transition count 681
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 493 transition count 678
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 493 transition count 678
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 490 transition count 675
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 490 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 490 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 489 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 489 transition count 673
Applied a total of 26 rules in 29 ms. Remains 489 /501 variables (removed 12) and now considering 673/687 (removed 14) transitions.
// Phase 1: matrix 673 rows 489 cols
[2024-06-02 19:08:35] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:08:35] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 19:08:35] [INFO ] Invariant cache hit.
[2024-06-02 19:08:35] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-02 19:08:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (OVERLAPS) 673/1162 variables, 489/494 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:08:59] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 25 ms to minimize.
[2024-06-02 19:08:59] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-06-02 19:08:59] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:09:00] [INFO ] Deduced a trap composed of 188 places in 86 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1162/1162 variables, and 498 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 673/1162 variables, 489/498 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1162 variables, 672/1170 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-02 19:09:20] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1162/1162 variables, and 1171 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 5/5 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Starting structural reductions in LTL mode, iteration 1 : 489/501 places, 673/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60792 ms. Remains : 489/501 places, 673/687 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CO4-PT-19-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-00 finished in 61078 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(p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 496 transition count 682
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 496 transition count 682
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 494 transition count 680
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 494 transition count 680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 492 transition count 678
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 492 transition count 678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 490 transition count 676
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 490 transition count 676
Applied a total of 22 rules in 28 ms. Remains 490 /501 variables (removed 11) and now considering 676/687 (removed 11) transitions.
// Phase 1: matrix 676 rows 490 cols
[2024-06-02 19:09:36] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:09:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 19:09:36] [INFO ] Invariant cache hit.
[2024-06-02 19:09:36] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 675 sub problems to find dead transitions.
[2024-06-02 19:09:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-02 19:09:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:09:50] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (OVERLAPS) 676/1166 variables, 490/497 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-02 19:10:01] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:10:01] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:10:02] [INFO ] Deduced a trap composed of 188 places in 108 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 500 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (OVERLAPS) 676/1166 variables, 490/500 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1166 variables, 675/1175 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 1175 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 5/5 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 490/501 places, 676/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 490/501 places, 676/687 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 347 ms.
Product exploration explored 100000 steps with 33333 reset in 228 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 965 edges and 490 vertex of which 485 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLCardinality-09 finished in 61475 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(F(p0))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 494 transition count 680
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 494 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 494 transition count 679
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 491 transition count 676
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 491 transition count 676
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 488 transition count 673
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 488 transition count 673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 488 transition count 672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 486 transition count 670
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 486 transition count 670
Applied a total of 32 rules in 43 ms. Remains 486 /501 variables (removed 15) and now considering 670/687 (removed 17) transitions.
// Phase 1: matrix 670 rows 486 cols
[2024-06-02 19:10:37] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:10:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 19:10:37] [INFO ] Invariant cache hit.
[2024-06-02 19:10:38] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 669 sub problems to find dead transitions.
[2024-06-02 19:10:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/486 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (OVERLAPS) 670/1156 variables, 486/491 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-02 19:11:00] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:11:00] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:11:01] [INFO ] Deduced a trap composed of 187 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1156/1156 variables, and 494 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/486 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 670/1156 variables, 486/494 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1156 variables, 669/1163 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-06-02 19:11:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1156/1156 variables, and 1164 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 4/4 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 486/501 places, 670/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60676 ms. Remains : 486/501 places, 670/687 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 129 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 959 edges and 486 vertex of which 481 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-19-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-19-LTLCardinality-11 finished in 61082 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(p0)))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 495 transition count 681
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 495 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 495 transition count 680
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 492 transition count 677
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 492 transition count 677
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 489 transition count 674
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 489 transition count 674
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 489 transition count 673
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 487 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 487 transition count 671
Applied a total of 30 rules in 27 ms. Remains 487 /501 variables (removed 14) and now considering 671/687 (removed 16) transitions.
// Phase 1: matrix 671 rows 487 cols
[2024-06-02 19:11:38] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:11:38] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:11:39] [INFO ] Invariant cache hit.
[2024-06-02 19:11:39] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-02 19:11:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 19:11:52] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:11:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/494 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-02 19:12:02] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:12:03] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:12:04] [INFO ] Deduced a trap composed of 187 places in 98 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 497 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/497 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 670/1167 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1167 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 5/5 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 487/501 places, 671/687 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 487/501 places, 671/687 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-19-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-12 finished in 60988 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((G(F(!p0)) U p1))))'
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 687/687 transitions.
Graph (trivial) has 536 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 974 edges and 499 vertex of which 494 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 493 transition count 468
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 212 rules applied. Total rules applied 424 place count 283 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 425 place count 282 transition count 466
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 425 place count 282 transition count 417
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 523 place count 233 transition count 417
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 524 place count 232 transition count 416
Iterating global reduction 3 with 1 rules applied. Total rules applied 525 place count 232 transition count 416
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 697 place count 146 transition count 303
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 709 place count 146 transition count 291
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 717 place count 138 transition count 278
Iterating global reduction 4 with 8 rules applied. Total rules applied 725 place count 138 transition count 278
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 4 with 2 rules applied. Total rules applied 727 place count 137 transition count 277
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 728 place count 136 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 729 place count 136 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 730 place count 136 transition count 274
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 808 place count 97 transition count 316
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 827 place count 97 transition count 297
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 852 place count 72 transition count 197
Iterating global reduction 6 with 25 rules applied. Total rules applied 877 place count 72 transition count 197
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 894 place count 72 transition count 180
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 899 place count 67 transition count 154
Iterating global reduction 7 with 5 rules applied. Total rules applied 904 place count 67 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 908 place count 67 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 912 place count 65 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 950 place count 65 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 952 place count 63 transition count 134
Applied a total of 952 rules in 101 ms. Remains 63 /501 variables (removed 438) and now considering 134/687 (removed 553) transitions.
[2024-06-02 19:12:39] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
// Phase 1: matrix 109 rows 63 cols
[2024-06-02 19:12:39] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:12:40] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:12:40] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 19:12:40] [INFO ] Invariant cache hit.
[2024-06-02 19:12:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 19:12:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-06-02 19:12:40] [INFO ] Redundant transitions in 7 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-02 19:12:40] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 19:12:40] [INFO ] Invariant cache hit.
[2024-06-02 19:12:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 108/171 variables, 63/68 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 1/172 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 71 constraints, problems are : Problem set: 0 solved, 114 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 108/171 variables, 63/68 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 114/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 185 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2238 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 4076ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 4078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/501 places, 134/687 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4307 ms. Remains : 63/501 places, 134/687 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-13
Product exploration explored 100000 steps with 290 reset in 115 ms.
Product exploration explored 100000 steps with 270 reset in 109 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 12826 steps (1035 resets) in 189 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-06-02 19:12:45] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 19:12:45] [INFO ] Invariant cache hit.
[2024-06-02 19:12:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 19:12:45] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 19:12:45] [INFO ] Invariant cache hit.
[2024-06-02 19:12:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 19:12:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-02 19:12:45] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-02 19:12:45] [INFO ] Flow matrix only has 109 transitions (discarded 25 similar events)
[2024-06-02 19:12:45] [INFO ] Invariant cache hit.
[2024-06-02 19:12:45] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 108/171 variables, 63/68 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 1/172 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 71 constraints, problems are : Problem set: 0 solved, 114 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 108/171 variables, 63/68 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 114/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/172 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 185 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2209 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 4042ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 4043ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4170 ms. Remains : 63/63 places, 134/134 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 4712 steps (379 resets) in 33 ms. (138 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 5 reset in 45 ms.
Product exploration explored 100000 steps with 109 reset in 166 ms.
Built C files in :
/tmp/ltsmin7394901691670851360
[2024-06-02 19:12:51] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2024-06-02 19:12:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:12:51] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2024-06-02 19:12:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:12:51] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2024-06-02 19:12:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 19:12:51] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7394901691670851360
Running compilation step : cd /tmp/ltsmin7394901691670851360;'/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 423 ms.
Running link step : cd /tmp/ltsmin7394901691670851360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7394901691670851360;'/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/stateBased18096187000191488757.hoa' '--buchi-type=spotba'
LTSmin run took 485 ms.
FORMULA CO4-PT-19-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLCardinality-13 finished in 12232 ms.
All properties solved by simple procedures.
Total runtime 260843 ms.

BK_STOP 1717355572143

--------------------
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="CO4-PT-19"
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 CO4-PT-19, 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 r550-tall-171734898700147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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