Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118400350.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716433391133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 03:03:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 03:03:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:03:13] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-23 03:03:13] [INFO ] Transformed 401 places.
[2024-05-23 03:03:13] [INFO ] Transformed 1328 transitions.
[2024-05-23 03:03:13] [INFO ] Found NUPN structural information;
[2024-05-23 03:03:13] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3353 ms. (11 steps per ms) remains 2/11 properties
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 03:03:15] [INFO ] Flatten gal took : 430 ms
[2024-05-23 03:03:15] [INFO ] Flatten gal took : 168 ms
BEST_FIRST walk for 40003 steps (8 resets) in 601 ms. (66 steps per ms) remains 2/2 properties
[2024-05-23 03:03:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14861948596283025289.gal : 115 ms
BEST_FIRST walk for 40003 steps (8 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
[2024-05-23 03:03:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14631587714661785502.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14861948596283025289.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14631587714661785502.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
// Phase 1: matrix 1328 rows 401 cols
[2024-05-23 03:03:15] [INFO ] Computed 19 invariants in 94 ms
[2024-05-23 03:03:15] [INFO ] State equation strengthened by 56 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality14631587714661785502.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem Anderson-PT-08-ReachabilityCardinality-2024-11 is UNSAT
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 341/385 variables, 9/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 19
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 341/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19 after 55
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55 after 76
At refinement iteration 5 (OVERLAPS) 16/401 variables, 10/404 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 16/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :76 after 391
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :391 after 841
At refinement iteration 8 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :841 after 4198
At refinement iteration 9 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1405 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 360/384 variables, 9/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 360/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/401 variables, 10/403 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 17/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 03:03:18] [INFO ] Deduced a trap composed of 121 places in 494 ms of which 68 ms to minimize.
[2024-05-23 03:03:18] [INFO ] Deduced a trap composed of 111 places in 480 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4198 after 28393
[2024-05-23 03:03:19] [INFO ] Deduced a trap composed of 81 places in 450 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 3/423 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/423 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1328/1729 variables, 401/824 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 56/880 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1729 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 881 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2836 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 4573ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 24 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 401 transition count 1280
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 353 transition count 1280
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 200 place count 249 transition count 448
Iterating global reduction 0 with 104 rules applied. Total rules applied 304 place count 249 transition count 448
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 312 place count 245 transition count 444
Applied a total of 312 rules in 193 ms. Remains 245 /401 variables (removed 156) and now considering 444/1328 (removed 884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 245/401 places, 444/1328 transitions.
RANDOM walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :28393 after 188444
Interrupted probabilistic random walk after 819896 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 819896 steps, saw 533745 distinct states, run finished after 3009 ms. (steps per millisecond=272 ) properties seen :0
// Phase 1: matrix 444 rows 245 cols
[2024-05-23 03:03:23] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 03:03:23] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/236 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/245 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 444/689 variables, 245/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 56/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/689 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 245/245 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 212/236 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/245 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 444/689 variables, 245/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 56/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/689 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 245/245 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 24 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 444/444 transitions.
Applied a total of 0 rules in 47 ms. Remains 245 /245 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 245/245 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 444/444 transitions.
Applied a total of 0 rules in 35 ms. Remains 245 /245 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-05-23 03:03:25] [INFO ] Invariant cache hit.
[2024-05-23 03:03:26] [INFO ] Implicit Places using invariants in 464 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 479 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/245 places, 444/444 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 244 transition count 407
Reduce places removed 37 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 47 rules applied. Total rules applied 84 place count 207 transition count 397
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 94 place count 197 transition count 397
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 197 transition count 387
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 114 place count 187 transition count 387
Applied a total of 114 rules in 37 ms. Remains 187 /244 variables (removed 57) and now considering 387/444 (removed 57) transitions.
// Phase 1: matrix 387 rows 187 cols
[2024-05-23 03:03:26] [INFO ] Computed 18 invariants in 6 ms
[2024-05-23 03:03:26] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-23 03:03:26] [INFO ] Invariant cache hit.
[2024-05-23 03:03:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:03:27] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/245 places, 387/444 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1833 ms. Remains : 187/245 places, 387/444 transitions.
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 998787 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 1
Probabilistic random walk after 998787 steps, saw 615695 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2024-05-23 03:03:30] [INFO ] Invariant cache hit.
[2024-05-23 03:03:30] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/574 variables, 187/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 56/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/574 variables, 187/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 56/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/574 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 24 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 387/387 transitions.
Applied a total of 0 rules in 18 ms. Remains 187 /187 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 187/187 places, 387/387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 387/387 transitions.
Applied a total of 0 rules in 17 ms. Remains 187 /187 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-23 03:03:31] [INFO ] Invariant cache hit.
[2024-05-23 03:03:31] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-23 03:03:31] [INFO ] Invariant cache hit.
[2024-05-23 03:03:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:03:32] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2024-05-23 03:03:32] [INFO ] Redundant transitions in 35 ms returned []
Running 379 sub problems to find dead transitions.
[2024-05-23 03:03:32] [INFO ] Invariant cache hit.
[2024-05-23 03:03:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 03:03:36] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 2 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 4 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 4 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 4 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 3 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2024-05-23 03:03:40] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 3 ms to minimize.
[2024-05-23 03:03:40] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 2 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 2 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 5 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 4 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 4 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :188444 after 5.94293e+06
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 10 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 3 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 4 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 4 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 60 places in 247 ms of which 4 ms to minimize.
[2024-05-23 03:03:45] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 5 ms to minimize.
[2024-05-23 03:03:45] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 4 ms to minimize.
[2024-05-23 03:03:45] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 4 ms to minimize.
[2024-05-23 03:03:46] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.94293e+06 after 6.63089e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 87 places in 243 ms of which 4 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 3 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 78 places in 238 ms of which 5 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 4 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 3 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 60 places in 243 ms of which 3 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 4 ms to minimize.
[2024-05-23 03:03:52] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 4 ms to minimize.
[2024-05-23 03:03:52] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 4 ms to minimize.
[2024-05-23 03:03:52] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 4 ms to minimize.
[2024-05-23 03:03:52] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 3 ms to minimize.
[2024-05-23 03:03:53] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 4 ms to minimize.
[2024-05-23 03:03:53] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 3 ms to minimize.
[2024-05-23 03:03:53] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 22 ms to minimize.
[2024-05-23 03:03:53] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 8 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 74 places in 232 ms of which 3 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 3 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 4 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 3 ms to minimize.
[2024-05-23 03:03:55] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 3 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2024-05-23 03:03:58] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-23 03:03:58] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 2 ms to minimize.
[2024-05-23 03:03:58] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-23 03:03:59] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-23 03:03:59] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 3 ms to minimize.
[2024-05-23 03:03:59] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-05-23 03:03:59] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2024-05-23 03:03:59] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 2 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 4 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 3 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 3 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 2 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 4 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 3 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 187/574 variables, and 98 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/187 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 80/98 constraints. Problems are: Problem set: 0 solved, 379 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :6.63089e+06 after 1.17824e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/574 variables, and 98 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/187 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/379 constraints, Known Traps: 80/80 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62089 ms. Remains : 187/187 places, 387/387 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 0 place count 187 transition count 332
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 132 transition count 332
Applied a total of 110 rules in 22 ms. Remains 132 /187 variables (removed 55) and now considering 332/387 (removed 55) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 332 rows 132 cols
[2024-05-23 03:04:33] [INFO ] Computed 18 invariants in 6 ms
[2024-05-23 03:04:33] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 03:04:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-23 03:04:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2024-05-23 03:04:34] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 03:04:34] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 03:04:34] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 03:04:34] [INFO ] Flatten gal took : 48 ms
[2024-05-23 03:04:34] [INFO ] Flatten gal took : 46 ms
[2024-05-23 03:04:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3795816752771271766.gal : 9 ms
[2024-05-23 03:04:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11880156512670181631.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3795816752771271766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11880156512670181631.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11880156512670181631.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 61
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :61 after 106
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :106 after 326
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :326 after 704
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :704 after 7472
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7472 after 237264
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :237264 after 280853
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :280853 after 481788
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :481788 after 1.26376e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.26376e+06 after 5.00236e+06
Detected timeout of ITS tools.
[2024-05-23 03:04:49] [INFO ] Flatten gal took : 24 ms
[2024-05-23 03:04:49] [INFO ] Applying decomposition
[2024-05-23 03:04:49] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13678560077967112609.txt' '-o' '/tmp/graph13678560077967112609.bin' '-w' '/tmp/graph13678560077967112609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13678560077967112609.bin' '-l' '-1' '-v' '-w' '/tmp/graph13678560077967112609.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:04:49] [INFO ] Decomposing Gal with order
[2024-05-23 03:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:04:49] [INFO ] Removed a total of 612 redundant transitions.
[2024-05-23 03:04:49] [INFO ] Flatten gal took : 135 ms
[2024-05-23 03:04:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 30 ms.
[2024-05-23 03:04:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12839614566539625623.gal : 9 ms
[2024-05-23 03:04:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality979094432112821252.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12839614566539625623.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality979094432112821252.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality979094432112821252.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2238
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.17824e+07 after 1.82384e+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\_mod\_flat,1.30356e+07,9.98339,190884,8113,113,236699,530,833,1.04464e+06,149,1807,0
Total reachable state count : 13035646

Verifying 1 reachability properties.
Reachability property Anderson-PT-08-ReachabilityCardinality-2024-09 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
Anderson-PT-08-ReachabilityCardinality-2024-09,1,10.1752,190884,60,33,236699,530,877,1.04464e+06,160,1807,28765
Over-approximation ignoring read arcs solved 0 properties in 26740 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 03:05:00] [INFO ] Flatten gal took : 82 ms
[2024-05-23 03:05:00] [INFO ] Applying decomposition
[2024-05-23 03:05:00] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8509746742211131354.txt' '-o' '/tmp/graph8509746742211131354.bin' '-w' '/tmp/graph8509746742211131354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8509746742211131354.bin' '-l' '-1' '-v' '-w' '/tmp/graph8509746742211131354.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:05:00] [INFO ] Decomposing Gal with order
[2024-05-23 03:05:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:05:01] [INFO ] Removed a total of 2181 redundant transitions.
[2024-05-23 03:05:01] [INFO ] Flatten gal took : 246 ms
[2024-05-23 03:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 52 ms.
[2024-05-23 03:05:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10227894474225584001.gal : 16 ms
[2024-05-23 03:05:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17884796568306320541.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10227894474225584001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17884796568306320541.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17884796568306320541.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7 after 28
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28 after 41
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :41 after 155
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :155 after 1309
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1309 after 2321
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2321 after 8551
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8551 after 114635
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :114635 after 346497
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :346497 after 435777
ITS-tools command line returned an error code 137
[2024-05-23 03:24:29] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2755254884133319907
[2024-05-23 03:24:29] [INFO ] Applying decomposition
[2024-05-23 03:24:29] [INFO ] Flatten gal took : 19 ms
[2024-05-23 03:24:29] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-23 03:24:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:24:29] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-23 03:24:29] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4102446983191649414.txt' '-o' '/tmp/graph4102446983191649414.bin' '-w' '/tmp/graph4102446983191649414.weights'
[2024-05-23 03:24:29] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4102446983191649414.bin' '-l' '-1' '-v' '-w' '/tmp/graph4102446983191649414.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:24:29] [INFO ] Decomposing Gal with order
[2024-05-23 03:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:24:29] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:24:29] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2755254884133319907
[2024-05-23 03:24:29] [INFO ] Removed a total of 607 redundant transitions.
Running compilation step : cd /tmp/ltsmin2755254884133319907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 03:24:29] [INFO ] Flatten gal took : 61 ms
[2024-05-23 03:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 20 ms.
[2024-05-23 03:24:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12104687800174228454.gal : 6 ms
[2024-05-23 03:24:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality746690630696547112.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12104687800174228454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality746690630696547112.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality746690630696547112.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 126
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :126 after 273
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :273 after 325
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :325 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 1786
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1786 after 7328
Compilation finished in 2441 ms.
Running link step : cd /tmp/ltsmin2755254884133319907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin2755254884133319907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AndersonPT08ReachabilityCardinality202409==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
petri\_inst\_inst\_mod\_flat,1.04587e+07,94.579,583436,23135,447,909848,3470,1168,1.7983e+06,236,46021,0
Total reachable state count : 10458747

Verifying 1 reachability properties.
Reachability property Anderson-PT-08-ReachabilityCardinality-2024-09 does not hold.
FORMULA Anderson-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : Anderson-PT-08-ReachabilityCardinality-2024-09

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Anderson-PT-08-ReachabilityCardinality-2024-09,0,98.0171,580964,1,0,909848,3470,1212,1.7983e+06,248,46021,165067
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1492187 ms.

BK_STOP 1716434885820

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Anderson-PT-08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-08, 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 r004-smll-171620118400350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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