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.r092-tall-171624189800710.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 DES-PT-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189800710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716352418212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 04:33:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:33:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:33:39] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 04:33:39] [INFO ] Transformed 399 places.
[2024-05-22 04:33:39] [INFO ] Transformed 350 transitions.
[2024-05-22 04:33:39] [INFO ] Found NUPN structural information;
[2024-05-22 04:33:39] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (336 resets) in 1387 ms. (28 steps per ms) remains 8/13 properties
FORMULA DES-PT-30b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 04:33:40] [INFO ] Flatten gal took : 160 ms
BEST_FIRST walk for 40002 steps (49 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
[2024-05-22 04:33:40] [INFO ] Flatten gal took : 82 ms
[2024-05-22 04:33:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15380165534347899960.gal : 26 ms
BEST_FIRST walk for 40003 steps (38 resets) in 532 ms. (75 steps per ms) remains 8/8 properties
[2024-05-22 04:33:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5612817217909803355.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15380165534347899960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5612817217909803355.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (57 resets) in 157 ms. (253 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (44 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality5612817217909803355.prop.
BEST_FIRST walk for 40004 steps (44 resets) in 474 ms. (84 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 21
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :21 after 37
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :37 after 49
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :49 after 211
BEST_FIRST walk for 40004 steps (52 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :211 after 1116
BEST_FIRST walk for 40004 steps (52 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1116 after 25170
// Phase 1: matrix 350 rows 399 cols
[2024-05-22 04:33:40] [INFO ] Computed 65 invariants in 29 ms
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :25170 after 753955
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :753955 after 2.30969e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem DES-PT-30b-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DES-PT-30b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 229/346 variables, 39/156 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 229/385 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 4/389 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :2.30969e+07 after 1.91391e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 52/398 variables, 21/410 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 52/462 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/462 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/399 variables, 1/463 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/464 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/464 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.91391e+08 after 5.8765e+08
At refinement iteration 12 (OVERLAPS) 350/749 variables, 399/863 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/749 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/749 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 863 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2616 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 241/345 variables, 39/143 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 241/384 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 4/388 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 04:33:43] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 15 ms to minimize.
[2024-05-22 04:33:43] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 8/396 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/396 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 53/398 variables, 21/417 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 53/470 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 04:33:44] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-22 04:33:45] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-22 04:33:45] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 3/473 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/399 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 04:33:46] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:33:46] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:33:46] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 7 ms to minimize.
[2024-05-22 04:33:46] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 4/479 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-22 04:33:47] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 1/480 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/399 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 350/749 variables, 399/879 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 886 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5023 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 16/16 constraints]
After SMT, in 7777ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 104 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 392 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 392 transition count 334
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 381 transition count 332
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 379 transition count 332
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 28 place count 379 transition count 329
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 34 place count 376 transition count 329
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 45 place count 365 transition count 318
Iterating global reduction 3 with 11 rules applied. Total rules applied 56 place count 365 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 360 transition count 313
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 360 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 70 place count 360 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 360 transition count 308
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 359 transition count 308
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 158 place count 316 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 162 place count 314 transition count 275
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 167 place count 314 transition count 270
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 172 place count 309 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 309 transition count 269
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 309 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 175 place count 308 transition count 268
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 176 place count 308 transition count 268
Applied a total of 176 rules in 185 ms. Remains 308 /399 variables (removed 91) and now considering 268/350 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 308/399 places, 268/350 transitions.
RANDOM walk for 40000 steps (574 resets) in 657 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (85 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (82 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (103 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (84 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (83 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (95 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (100 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 664041 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 7
Probabilistic random walk after 664041 steps, saw 122675 distinct states, run finished after 3007 ms. (steps per millisecond=220 ) properties seen :0
// Phase 1: matrix 268 rows 308 cols
[2024-05-22 04:33:52] [INFO ] Computed 63 invariants in 7 ms
[2024-05-22 04:33:52] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 90/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 111/305 variables, 24/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 268/573 variables, 305/368 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/576 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 380 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 308/308 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 90/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:33:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 04:33:53] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 04:33:53] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:33:53] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 111/305 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:33:54] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:33:54] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 268/573 variables, 305/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 9/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:33:55] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 04:33:55] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:33:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:33:56] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 04:33:56] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:33:56] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:33:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:33:57] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:33:57] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/573 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 3/576 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/576 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 5 ms to minimize.
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 04:34:01] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:34:02] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/576 variables, 7/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/576 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/576 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 576/576 variables, and 409 constraints, problems are : Problem set: 0 solved, 7 unsolved in 11042 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 308/308 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 22/22 constraints]
After SMT, in 12323ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 22084 ms.
Support contains 104 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 268/268 transitions.
Applied a total of 0 rules in 9 ms. Remains 308 /308 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 308/308 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 268/268 transitions.
Applied a total of 0 rules in 9 ms. Remains 308 /308 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-22 04:34:26] [INFO ] Invariant cache hit.
[2024-05-22 04:34:27] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 04:34:27] [INFO ] Invariant cache hit.
[2024-05-22 04:34:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 04:34:27] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-05-22 04:34:27] [INFO ] Redundant transitions in 14 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-22 04:34:27] [INFO ] Invariant cache hit.
[2024-05-22 04:34:27] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/308 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 267 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/576 variables, 308/371 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:34:34] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:34:43] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/576 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 11 (OVERLAPS) 0/576 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 382 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 308/308 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/308 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 04:34:59] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-22 04:35:00] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 04:35:00] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 04:35:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-22 04:35:00] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-22 04:35:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
[2024-05-22 04:35:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 8 ms to minimize.
[2024-05-22 04:35:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:35:03] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
[2024-05-22 04:35:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:35:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 268/576 variables, 308/399 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 9/408 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 267/675 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:35:20] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:35:21] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 04:35:21] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:35:21] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 04:35:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 04:35:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 681 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 308/308 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 34/34 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60784 ms. Remains : 308/308 places, 268/268 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 831 edges and 308 vertex of which 307 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 307 /308 variables (removed 1) and now considering 268/268 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 268 rows 307 cols
[2024-05-22 04:35:27] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 04:35:27] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 04:35:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 04:35:27] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-22 04:35:28] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-22 04:35:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-22 04:35:29] [INFO ] Deduced a trap composed of 12 places in 645 ms of which 1 ms to minimize.
[2024-05-22 04:35:29] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 04:35:29] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 04:35:29] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 04:35:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 852 ms
TRAPS : Iteration 1
[2024-05-22 04:35:29] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
TRAPS : Iteration 2
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2024-05-22 04:35:30] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-22 04:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 3
[2024-05-22 04:35:31] [INFO ] After 3894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-22 04:35:32] [INFO ] After 4556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2024-05-22 04:35:32] [INFO ] Flatten gal took : 29 ms
[2024-05-22 04:35:32] [INFO ] Flatten gal took : 20 ms
[2024-05-22 04:35:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15301455659094190630.gal : 5 ms
[2024-05-22 04:35:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6036454467669773849.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15301455659094190630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6036454467669773849.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6036454467669773849.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :7 after 50
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :50 after 61
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :61 after 205
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :205 after 2193
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :2193 after 2609
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2609 after 6249
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :6249 after 11193
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :11193 after 1.50521e+06
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1.50521e+06 after 1.68612e+06
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.68612e+06 after 2.06408e+08
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :2.06408e+08 after 1.4031e+10
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1.4031e+10 after 3.42149e+10
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :3.42149e+10 after 2.20712e+11
Detected timeout of ITS tools.
[2024-05-22 04:35:47] [INFO ] Flatten gal took : 18 ms
[2024-05-22 04:35:47] [INFO ] Applying decomposition
[2024-05-22 04:35:47] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1728692006913752584.txt' '-o' '/tmp/graph1728692006913752584.bin' '-w' '/tmp/graph1728692006913752584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1728692006913752584.bin' '-l' '-1' '-v' '-w' '/tmp/graph1728692006913752584.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:35:47] [INFO ] Decomposing Gal with order
[2024-05-22 04:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:35:47] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 04:35:48] [INFO ] Flatten gal took : 432 ms
[2024-05-22 04:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 13 ms.
[2024-05-22 04:35:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6333424071784423447.gal : 8 ms
[2024-05-22 04:35:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14061283236661259685.prop : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6333424071784423447.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14061283236661259685.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14061283236661259685.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :25 after 73
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :73 after 5893
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :5893 after 21157
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21157 after 42313
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :42313 after 1.25366e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35718 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 04:36:03] [INFO ] Flatten gal took : 21 ms
[2024-05-22 04:36:03] [INFO ] Applying decomposition
[2024-05-22 04:36:03] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6730878012506541439.txt' '-o' '/tmp/graph6730878012506541439.bin' '-w' '/tmp/graph6730878012506541439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6730878012506541439.bin' '-l' '-1' '-v' '-w' '/tmp/graph6730878012506541439.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:36:03] [INFO ] Decomposing Gal with order
[2024-05-22 04:36:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:36:03] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-22 04:36:03] [INFO ] Flatten gal took : 48 ms
[2024-05-22 04:36:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 04:36:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12293618843122543276.gal : 5 ms
[2024-05-22 04:36:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15103174031211279122.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12293618843122543276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15103174031211279122.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15103174031211279122.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 217
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :217 after 3.0268e+06
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :6.85946e+07 after 1.29689e+11
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :1.29689e+11 after 1.11786e+17
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1.11786e+17 after 5.98709e+17
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :5.98709e+17 after 1.0465e+18
Invariant property DES-PT-30b-ReachabilityCardinality-2024-10 does not hold.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-30b-ReachabilityCardinality-2024-02 does not hold.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.0465e+18 after 1.71763e+18
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.71763e+18 after 2.38927e+18
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.91826e+21 after 2.63074e+21
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.96792e+22,120.577,279516,25483,2243,684606,18822,1017,618996,371,115339,0
Total reachable state count : 19679194767205820526592

Verifying 7 reachability properties.
Invariant property DES-PT-30b-ReachabilityCardinality-2024-00 does not hold.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-00,4.07013e+18,120.686,279516,1731,364,684606,18822,1017,618996,374,115339,11622
Invariant property DES-PT-30b-ReachabilityCardinality-2024-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-02,1.05074e+13,120.692,279516,360,137,684606,18822,1019,618996,376,115339,11792
Reachability property DES-PT-30b-ReachabilityCardinality-2024-06 does not hold.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : DES-PT-30b-ReachabilityCardinality-2024-06

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-06,0,120.697,279516,1,0,684606,18822,1023,618996,377,115339,11849
Reachability property DES-PT-30b-ReachabilityCardinality-2024-09 is true.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-09,1.71616e+17,120.7,279516,1321,391,684606,18822,1023,618996,378,115339,11849
Invariant property DES-PT-30b-ReachabilityCardinality-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-10,6.7704e+20,121.06,279516,9148,2138,684606,18822,1089,618996,399,115339,85976
Reachability property DES-PT-30b-ReachabilityCardinality-2024-12 is true.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-12,3.02868e+12,121.608,279516,240,172,684606,18822,1145,618996,408,115339,203372
Reachability property DES-PT-30b-ReachabilityCardinality-2024-13 is true.
FORMULA DES-PT-30b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-ReachabilityCardinality-2024-13,1.31905e+11,121.862,279516,226,194,684606,18822,1253,618996,416,115339,273488
All properties solved without resorting to model-checking.
Total runtime 266081 ms.

BK_STOP 1716352685557

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-30b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189800710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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