Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000254.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.4M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749161376788

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 22:09:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 22:09:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 22:09:40] [INFO ] Load time of PNML (sax parser for PT used): 913 ms
[2025-06-05 22:09:40] [INFO ] Transformed 971 places.
[2025-06-05 22:09:40] [INFO ] Transformed 5542 transitions.
[2025-06-05 22:09:40] [INFO ] Found NUPN structural information;
[2025-06-05 22:09:40] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 1186 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (326 resets) in 3818 ms. (10 steps per ms) remains 8/13 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (48 resets) in 528 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (47 resets) in 415 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 354 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (45 resets) in 733 ms. (54 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (47 resets) in 426 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (47 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (46 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
// Phase 1: matrix 5542 rows 971 cols
[2025-06-05 22:09:43] [INFO ] Computed 8 invariants in 270 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-05 22:09:43] [INFO ] Flatten gal took : 1569 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-05 22:09:44] [INFO ] Flatten gal took : 668 ms
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2025-01 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 860/952 variables, 7/99 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2025-06-05 22:09:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5779625231380304427.gal : 218 ms
[2025-06-05 22:09:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2920088347170361019.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5779625231380304427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2920088347170361019.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 860/959 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/959 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 19/971 variables, 1/960 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 19/979 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality2920088347170361019.prop.
At refinement iteration 8 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5087 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 880/952 variables, 7/79 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 880/959 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:09:52] [INFO ] Deduced a trap composed of 190 places in 3513 ms of which 339 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:09:56] [INFO ] Deduced a trap composed of 190 places in 3428 ms of which 208 ms to minimize.
SMT process timed out in 13245ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 72 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 852 edges and 971 vertex of which 87 / 971 are part of one of the 15 SCC in 10 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 2007 edges and 899 vertex of which 886 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.51 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 521 rules applied. Total rules applied 523 place count 886 transition count 4922
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 530 rules applied. Total rules applied 1053 place count 370 transition count 4908
Reduce places removed 6 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 51 rules applied. Total rules applied 1104 place count 364 transition count 4863
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 48 rules applied. Total rules applied 1152 place count 319 transition count 4860
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1153 place count 318 transition count 4860
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 1153 place count 318 transition count 4840
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1193 place count 298 transition count 4840
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1237 place count 254 transition count 4796
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 9
Iterating global reduction 5 with 44 rules applied. Total rules applied 1281 place count 254 transition count 4796
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :10 after 20
SDD proceeding with computation,7 properties remain. new max is 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1281 place count 254 transition count 4795
SDD size :20 after 37
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1283 place count 253 transition count 4795
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :37 after 217
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :217 after 3621
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1293 place count 243 transition count 1247
Iterating global reduction 5 with 10 rules applied. Total rules applied 1303 place count 243 transition count 1247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1307 place count 243 transition count 1243
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 1375 place count 209 transition count 1209
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1376 place count 209 transition count 1208
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1381 place count 204 transition count 1203
Iterating global reduction 7 with 5 rules applied. Total rules applied 1386 place count 204 transition count 1203
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1404 place count 195 transition count 1216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1407 place count 195 transition count 1213
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :3621 after 11655
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 1418 place count 195 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1420 place count 194 transition count 1208
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :11655 after 28923
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1428 place count 194 transition count 1200
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :28923 after 30712
Free-agglomeration rule applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1466 place count 194 transition count 1162
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 1504 place count 156 transition count 1162
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1507 place count 153 transition count 1159
Iterating global reduction 9 with 3 rules applied. Total rules applied 1510 place count 153 transition count 1159
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1515 place count 153 transition count 1154
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :30712 after 125602
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1516 place count 153 transition count 1154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1517 place count 153 transition count 1153
Applied a total of 1517 rules in 2251 ms. Remains 153 /971 variables (removed 818) and now considering 1153/5542 (removed 4389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2269 ms. Remains : 153/971 places, 1153/5542 transitions.
RANDOM walk for 40000 steps (1245 resets) in 2196 ms. (18 steps per ms) remains 4/7 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (179 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (176 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (179 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (177 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
// Phase 1: matrix 1153 rows 153 cols
[2025-06-05 22:09:59] [INFO ] Computed 6 invariants in 15 ms
[2025-06-05 22:09:59] [INFO ] State equation strengthened by 776 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/131 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1135/1266 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1266 variables, 577/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1266 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/1294 variables, 15/729 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 199/928 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/1304 variables, 5/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1304 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/1306 variables, 2/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1306 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1306 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 935 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 776/776 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 80/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:02] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:02] [INFO ] Deduced a trap composed of 24 places in 430 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :125602 after 1.28179e+07
[2025-06-05 22:10:02] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:03] [INFO ] Deduced a trap composed of 29 places in 455 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:03] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:04] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/131 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1135/1266 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1266 variables, 577/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:05] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1266 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 28/1294 variables, 15/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1294 variables, 199/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1294 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:07] [INFO ] Deduced a trap composed of 29 places in 423 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:07] [INFO ] Deduced a trap composed of 24 places in 375 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1294 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1294 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/1304 variables, 5/944 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1304 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/1306 variables, 2/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:09] [INFO ] Deduced a trap composed of 22 places in 439 ms of which 14 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1306 variables, 1/947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1306 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1306 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 947 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9182 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 776/776 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11394ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 786 ms.
Support contains 50 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1153/1153 transitions.
Graph (trivial) has 46 edges and 153 vertex of which 4 / 153 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 151 transition count 1135
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 137 transition count 1133
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 37 place count 136 transition count 1128
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 44 place count 131 transition count 1126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 44 place count 131 transition count 1122
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 52 place count 127 transition count 1122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 55 place count 124 transition count 1119
Iterating global reduction 4 with 3 rules applied. Total rules applied 58 place count 124 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 123 transition count 1118
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 123 transition count 1118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 70 place count 118 transition count 1113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 118 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 74 place count 117 transition count 1109
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 117 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 77 place count 116 transition count 1110
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 83 place count 116 transition count 1104
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 86 place count 116 transition count 1101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 89 place count 113 transition count 1101
Drop transitions (Redundant composition of simpler transitions.) removed 216 transitions
Redundant transition composition rules discarded 216 transitions
Iterating global reduction 6 with 216 rules applied. Total rules applied 305 place count 113 transition count 885
Applied a total of 305 rules in 490 ms. Remains 113 /153 variables (removed 40) and now considering 885/1153 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 113/153 places, 885/1153 transitions.
RANDOM walk for 40000 steps (1477 resets) in 525 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (201 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (202 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (200 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (195 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 495656 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 4
Probabilistic random walk after 495656 steps, saw 84134 distinct states, run finished after 3013 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 885 rows 113 cols
[2025-06-05 22:10:15] [INFO ] Computed 6 invariants in 4 ms
[2025-06-05 22:10:15] [INFO ] State equation strengthened by 573 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 876/975 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/975 variables, 375/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 23/998 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 198/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/998 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 692 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:17] [INFO ] Deduced a trap composed of 22 places in 350 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:17] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:18] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:18] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:18] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 876/975 variables, 99/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 375/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/975 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 23/998 variables, 14/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 198/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/998 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/998 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/998 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 699 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4075 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5676ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 379 ms.
Support contains 50 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 885/885 transitions.
Applied a total of 0 rules in 63 ms. Remains 113 /113 variables (removed 0) and now considering 885/885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 113/113 places, 885/885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 885/885 transitions.
Applied a total of 0 rules in 62 ms. Remains 113 /113 variables (removed 0) and now considering 885/885 (removed 0) transitions.
[2025-06-05 22:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:21] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-05 22:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:22] [INFO ] State equation strengthened by 573 read => feed constraints.
[2025-06-05 22:10:23] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1958 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/113 places, 885/885 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 112 transition count 882
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 109 transition count 882
Performed 8 Post agglomeration using F-continuation condition with reduction of 67 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 101 transition count 807
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 71 place count 101 transition count 758
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 1 with 107 rules applied. Total rules applied 178 place count 101 transition count 651
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 101 transition count 651
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 182 place count 101 transition count 649
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 184 place count 99 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 186 place count 99 transition count 647
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 187 place count 98 transition count 646
Applied a total of 187 rules in 252 ms. Remains 98 /112 variables (removed 14) and now considering 646/885 (removed 239) transitions.
// Phase 1: matrix 646 rows 98 cols
[2025-06-05 22:10:23] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:23] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-05 22:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:24] [INFO ] State equation strengthened by 362 read => feed constraints.
[2025-06-05 22:10:24] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/113 places, 646/885 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3145 ms. Remains : 98/113 places, 646/885 transitions.
RANDOM walk for 40000 steps (1814 resets) in 416 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (246 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (240 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (243 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (236 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 473461 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 4
Probabilistic random walk after 473461 steps, saw 82362 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2025-06-05 22:10:27] [INFO ] Invariant cache hit.
[2025-06-05 22:10:28] [INFO ] State equation strengthened by 362 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 642/729 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/729 variables, 98/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 15/744 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 264/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/744 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 465 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:29] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:29] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:29] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:30] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:30] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 642/729 variables, 87/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 98/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 15/744 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 264/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:31] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 9 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/744 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/744 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/744 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 473 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3419 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4723ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 50 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 646/646 transitions.
Applied a total of 0 rules in 38 ms. Remains 98 /98 variables (removed 0) and now considering 646/646 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 98/98 places, 646/646 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 646/646 transitions.
Applied a total of 0 rules in 38 ms. Remains 98 /98 variables (removed 0) and now considering 646/646 (removed 0) transitions.
[2025-06-05 22:10:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:33] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-05 22:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:10:33] [INFO ] State equation strengthened by 362 read => feed constraints.
[2025-06-05 22:10:33] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:10:34] [INFO ] Redundant transitions in 83 ms returned []
Running 628 sub problems to find dead transitions.
[2025-06-05 22:10:34] [INFO ] Invariant cache hit.
[2025-06-05 22:10:34] [INFO ] State equation strengthened by 362 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:38] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:38] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:39] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:39] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:49] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:50] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:50] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:50] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:10:51] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 6 (OVERLAPS) 646/743 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 362/473 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/744 variables, and 473 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 97/98 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 628/96 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 5 (OVERLAPS) 646/743 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 362/473 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 96/569 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/744 variables, and 569 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 97/98 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 628/96 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61861ms problems are : Problem set: 0 solved, 628 unsolved
Search for dead transitions found 0 dead transitions in 61881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63071 ms. Remains : 98/98 places, 646/646 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 646
Applied a total of 1 rules in 46 ms. Remains 98 /98 variables (removed 0) and now considering 646/646 (removed 0) transitions.
Running SMT prover for 4 properties.
Excessive predecessor constraint size, skipping predecessor.
// Phase 1: matrix 646 rows 98 cols
[2025-06-05 22:11:36] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:11:36] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 22:11:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-05 22:11:36] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-06-05 22:11:36] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-05 22:11:36] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-05 22:11:36] [INFO ] Flatten gal took : 71 ms
[2025-06-05 22:11:37] [INFO ] Flatten gal took : 54 ms
[2025-06-05 22:11:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5818268891227317066.gal : 16 ms
[2025-06-05 22:11:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5282247983201139814.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5818268891227317066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5282247983201139814.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5282247983201139814.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 29
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :29 after 150
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :150 after 1473
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1473 after 2667
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2667 after 39600
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :39600 after 201652
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-10 does not hold.
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-08 does not hold.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :201652 after 360432
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-2025-12 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.30735e+07 after 2.01976e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.01976e+07 after 2.24741e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.93218e+07,7.81048,82912,2,7156,21,222928,7,0,1041,189906,0
Total reachable state count : 89321760

Verifying 4 reachability properties.
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-05,1260,7.81229,82912,2,205,21,222928,7,0,1045,189906,0
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-08,464376,7.83596,82912,2,2147,21,222928,8,0,1143,189906,0
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-10,1,7.83702,82912,2,99,21,222928,9,0,1160,189906,0
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-12,1.14893e+06,7.84556,82912,2,2310,21,222928,10,0,1177,189906,0
Over-approximation ignoring read arcs solved 0 properties in 8979 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 22:11:45] [INFO ] Flatten gal took : 414 ms
[2025-06-05 22:11:45] [INFO ] Applying decomposition
[2025-06-05 22:11:45] [INFO ] Flatten gal took : 385 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12037202556587087842.txt' '-o' '/tmp/graph12037202556587087842.bin' '-w' '/tmp/graph12037202556587087842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12037202556587087842.bin' '-l' '-1' '-v' '-w' '/tmp/graph12037202556587087842.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:11:48] [INFO ] Decomposing Gal with order
[2025-06-05 22:11:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:11:50] [INFO ] Removed a total of 31654 redundant transitions.
[2025-06-05 22:11:50] [INFO ] Flatten gal took : 1041 ms
[2025-06-05 22:11:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 279 ms.
[2025-06-05 22:11:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1634630954120094455.gal : 68 ms
[2025-06-05 22:11:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3791531318147468252.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1634630954120094455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3791531318147468252.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3791531318147468252.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 3.77376e+09
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3.77376e+09 after 5.96162e+09
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :5.96162e+09 after 6.78303e+10
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-05 does not hold.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6.78303e+10 after 1.3181e+12
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.3181e+12 after 1.59411e+12
Detected timeout of ITS tools.
[2025-06-05 22:41:55] [INFO ] Flatten gal took : 980 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16116737127468428008
[2025-06-05 22:41:57] [INFO ] Applying decomposition
[2025-06-05 22:41:57] [INFO ] Computing symmetric may disable matrix : 646 transitions.
[2025-06-05 22:41:57] [INFO ] Flatten gal took : 682 ms
[2025-06-05 22:41:57] [INFO ] Computation of Complete disable matrix. took 315 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:41:58] [INFO ] Computing symmetric may enable matrix : 646 transitions.
[2025-06-05 22:41:58] [INFO ] Computation of Complete enable matrix. took 187 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 22:42:02] [INFO ] Computing Do-Not-Accords matrix : 646 transitions.
[2025-06-05 22:42:02] [INFO ] Computation of Completed DNA matrix. took 59 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.202505121319/bin/convert-linux64' '-i' '/tmp/graph8650803333006875433.txt' '-o' '/tmp/graph8650803333006875433.bin' '-w' '/tmp/graph8650803333006875433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8650803333006875433.bin' '-l' '-1' '-v' '-w' '/tmp/graph8650803333006875433.weights' '-q' '0' '-e' '0.001'
[2025-06-05 22:42:02] [INFO ] Decomposing Gal with order
[2025-06-05 22:42:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 22:42:03] [INFO ] Built C files in 6295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16116737127468428008
[2025-06-05 22:42:03] [INFO ] Removed a total of 3984 redundant transitions.
[2025-06-05 22:42:03] [INFO ] Flatten gal took : 134 ms
Running compilation step : cd /tmp/ltsmin16116737127468428008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 22:42:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 105 ms.
[2025-06-05 22:42:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9521816649780266423.gal : 10 ms
[2025-06-05 22:42:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12550777553167821928.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9521816649780266423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12550777553167821928.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12550777553167821928.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 750
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :750 after 1.15316e+06
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-2025-12 is true.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-10 does not hold.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Compilation finished in 5741 ms.
Running link step : cd /tmp/ltsmin16116737127468428008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin16116737127468428008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'StigmergyElectionPT07bReachabilityCardinality202508==true'
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-08 does not hold.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.11956e+07,7.34239,155724,1845,25,82316,241,1043,1.70062e+06,64,779,0
Total reachable state count : 11195640

Verifying 3 reachability properties.
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-08,59400,8.09636,155724,305,17,82316,241,1196,1.70062e+06,79,779,0
Invariant property StigmergyElection-PT-07b-ReachabilityCardinality-2025-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-10,58080,8.25389,155724,280,19,82316,241,1222,1.70062e+06,81,779,0
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityCardinality-2025-12,360,8.31749,155724,52,18,82316,241,1248,1.70062e+06,81,779,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1955987 ms.

BK_STOP 1749163335694

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-07b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903491000254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07b.tgz
mv StigmergyElection-PT-07b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;