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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 132K 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-10-LTLCardinality-00
FORMULA_NAME CO4-PT-10-LTLCardinality-01
FORMULA_NAME CO4-PT-10-LTLCardinality-02
FORMULA_NAME CO4-PT-10-LTLCardinality-03
FORMULA_NAME CO4-PT-10-LTLCardinality-04
FORMULA_NAME CO4-PT-10-LTLCardinality-05
FORMULA_NAME CO4-PT-10-LTLCardinality-06
FORMULA_NAME CO4-PT-10-LTLCardinality-07
FORMULA_NAME CO4-PT-10-LTLCardinality-08
FORMULA_NAME CO4-PT-10-LTLCardinality-09
FORMULA_NAME CO4-PT-10-LTLCardinality-10
FORMULA_NAME CO4-PT-10-LTLCardinality-11
FORMULA_NAME CO4-PT-10-LTLCardinality-12
FORMULA_NAME CO4-PT-10-LTLCardinality-13
FORMULA_NAME CO4-PT-10-LTLCardinality-14
FORMULA_NAME CO4-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717351687181

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:08:08] [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 18:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:08] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-02 18:08:08] [INFO ] Transformed 544 places.
[2024-06-02 18:08:08] [INFO ] Transformed 615 transitions.
[2024-06-02 18:08:08] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:08] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 157 places in 15 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 376 transition count 435
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 77 place count 313 transition count 370
Iterating global reduction 1 with 63 rules applied. Total rules applied 140 place count 313 transition count 370
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 192 place count 261 transition count 318
Iterating global reduction 1 with 52 rules applied. Total rules applied 244 place count 261 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 246 place count 261 transition count 316
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 272 place count 235 transition count 290
Iterating global reduction 2 with 26 rules applied. Total rules applied 298 place count 235 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 235 transition count 289
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 315 place count 219 transition count 273
Iterating global reduction 3 with 16 rules applied. Total rules applied 331 place count 219 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 333 place count 219 transition count 271
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 339 place count 213 transition count 265
Iterating global reduction 4 with 6 rules applied. Total rules applied 345 place count 213 transition count 265
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 347 place count 211 transition count 263
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 211 transition count 263
Applied a total of 349 rules in 107 ms. Remains 211 /387 variables (removed 176) and now considering 263/438 (removed 175) transitions.
// Phase 1: matrix 263 rows 211 cols
[2024-06-02 18:08:08] [INFO ] Computed 4 invariants in 20 ms
[2024-06-02 18:08:09] [INFO ] Implicit Places using invariants in 206 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/387 places, 263/438 transitions.
Applied a total of 0 rules in 8 ms. Remains 210 /210 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 210/387 places, 263/438 transitions.
Support contains 8 out of 210 places after structural reductions.
[2024-06-02 18:08:09] [INFO ] Flatten gal took : 41 ms
[2024-06-02 18:08:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:08:09] [INFO ] Input system was already deterministic with 263 transitions.
RANDOM walk for 40000 steps (47 resets) in 991 ms. (40 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40000 steps (49 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (27 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (46 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
// Phase 1: matrix 263 rows 210 cols
[2024-06-02 18:08:09] [INFO ] Computed 3 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 62/78 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/85 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/98 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 163/261 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 135/396 variables, 64/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 53/449 variables, 32/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/463 variables, 7/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 9/472 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 19 (OVERLAPS) 1/473 variables, 1/213 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/473 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/473 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 213 constraints, problems are : Problem set: 1 solved, 2 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/59 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/66 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/79 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 149/228 variables, 75/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/372 variables, 64/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 71/443 variables, 41/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 20/463 variables, 12/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/472 variables, 5/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/473 variables, 1/215 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/473 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/473 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 215 constraints, problems are : Problem set: 1 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 783ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 3062 steps, including 88 resets, run visited all 2 properties in 43 ms. (steps per millisecond=71 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 50 ms.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 331 edges and 210 vertex of which 204 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.11 ms
FORMULA CO4-PT-10-LTLCardinality-04 FALSE 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 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 263/263 transitions.
Graph (trivial) has 221 edges and 210 vertex of which 3 / 210 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 329 edges and 208 vertex of which 202 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 201 transition count 174
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 121 transition count 174
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 162 place count 121 transition count 153
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 204 place count 100 transition count 153
Performed 38 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 280 place count 62 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 283 place count 62 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 286 place count 59 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 289 place count 59 transition count 97
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 3 with 2 rules applied. Total rules applied 291 place count 58 transition count 96
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 319 place count 44 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 328 place count 44 transition count 88
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 339 place count 33 transition count 66
Iterating global reduction 4 with 11 rules applied. Total rules applied 350 place count 33 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 358 place count 33 transition count 58
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 360 place count 31 transition count 52
Iterating global reduction 5 with 2 rules applied. Total rules applied 362 place count 31 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 364 place count 31 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 366 place count 30 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 380 place count 30 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 382 place count 28 transition count 44
Applied a total of 382 rules in 70 ms. Remains 28 /210 variables (removed 182) and now considering 44/263 (removed 219) transitions.
[2024-06-02 18:08:10] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 28 cols
[2024-06-02 18:08:10] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:08:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:08:10] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 18:08:10] [INFO ] Invariant cache hit.
[2024-06-02 18:08:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-02 18:08:10] [INFO ] Redundant transitions in 13 ms returned [42]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 32 sub problems to find dead transitions.
[2024-06-02 18:08:10] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-06-02 18:08:10] [INFO ] Invariant cache hit.
[2024-06-02 18:08:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 39/67 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 32 constraints, problems are : Problem set: 0 solved, 32 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 39/67 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 32/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 64 constraints, problems are : Problem set: 0 solved, 32 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/210 places, 43/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 887 ms. Remains : 28/210 places, 43/263 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 6 reset in 192 ms.
Product exploration explored 100000 steps with 15 reset in 65 ms.
Computed a total of 6 stabilizing places and 11 stable transitions
Computed a total of 6 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 69 ms :[(NOT p0)]
RANDOM walk for 31231 steps (4473 resets) in 323 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-06-02 18:08:12] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-06-02 18:08:12] [INFO ] Invariant cache hit.
[2024-06-02 18:08:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:08:12] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-06-02 18:08:12] [INFO ] Invariant cache hit.
[2024-06-02 18:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:12] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-02 18:08:12] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-02 18:08:12] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-06-02 18:08:12] [INFO ] Invariant cache hit.
[2024-06-02 18:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 39/67 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 32 constraints, problems are : Problem set: 0 solved, 32 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 39/67 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 32/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 64 constraints, problems are : Problem set: 0 solved, 32 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 664ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 800 ms. Remains : 28/28 places, 43/43 transitions.
Computed a total of 6 stabilizing places and 11 stable transitions
Computed a total of 6 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 48 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5717 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30807 steps (769 resets) in 59 ms. (513 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 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)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 21 reset in 71 ms.
Built C files in :
/tmp/ltsmin10337916155954101537
[2024-06-02 18:08:14] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2024-06-02 18:08:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:08:14] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2024-06-02 18:08:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:08:14] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2024-06-02 18:08:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:08:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10337916155954101537
Running compilation step : cd /tmp/ltsmin10337916155954101537;'/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 252 ms.
Running link step : cd /tmp/ltsmin10337916155954101537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10337916155954101537;'/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/stateBased7843652793215840262.hoa' '--buchi-type=spotba'
LTSmin run took 213 ms.
FORMULA CO4-PT-10-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-10-LTLCardinality-03 finished in 3854 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((p0 U X(G(!p0)))))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 208 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 208 transition count 262
Applied a total of 3 rules in 8 ms. Remains 208 /210 variables (removed 2) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 208 cols
[2024-06-02 18:08:14] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:08:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:08:14] [INFO ] Invariant cache hit.
[2024-06-02 18:08:14] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 18:08:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/470 variables, 208/211 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 11 ms to minimize.
[2024-06-02 18:08:19] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 213 constraints, problems are : Problem set: 0 solved, 261 unsolved in 11112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/470 variables, 208/213 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 261/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 474 constraints, problems are : Problem set: 0 solved, 261 unsolved in 12181 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 23342ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 23346ms
Starting structural reductions in LTL mode, iteration 1 : 208/210 places, 262/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23533 ms. Remains : 208/210 places, 262/263 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, p0, true, p0]
Running random walk in product with property : CO4-PT-10-LTLCardinality-08
Product exploration explored 100000 steps with 2 reset in 155 ms.
Product exploration explored 100000 steps with 9 reset in 85 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 329 edges and 208 vertex of which 203 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, p0]
RANDOM walk for 40000 steps (35 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (44 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6419 steps, run visited all 1 properties in 29 ms. (steps per millisecond=221 )
Probabilistic random walk after 6419 steps, saw 1568 distinct states, run finished after 34 ms. (steps per millisecond=188 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-10-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-10-LTLCardinality-08 finished in 24286 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(p0))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 263/263 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 208 transition count 261
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 208 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 207 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 206 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 206 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 205 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 205 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 205 transition count 256
Applied a total of 12 rules in 25 ms. Remains 205 /210 variables (removed 5) and now considering 256/263 (removed 7) transitions.
// Phase 1: matrix 256 rows 205 cols
[2024-06-02 18:08:38] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:08:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:08:39] [INFO ] Invariant cache hit.
[2024-06-02 18:08:39] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-06-02 18:08:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 1/461 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 210 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11979 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 253/462 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/461 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/461 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 465 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints]
After SMT, in 34163ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 34167ms
Starting structural reductions in LTL mode, iteration 1 : 205/210 places, 256/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34374 ms. Remains : 205/210 places, 256/263 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-10-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 324 edges and 205 vertex of which 199 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 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-10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-10-LTLCardinality-13 finished in 34765 ms.
All properties solved by simple procedures.
Total runtime 65382 ms.

BK_STOP 1717351753728

--------------------
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-10"
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-10, 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-171734898500075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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