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.r378-smll-171683810800127.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 SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 19:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716943729056

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 00:48:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 00:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:48:51] [INFO ] Load time of PNML (sax parser for PT used): 510 ms
[2024-05-29 00:48:52] [INFO ] Transformed 2398 places.
[2024-05-29 00:48:52] [INFO ] Transformed 1954 transitions.
[2024-05-29 00:48:52] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 912 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 31 ms
Reduce places removed 1984 places and 0 transitions.
[2024-05-29 00:48:53] [INFO ] Flatten gal took : 592 ms
RANDOM walk for 40000 steps (8804 resets) in 5819 ms. (6 steps per ms) remains 16/16 properties
[2024-05-29 00:48:54] [INFO ] Flatten gal took : 360 ms
BEST_FIRST walk for 4004 steps (187 resets) in 192 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (174 resets) in 164 ms. (24 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (183 resets) in 139 ms. (28 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (181 resets) in 185 ms. (21 steps per ms) remains 16/16 properties
[2024-05-29 00:48:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7657457950341599624.gal : 183 ms
BEST_FIRST walk for 4003 steps (179 resets) in 148 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (169 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
[2024-05-29 00:48:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10682322785993820930.prop : 8 ms
BEST_FIRST walk for 4003 steps (182 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
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/ReachabilityCardinality7657457950341599624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10682322785993820930.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (370 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (176 resets) in 150 ms. (26 steps per ms) remains 16/16 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 4004 steps (179 resets) in 86 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (163 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (170 resets) in 146 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (162 resets) in 121 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (168 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (187 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (190 resets) in 90 ms. (44 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality10682322785993820930.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :7 after 65
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :65 after 346
Interrupted probabilistic random walk after 369905 steps, run timeout after 6001 ms. (steps per millisecond=61 ) properties seen :3 out of 16
Probabilistic random walk after 369905 steps, saw 171384 distinct states, run finished after 6029 ms. (steps per millisecond=61 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1954 rows 414 cols
[2024-05-29 00:49:00] [INFO ] Computed 6 invariants in 65 ms
[2024-05-29 00:49:01] [INFO ] State equation strengthened by 1674 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :346 after 3801
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 184/253 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-03 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-11 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 161/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 4 solved, 9 unsolved
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :3801 after 4523
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4523 after 8299
At refinement iteration 6 (INCLUDED_ONLY) 0/2368 variables, 1674/2094 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 4 solved, 9 unsolved in 5068 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 13/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 191/245 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 169/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-05-29 00:49:07] [INFO ] Deduced a trap composed of 209 places in 411 ms of which 44 ms to minimize.
[2024-05-29 00:49:08] [INFO ] Deduced a trap composed of 233 places in 387 ms of which 5 ms to minimize.
[2024-05-29 00:49:08] [INFO ] Deduced a trap composed of 216 places in 329 ms of which 4 ms to minimize.
[2024-05-29 00:49:09] [INFO ] Deduced a trap composed of 267 places in 315 ms of which 11 ms to minimize.
[2024-05-29 00:49:09] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 7 ms to minimize.
[2024-05-29 00:49:09] [INFO ] Deduced a trap composed of 223 places in 356 ms of which 4 ms to minimize.
[2024-05-29 00:49:09] [INFO ] Deduced a trap composed of 197 places in 299 ms of which 4 ms to minimize.
[2024-05-29 00:49:10] [INFO ] Deduced a trap composed of 257 places in 306 ms of which 4 ms to minimize.
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-14 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 8/14 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-05-29 00:49:10] [INFO ] Deduced a trap composed of 240 places in 293 ms of which 4 ms to minimize.
[2024-05-29 00:49:10] [INFO ] Deduced a trap composed of 220 places in 275 ms of which 3 ms to minimize.
[2024-05-29 00:49:11] [INFO ] Deduced a trap composed of 222 places in 276 ms of which 3 ms to minimize.
[2024-05-29 00:49:11] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 4 ms to minimize.
[2024-05-29 00:49:11] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 3 ms to minimize.
[2024-05-29 00:49:12] [INFO ] Deduced a trap composed of 206 places in 276 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/2368 variables, and 20 constraints, problems are : Problem set: 5 solved, 8 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1674 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 14/14 constraints]
After SMT, in 11375ms problems are : Problem set: 5 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.8 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 911 place count 308 transition count 941
Iterating global reduction 1 with 80 rules applied. Total rules applied 991 place count 308 transition count 941
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1001 place count 308 transition count 931
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 1054 place count 255 transition count 878
Iterating global reduction 2 with 53 rules applied. Total rules applied 1107 place count 255 transition count 878
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1138 place count 255 transition count 847
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1158 place count 235 transition count 824
Iterating global reduction 3 with 20 rules applied. Total rules applied 1178 place count 235 transition count 824
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Iterating post reduction 3 with 141 rules applied. Total rules applied 1319 place count 235 transition count 683
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1321 place count 233 transition count 680
Iterating global reduction 4 with 2 rules applied. Total rules applied 1323 place count 233 transition count 680
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1325 place count 231 transition count 678
Iterating global reduction 4 with 2 rules applied. Total rules applied 1327 place count 231 transition count 678
Applied a total of 1327 rules in 261 ms. Remains 231 /414 variables (removed 183) and now considering 678/1954 (removed 1276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 231/414 places, 678/1954 transitions.
RANDOM walk for 40000 steps (8953 resets) in 752 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1935 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1859 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 331 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1881 resets) in 330 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1824 resets) in 487 ms. (81 steps per ms) remains 8/8 properties
Invariant property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-00 does not hold.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :8299 after 64243
Interrupted probabilistic random walk after 305348 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :3 out of 8
Probabilistic random walk after 305348 steps, saw 144583 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 678 rows 231 cols
[2024-05-29 00:49:16] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 00:49:16] [INFO ] State equation strengthened by 504 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 103/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/156 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 557/713 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 383/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 196/909 variables, 75/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/909 variables, 121/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/909 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/909 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 739 constraints, problems are : Problem set: 0 solved, 4 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 231/231 constraints, ReadFeed: 504/504 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 103/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/156 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 557/713 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 383/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 196/909 variables, 75/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/909 variables, 121/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/909 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 00:49:19] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/909 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/909 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/909 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 909/909 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 231/231 constraints, ReadFeed: 504/504 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4615ms problems are : Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :64243 after 94393
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :94393 after 111831
Parikh walk visited 0 properties in 8034 ms.
Support contains 37 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 678/678 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 217 transition count 567
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 217 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 217 transition count 563
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 206 transition count 551
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 206 transition count 551
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 206 transition count 548
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 202 transition count 542
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 202 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 202 transition count 541
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 200 transition count 539
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 200 transition count 539
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 198 transition count 537
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 198 transition count 537
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 197 transition count 536
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 197 transition count 536
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 196 transition count 535
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 196 transition count 535
Applied a total of 78 rules in 104 ms. Remains 196 /231 variables (removed 35) and now considering 535/678 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 196/231 places, 535/678 transitions.
RANDOM walk for 40000 steps (9044 resets) in 412 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1927 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 265586 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 4
Probabilistic random walk after 265586 steps, saw 123881 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 535 rows 196 cols
[2024-05-29 00:49:32] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 00:49:32] [INFO ] State equation strengthened by 382 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 89/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/136 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 518/654 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 365/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 77/731 variables, 60/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 17/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/731 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 582 constraints, problems are : Problem set: 0 solved, 4 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 196/196 constraints, ReadFeed: 382/382 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 89/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/136 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 518/654 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 365/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 77/731 variables, 60/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 17/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/731 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 586 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 196/196 constraints, ReadFeed: 382/382 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3724ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7056 ms.
Support contains 37 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 535/535 transitions.
Applied a total of 0 rules in 27 ms. Remains 196 /196 variables (removed 0) and now considering 535/535 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 196/196 places, 535/535 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 535/535 transitions.
Applied a total of 0 rules in 28 ms. Remains 196 /196 variables (removed 0) and now considering 535/535 (removed 0) transitions.
[2024-05-29 00:49:43] [INFO ] Invariant cache hit.
[2024-05-29 00:49:43] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 00:49:43] [INFO ] Invariant cache hit.
[2024-05-29 00:49:43] [INFO ] State equation strengthened by 382 read => feed constraints.
[2024-05-29 00:49:45] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-05-29 00:49:45] [INFO ] Redundant transitions in 55 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-29 00:49:45] [INFO ] Invariant cache hit.
[2024-05-29 00:49:45] [INFO ] State equation strengthened by 382 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (OVERLAPS) 535/731 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Reachability property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-10 is true.
Reachability property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-05 is true.
Reachability property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-04 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :111831 after 2.17668e+06
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 382/582 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 534 unsolved
[2024-05-29 00:50:16] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-29 00:50:16] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 731/731 variables, and 584 constraints, problems are : Problem set: 2 solved, 532 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 196/196 constraints, ReadFeed: 382/382 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 3/196 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 532 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 532 unsolved
Problem TDEAD497 is UNSAT
At refinement iteration 6 (OVERLAPS) 535/731 variables, 196/202 constraints. Problems are: Problem set: 3 solved, 531 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 382/584 constraints. Problems are: Problem set: 3 solved, 531 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 531/1115 constraints. Problems are: Problem set: 3 solved, 531 unsolved
[2024-05-29 00:50:44] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 2 ms to minimize.
[2024-05-29 00:50:44] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 731/731 variables, and 1117 constraints, problems are : Problem set: 3 solved, 531 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 196/196 constraints, ReadFeed: 382/382 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 4/4 constraints]
After SMT, in 61882ms problems are : Problem set: 3 solved, 531 unsolved
Search for dead transitions found 3 dead transitions in 61892ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 196/196 places, 532/535 transitions.
Graph (complete) has 830 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 193 /196 variables (removed 3) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 193 cols
[2024-05-29 00:50:47] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 00:50:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 00:50:47] [INFO ] Invariant cache hit.
[2024-05-29 00:50:47] [INFO ] State equation strengthened by 381 read => feed constraints.
[2024-05-29 00:50:49] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 193/196 places, 532/535 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65845 ms. Remains : 193/196 places, 532/535 transitions.
RANDOM walk for 40000 steps (8953 resets) in 635 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1827 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1836 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 332149 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 4
Probabilistic random walk after 332149 steps, saw 155987 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-29 00:50:52] [INFO ] Invariant cache hit.
[2024-05-29 00:50:52] [INFO ] State equation strengthened by 381 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/119 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 511/630 variables, 119/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 360/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/725 variables, 74/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 21/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/725 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 577 constraints, problems are : Problem set: 0 solved, 4 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 381/381 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/119 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 511/630 variables, 119/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 360/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/725 variables, 74/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 21/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/725 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 581 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 381/381 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3305ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 13182 ms.
Support contains 37 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 532/532 transitions.
Applied a total of 0 rules in 26 ms. Remains 193 /193 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 193/193 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 532/532 transitions.
Applied a total of 0 rules in 36 ms. Remains 193 /193 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2024-05-29 00:51:09] [INFO ] Invariant cache hit.
[2024-05-29 00:51:09] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-29 00:51:09] [INFO ] Invariant cache hit.
[2024-05-29 00:51:09] [INFO ] State equation strengthened by 381 read => feed constraints.
[2024-05-29 00:51:11] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2024-05-29 00:51:11] [INFO ] Redundant transitions in 7 ms returned []
Running 531 sub problems to find dead transitions.
[2024-05-29 00:51:11] [INFO ] Invariant cache hit.
[2024-05-29 00:51:11] [INFO ] State equation strengthened by 381 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
At refinement iteration 4 (OVERLAPS) 532/725 variables, 193/196 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 381/577 constraints. Problems are: Problem set: 7 solved, 524 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :2.17668e+06 after 1.64641e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 0/577 constraints. Problems are: Problem set: 7 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 577 constraints, problems are : Problem set: 7 solved, 524 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 193/193 constraints, ReadFeed: 381/381 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 530/716 variables, 186/189 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/716 variables, 379/568 constraints. Problems are: Problem set: 7 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 37/605 constraints. Problems are: Problem set: 7 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 716/725 variables, and 605 constraints, problems are : Problem set: 7 solved, 524 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 186/193 constraints, ReadFeed: 379/381 constraints, PredecessorRefiner: 37/531 constraints, Known Traps: 0/0 constraints]
After SMT, in 61657ms problems are : Problem set: 7 solved, 524 unsolved
Search for dead transitions found 7 dead transitions in 61665ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/193 places, 525/532 transitions.
Graph (complete) has 811 edges and 193 vertex of which 187 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 186 transition count 523
Deduced a syphon composed of 1 places in 16 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 186 transition count 523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 185 transition count 522
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 185 transition count 522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 184 transition count 521
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 184 transition count 521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 183 transition count 520
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 183 transition count 520
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 9 rules in 132 ms. Remains 183 /193 variables (removed 10) and now considering 520/525 (removed 5) transitions.
// Phase 1: matrix 520 rows 183 cols
[2024-05-29 00:52:13] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 00:52:13] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 00:52:13] [INFO ] Invariant cache hit.
[2024-05-29 00:52:13] [INFO ] State equation strengthened by 377 read => feed constraints.
[2024-05-29 00:52:14] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 183/193 places, 520/532 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65462 ms. Remains : 183/193 places, 520/532 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (8987 resets) in 486 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 526 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1825 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1934 resets) in 726 ms. (55 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 232148 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 4
Probabilistic random walk after 232148 steps, saw 109675 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 520 rows 182 cols
[2024-05-29 00:52:18] [INFO ] Computed 3 invariants in 19 ms
[2024-05-29 00:52:18] [INFO ] State equation strengthened by 377 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 501/616 variables, 115/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 358/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 86/702 variables, 67/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 19/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/702 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 702/702 variables, and 562 constraints, problems are : Problem set: 0 solved, 4 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 377/377 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 501/616 variables, 115/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 358/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 86/702 variables, 67/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 19/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 4/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/702 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 702/702 variables, and 566 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 377/377 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6072ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 17133 ms.
Support contains 36 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 520/520 transitions.
Applied a total of 0 rules in 26 ms. Remains 182 /182 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 182/182 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 520/520 transitions.
Applied a total of 0 rules in 24 ms. Remains 182 /182 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-29 00:52:41] [INFO ] Invariant cache hit.
[2024-05-29 00:52:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 00:52:42] [INFO ] Invariant cache hit.
[2024-05-29 00:52:42] [INFO ] State equation strengthened by 377 read => feed constraints.
[2024-05-29 00:52:43] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2024-05-29 00:52:43] [INFO ] Redundant transitions in 7 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-29 00:52:43] [INFO ] Invariant cache hit.
[2024-05-29 00:52:43] [INFO ] State equation strengthened by 377 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 1/182 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 520/702 variables, 182/185 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 377/562 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-29 00:52:58] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
Problem TDEAD467 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 1/563 constraints. Problems are: Problem set: 7 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/702 variables, and 563 constraints, problems are : Problem set: 7 solved, 512 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 377/377 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 7 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 6/182 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/4 constraints. Problems are: Problem set: 7 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 520/702 variables, 182/186 constraints. Problems are: Problem set: 7 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 377/563 constraints. Problems are: Problem set: 7 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 512/1075 constraints. Problems are: Problem set: 7 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/702 variables, and 1075 constraints, problems are : Problem set: 7 solved, 512 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 377/377 constraints, PredecessorRefiner: 512/519 constraints, Known Traps: 1/1 constraints]
After SMT, in 61555ms problems are : Problem set: 7 solved, 512 unsolved
Search for dead transitions found 7 dead transitions in 61563ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/182 places, 513/520 transitions.
Graph (complete) has 783 edges and 182 vertex of which 178 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 29 ms. Remains 178 /182 variables (removed 4) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 178 cols
[2024-05-29 00:53:44] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 00:53:44] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 00:53:44] [INFO ] Invariant cache hit.
[2024-05-29 00:53:45] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-29 00:53:46] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 178/182 places, 513/520 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64232 ms. Remains : 178/182 places, 513/520 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (8967 resets) in 1023 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1949 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1882 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 580 ms. (68 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 207181 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 4
Probabilistic random walk after 207181 steps, saw 98505 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 513 rows 177 cols
[2024-05-29 00:53:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 00:53:50] [INFO ] State equation strengthened by 373 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 481/564 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 341/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 125/689 variables, 93/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 32/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/690 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/690 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 552 constraints, problems are : Problem set: 0 solved, 4 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 481/564 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 341/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 125/689 variables, 93/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 32/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 4/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/690 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 00:53:52] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/690 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/690 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/690 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 557 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3283ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 36597 ms.
Support contains 35 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 513/513 transitions.
Applied a total of 0 rules in 23 ms. Remains 177 /177 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 177/177 places, 513/513 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 513/513 transitions.
Applied a total of 0 rules in 22 ms. Remains 177 /177 variables (removed 0) and now considering 513/513 (removed 0) transitions.
[2024-05-29 00:54:30] [INFO ] Invariant cache hit.
[2024-05-29 00:54:30] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 00:54:30] [INFO ] Invariant cache hit.
[2024-05-29 00:54:30] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-29 00:54:31] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2024-05-29 00:54:31] [INFO ] Redundant transitions in 6 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-29 00:54:31] [INFO ] Invariant cache hit.
[2024-05-29 00:54:31] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 1/177 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 513/690 variables, 177/179 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Invariant property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-09 does not hold.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 373/552 constraints. Problems are: Problem set: 0 solved, 512 unsolved
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1.64641e+07 after 4.36765e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/690 variables, and 552 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 1/177 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 513/690 variables, 177/179 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 373/552 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 512/1064 constraints. Problems are: Problem set: 0 solved, 512 unsolved
[2024-05-29 00:55:24] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 1065 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 1/1 constraints]
After SMT, in 61425ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 61433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62900 ms. Remains : 177/177 places, 513/513 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 177 transition count 503
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 173 transition count 503
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 14 place count 173 transition count 487
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 157 transition count 487
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 152 transition count 427
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 152 transition count 427
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 147 transition count 422
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 147 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 147 transition count 420
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 88 place count 137 transition count 410
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 137 transition count 407
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 95 place count 134 transition count 406
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 107 place count 134 transition count 406
Applied a total of 107 rules in 56 ms. Remains 134 /177 variables (removed 43) and now considering 406/513 (removed 107) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 406 rows 134 cols
[2024-05-29 00:55:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 00:55:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 00:55:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-29 00:55:33] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:55:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 00:55:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 00:55:33] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-29 00:55:33] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-29 00:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 1
[2024-05-29 00:55:34] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-29 00:55:34] [INFO ] After 1291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-29 00:55:34] [INFO ] Flatten gal took : 25 ms
[2024-05-29 00:55:34] [INFO ] Flatten gal took : 24 ms
[2024-05-29 00:55:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17614771565119600143.gal : 6 ms
[2024-05-29 00:55:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8166773060872530623.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/ReachabilityCardinality17614771565119600143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8166773060872530623.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/ReachabilityCardinality8166773060872530623.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :28 after 35
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :35 after 56
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :56 after 144
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :144 after 232
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :232 after 476
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :476 after 2587
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2587 after 6012
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6012 after 83517
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :83517 after 1.29935e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.29935e+06 after 3.86998e+07
Detected timeout of ITS tools.
[2024-05-29 00:55:49] [INFO ] Flatten gal took : 18 ms
[2024-05-29 00:55:49] [INFO ] Applying decomposition
[2024-05-29 00:55:49] [INFO ] Flatten gal took : 17 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/graph2234573662734545201.txt' '-o' '/tmp/graph2234573662734545201.bin' '-w' '/tmp/graph2234573662734545201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2234573662734545201.bin' '-l' '-1' '-v' '-w' '/tmp/graph2234573662734545201.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:55:49] [INFO ] Decomposing Gal with order
[2024-05-29 00:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:55:50] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-29 00:55:50] [INFO ] Flatten gal took : 88 ms
[2024-05-29 00:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 10 ms.
[2024-05-29 00:55:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2580576356754910950.gal : 7 ms
[2024-05-29 00:55:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality257570346729027117.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/ReachabilityCardinality2580576356754910950.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality257570346729027117.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 ...306
Loading property file /tmp/ReachabilityCardinality257570346729027117.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 26
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :26 after 33
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :33 after 38
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :38 after 63
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :63 after 95
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :95 after 179
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :179 after 212
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :212 after 212
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :256 after 1125
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1125 after 2112
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3928 after 17080
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :23536 after 27008
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :30740 after 213529
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32316 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 00:56:05] [INFO ] Flatten gal took : 81 ms
[2024-05-29 00:56:05] [INFO ] Applying decomposition
[2024-05-29 00:56:05] [INFO ] Flatten gal took : 76 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/graph17452436173041169545.txt' '-o' '/tmp/graph17452436173041169545.bin' '-w' '/tmp/graph17452436173041169545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17452436173041169545.bin' '-l' '-1' '-v' '-w' '/tmp/graph17452436173041169545.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:56:05] [INFO ] Decomposing Gal with order
[2024-05-29 00:56:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:56:06] [INFO ] Removed a total of 671 redundant transitions.
[2024-05-29 00:56:06] [INFO ] Flatten gal took : 236 ms
[2024-05-29 00:56:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 798 labels/synchronizations in 87 ms.
[2024-05-29 00:56:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3002216288611129109.gal : 38 ms
[2024-05-29 00:56:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15172993472769301244.prop : 1 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/ReachabilityCardinality3002216288611129109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15172993472769301244.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/ReachabilityCardinality15172993472769301244.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 14623
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :14623 after 14679
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :14679 after 14691
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :14691 after 14715
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14715 after 15251
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :15251 after 15495
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :15495 after 25747
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :25747 after 100875
ITS-tools command line returned an error code 137
[2024-05-29 01:05:59] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2491888727221638439
[2024-05-29 01:05:59] [INFO ] Applying decomposition
[2024-05-29 01:05:59] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2024-05-29 01:05:59] [INFO ] Flatten gal took : 17 ms
[2024-05-29 01:05:59] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:05:59] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2024-05-29 01:05:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10946691026580690333.txt' '-o' '/tmp/graph10946691026580690333.bin' '-w' '/tmp/graph10946691026580690333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10946691026580690333.bin' '-l' '-1' '-v' '-w' '/tmp/graph10946691026580690333.weights' '-q' '0' '-e' '0.001'
[2024-05-29 01:05:59] [INFO ] Decomposing Gal with order
[2024-05-29 01:05:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:05:59] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2024-05-29 01:05:59] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 01:05:59] [INFO ] Removed a total of 173 redundant transitions.
[2024-05-29 01:05:59] [INFO ] Flatten gal took : 50 ms
[2024-05-29 01:05:59] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2491888727221638439
Running compilation step : cd /tmp/ltsmin2491888727221638439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
[2024-05-29 01:05:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 20 ms.
[2024-05-29 01:05:59] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4759166204931739626.gal : 9 ms
[2024-05-29 01:05:59] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15849581934241807729.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/ReachabilityFireability4759166204931739626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15849581934241807729.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/ReachabilityFireability15849581934241807729.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :5386 after 6106
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6106 after 6122
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6122 after 6138
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6138 after 6154
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :6154 after 6154
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6154 after 6154
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6154 after 66532
Compilation finished in 2806 ms.
Running link step : cd /tmp/ltsmin2491888727221638439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin2491888727221638439;'/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' '-i' 'SieveSingleMsgMboxPTd2m36ReachabilityFireability202402==true'
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :173775 after 204363
LTSmin run took 14107 ms.
Found Violation
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2491888727221638439;'/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' '-i' 'SieveSingleMsgMboxPTd2m36ReachabilityFireability202413==true'
Reachability property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-13 is true.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-02 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :204363 after 412603
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :412603 after 414667
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :414667 after 853429
LTSmin run took 16381 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin2491888727221638439;'/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' '-i' 'SieveSingleMsgMboxPTd2m36ReachabilityFireability202415==true'
LTSmin run took 83590 ms.
Found Violation
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1145061 ms.

BK_STOP 1716944876395

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="SieveSingleMsgMbox-PT-d2m36"
export BK_EXAMINATION="ReachabilityFireability"
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 SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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