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.r070-tall-171620505100103.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 CANInsertWithFailure-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K 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 CANInsertWithFailure-PT-010-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2023-04
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2023-07
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-010-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716236907111

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 20:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:28:28] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-20 20:28:28] [INFO ] Transformed 324 places.
[2024-05-20 20:28:28] [INFO ] Transformed 660 transitions.
[2024-05-20 20:28:28] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-20 20:28:28] [INFO ] Flatten gal took : 103 ms
RANDOM walk for 40000 steps (180 resets) in 1589 ms. (25 steps per ms) remains 5/16 properties
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 20:28:29] [INFO ] Flatten gal took : 131 ms
BEST_FIRST walk for 40003 steps (20 resets) in 496 ms. (80 steps per ms) remains 5/5 properties
[2024-05-20 20:28:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8326038234662772356.gal : 33 ms
[2024-05-20 20:28:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14903674044686499104.prop : 3 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/ReachabilityCardinality8326038234662772356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14903674044686499104.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
BEST_FIRST walk for 40002 steps (21 resets) in 401 ms. (99 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality14903674044686499104.prop.
BEST_FIRST walk for 40004 steps (26 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :11 after 14
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :14 after 46
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :46 after 73
BEST_FIRST walk for 40003 steps (17 resets) in 509 ms. (78 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :73 after 103
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :103 after 156
BEST_FIRST walk for 40004 steps (17 resets) in 133 ms. (298 steps per ms) remains 4/5 properties
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 660 rows 324 cols
[2024-05-20 20:28:29] [INFO ] Computed 13 invariants in 17 ms
[2024-05-20 20:28:29] [INFO ] State equation strengthened by 190 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :156 after 1846
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1846 after 2587
At refinement iteration 1 (OVERLAPS) 226/323 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 660/983 variables, 323/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem CANInsertWithFailure-PT-010-ReachabilityFireability-2024-06 is UNSAT
FORMULA CANInsertWithFailure-PT-010-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/983 variables, 190/526 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2587 after 20132
At refinement iteration 6 (INCLUDED_ONLY) 0/983 variables, 0/526 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/984 variables, 1/527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/984 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 527 constraints, problems are : Problem set: 1 solved, 3 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 239/323 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/983 variables, 323/337 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/983 variables, 190/527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/983 variables, 3/530 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :20132 after 86032
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/530 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/984 variables, 1/531 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/984 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 984/984 variables, and 531 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1578 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2666ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 973 ms.
Support contains 84 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 323 transition count 629
Reduce places removed 31 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 39 rules applied. Total rules applied 71 place count 292 transition count 621
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 79 place count 284 transition count 621
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 79 place count 284 transition count 613
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 95 place count 276 transition count 613
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 147 place count 250 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 171 place count 250 transition count 563
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 178 place count 250 transition count 556
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 185 place count 243 transition count 556
Partial Free-agglomeration rule applied 112 times.
Drop transitions (Partial Free agglomeration) removed 112 transitions
Iterating global reduction 4 with 112 rules applied. Total rules applied 297 place count 243 transition count 556
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 321 place count 243 transition count 556
Applied a total of 321 rules in 145 ms. Remains 243 /324 variables (removed 81) and now considering 556/660 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 243/324 places, 556/660 transitions.
RANDOM walk for 40000 steps (369 resets) in 317 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 794 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :86032 after 124319
Interrupted probabilistic random walk after 659332 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 3
Probabilistic random walk after 659332 steps, saw 105732 distinct states, run finished after 3011 ms. (steps per millisecond=218 ) properties seen :0
// Phase 1: matrix 556 rows 243 cols
[2024-05-20 20:28:36] [INFO ] Computed 12 invariants in 9 ms
[2024-05-20 20:28:36] [INFO ] State equation strengthened by 237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 158/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 556/798 variables, 242/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 237/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/799 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/799 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/799 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 492 constraints, problems are : Problem set: 0 solved, 3 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 243/243 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 158/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 20:28:37] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 556/798 variables, 242/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 237/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/799 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/799 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/799 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 799/799 variables, and 496 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1653 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 243/243 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2258ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 572 ms.
Support contains 84 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 556/556 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 243/243 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 556/556 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2024-05-20 20:28:39] [INFO ] Invariant cache hit.
[2024-05-20 20:28:39] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-20 20:28:39] [INFO ] Invariant cache hit.
[2024-05-20 20:28:39] [INFO ] State equation strengthened by 237 read => feed constraints.
[2024-05-20 20:28:40] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-20 20:28:40] [INFO ] Redundant transitions in 29 ms returned []
Running 546 sub problems to find dead transitions.
[2024-05-20 20:28:40] [INFO ] Invariant cache hit.
[2024-05-20 20:28:40] [INFO ] State equation strengthened by 237 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:42] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-20 20:28:42] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:28:42] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 5 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:44] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-20 20:28:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:28:45] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
[2024-05-20 20:28:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:28:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
Invariant property CANInsertWithFailure-PT-010-ReachabilityFireability-2024-11 does not hold.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :124319 after 2.11311e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:28:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 8 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:49] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:28:50] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 2 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:51] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :2.11311e+06 after 1.89728e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:55] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:28:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:28:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:28:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:28:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:28:58] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:28:58] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:28:58] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:28:59] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:29:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:29:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:29:04] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:29:04] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:29:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:29:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:29:10] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.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 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.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 1.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 0.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 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/799 variables, and 129 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/243 constraints, ReadFeed: 0/237 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:29:13] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:29:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:29:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:29:14] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:29:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:29:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:29:15] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-20 20:29:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:29:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:29:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:29:20] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 7 (OVERLAPS) 556/798 variables, 242/382 constraints. Problems are: Problem set: 0 solved, 546 unsolved
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :1.89728e+07 after 1.11292e+08
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD553 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 237/619 constraints. Problems are: Problem set: 19 solved, 527 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 527/1146 constraints. Problems are: Problem set: 19 solved, 527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/799 variables, and 1146 constraints, problems are : Problem set: 19 solved, 527 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 242/243 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 527/546 constraints, Known Traps: 128/128 constraints]
After SMT, in 60248ms problems are : Problem set: 19 solved, 527 unsolved
Search for dead transitions found 19 dead transitions in 60254ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 243/243 places, 537/556 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 228 transition count 507
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 228 transition count 507
Applied a total of 30 rules in 21 ms. Remains 228 /243 variables (removed 15) and now considering 507/537 (removed 30) transitions.
// Phase 1: matrix 507 rows 228 cols
[2024-05-20 20:29:40] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:29:40] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-20 20:29:40] [INFO ] Invariant cache hit.
[2024-05-20 20:29:40] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-20 20:29:40] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/243 places, 507/556 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61180 ms. Remains : 228/243 places, 507/556 transitions.
RANDOM walk for 40000 steps (374 resets) in 428 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (39 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (41 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 860103 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 3
Probabilistic random walk after 860103 steps, saw 137942 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
[2024-05-20 20:29:44] [INFO ] Invariant cache hit.
[2024-05-20 20:29:44] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/227 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 507/734 variables, 227/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 231/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/735 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/735 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 735/735 variables, and 471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 228/228 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/227 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 20:29:44] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:29:44] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 507/734 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/735 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/735 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 735/735 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 228/228 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1941ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 235 ms.
Support contains 84 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 507/507 transitions.
Applied a total of 0 rules in 22 ms. Remains 228 /228 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 228/228 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 507/507 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2024-05-20 20:29:46] [INFO ] Invariant cache hit.
[2024-05-20 20:29:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 20:29:46] [INFO ] Invariant cache hit.
[2024-05-20 20:29:46] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-20 20:29:46] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-20 20:29:46] [INFO ] Redundant transitions in 12 ms returned []
Running 497 sub problems to find dead transitions.
[2024-05-20 20:29:46] [INFO ] Invariant cache hit.
[2024-05-20 20:29:46] [INFO ] State equation strengthened by 231 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:29:48] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-20 20:29:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:29:48] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:29:48] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:29:49] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-20 20:29:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:29:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-05-20 20:29:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:29:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:29:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:29:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:29:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:30:00] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:30:00] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:30:00] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:30:00] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:30:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:30:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:30:01] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:30:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:30:01] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:30:02] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:30:03] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-20 20:30:03] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:30:03] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:30:03] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:30:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:30:03] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:30:04] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:30:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 4 ms to minimize.
[2024-05-20 20:30:04] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:30:04] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:30:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:30:08] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-20 20:30:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:30:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:30:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:30:13] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/735 variables, and 145 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/228 constraints, ReadFeed: 0/231 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 133/133 constraints]
Escalating to Integer solving :Problem set: 0 solved, 497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 4 (OVERLAPS) 507/734 variables, 227/372 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 231/603 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 497/1100 constraints. Problems are: Problem set: 0 solved, 497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 734/735 variables, and 1100 constraints, problems are : Problem set: 0 solved, 497 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 227/228 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 497/497 constraints, Known Traps: 133/133 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60548 ms. Remains : 228/228 places, 507/507 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 132 edges and 228 vertex of which 18 / 228 are part of one of the 2 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 564 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 12 place count 200 transition count 452
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 200 transition count 452
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 200 transition count 442
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 196 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 64 place count 196 transition count 414
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 69 place count 196 transition count 409
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 74 place count 191 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 191 transition count 408
Free-agglomeration rule applied 14 times with reduction of 1 identical transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 89 place count 191 transition count 393
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 109 place count 177 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 177 transition count 386
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 145 place count 177 transition count 386
Applied a total of 145 rules in 107 ms. Remains 177 /228 variables (removed 51) and now considering 386/507 (removed 121) transitions.
Running SMT prover for 3 properties.
[2024-05-20 20:30:46] [INFO ] Flow matrix only has 385 transitions (discarded 1 similar events)
// Phase 1: matrix 385 rows 177 cols
[2024-05-20 20:30:46] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:30:47] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 20:30:47] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 20:30:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:30:47] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 20:30:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 20:30:47] [INFO ] After 150ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 20:30:47] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 20:30:47] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-20 20:30:47] [INFO ] Flatten gal took : 29 ms
[2024-05-20 20:30:47] [INFO ] Flatten gal took : 16 ms
[2024-05-20 20:30:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17649259900213251494.gal : 4 ms
[2024-05-20 20:30:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality872887647777882694.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/ReachabilityCardinality17649259900213251494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality872887647777882694.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 ...328
Loading property file /tmp/ReachabilityCardinality872887647777882694.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 40
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :40 after 194
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :194 after 388
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :388 after 1978
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1978 after 9363
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :9363 after 16736
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :16736 after 306082
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :306082 after 7.08784e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7.08784e+06 after 1.16654e+09
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :1.11292e+08 after 2.64103e+08
Detected timeout of ITS tools.
[2024-05-20 20:31:02] [INFO ] Flatten gal took : 16 ms
[2024-05-20 20:31:02] [INFO ] Applying decomposition
[2024-05-20 20:31:02] [INFO ] Flatten gal took : 15 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/graph2569026389461590492.txt' '-o' '/tmp/graph2569026389461590492.bin' '-w' '/tmp/graph2569026389461590492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2569026389461590492.bin' '-l' '-1' '-v' '-w' '/tmp/graph2569026389461590492.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:31:03] [INFO ] Decomposing Gal with order
[2024-05-20 20:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:31:03] [INFO ] Removed a total of 286 redundant transitions.
[2024-05-20 20:31:03] [INFO ] Flatten gal took : 133 ms
[2024-05-20 20:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 10 ms.
[2024-05-20 20:31:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5422652810227151907.gal : 6 ms
[2024-05-20 20:31:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9313389242120829640.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/ReachabilityCardinality5422652810227151907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9313389242120829640.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/ReachabilityCardinality9313389242120829640.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 592
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :592 after 1298
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1298 after 9327
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :9327 after 266170
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :266170 after 5.69017e+08
Reachability property CANInsertWithFailure-PT-010-ReachabilityFireability-2023-07 is true.
Invariant property CANInsertWithFailure-PT-010-ReachabilityFireability-2024-05 does not hold.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31436 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 20:31:18] [INFO ] Flatten gal took : 26 ms
[2024-05-20 20:31:18] [INFO ] Applying decomposition
[2024-05-20 20:31:18] [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/graph9450705837571841610.txt' '-o' '/tmp/graph9450705837571841610.bin' '-w' '/tmp/graph9450705837571841610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9450705837571841610.bin' '-l' '-1' '-v' '-w' '/tmp/graph9450705837571841610.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:31:18] [INFO ] Decomposing Gal with order
[2024-05-20 20:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:31:18] [INFO ] Removed a total of 309 redundant transitions.
[2024-05-20 20:31:18] [INFO ] Flatten gal took : 46 ms
[2024-05-20 20:31:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 10 ms.
[2024-05-20 20:31:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4856436592735323879.gal : 6 ms
[2024-05-20 20:31:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7962901907531938993.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4856436592735323879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7962901907531938993.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/ReachabilityCardinality7962901907531938993.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 66
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :66 after 74
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :74 after 78
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :78 after 82
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :82 after 30009
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :30009 after 31693
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :31693 after 37558
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :37558 after 56125
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :56125 after 1.10934e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.10934e+06 after 1.24169e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.24169e+06 after 3.31914e+08
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :9.22827e+10 after 9.24176e+10
Detected timeout of ITS tools.
[2024-05-20 21:01:18] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5767604755996260614
[2024-05-20 21:01:18] [INFO ] Applying decomposition
[2024-05-20 21:01:18] [INFO ] Computing symmetric may disable matrix : 507 transitions.
[2024-05-20 21:01:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 21:01:18] [INFO ] Computing symmetric may enable matrix : 507 transitions.
[2024-05-20 21:01:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 21:01:18] [INFO ] Flatten gal took : 15 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/graph6482271798384389966.txt' '-o' '/tmp/graph6482271798384389966.bin' '-w' '/tmp/graph6482271798384389966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6482271798384389966.bin' '-l' '-1' '-v' '-w' '/tmp/graph6482271798384389966.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:01:18] [INFO ] Decomposing Gal with order
[2024-05-20 21:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:01:18] [INFO ] Computing Do-Not-Accords matrix : 507 transitions.
[2024-05-20 21:01:18] [INFO ] Removed a total of 375 redundant transitions.
[2024-05-20 21:01:18] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 21:01:18] [INFO ] Flatten gal took : 39 ms
[2024-05-20 21:01:18] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5767604755996260614
Running compilation step : cd /tmp/ltsmin5767604755996260614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 21:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 13 ms.
[2024-05-20 21:01:18] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10426224672402388129.gal : 4 ms
[2024-05-20 21:01:18] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15198786761662635359.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/ReachabilityFireability10426224672402388129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15198786761662635359.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/ReachabilityFireability15198786761662635359.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 242
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :242 after 243
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :243 after 245
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :245 after 272
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :272 after 503
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :503 after 805
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :805 after 27879
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :27879 after 1.35059e+06
Compilation finished in 1304 ms.
Running link step : cd /tmp/ltsmin5767604755996260614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202304==true'
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.35059e+06 after 2.09992e+07
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.09992e+07 after 7.9009e+08
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202304==true'
Running LTSmin : cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202405==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202307==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202307==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin5767604755996260614;'/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' 'CANInsertWithFailurePT010ReachabilityFireability202304==true'
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7.9009e+08 after 3.87917e+09

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-010, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505100103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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