Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167500358.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 AutonomousCar-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 865K 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 AutonomousCar-PT-09b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716351880113

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 04:24:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 04:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:24:43] [INFO ] Load time of PNML (sax parser for PT used): 534 ms
[2024-05-22 04:24:43] [INFO ] Transformed 391 places.
[2024-05-22 04:24:43] [INFO ] Transformed 1554 transitions.
[2024-05-22 04:24:43] [INFO ] Found NUPN structural information;
[2024-05-22 04:24:43] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 884 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (266 resets) in 3520 ms. (11 steps per ms) remains 3/12 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (43 resets) in 606 ms. (65 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (44 resets) in 989 ms. (40 steps per ms) remains 2/2 properties
// Phase 1: matrix 1554 rows 391 cols
[2024-05-22 04:24:45] [INFO ] Computed 14 invariants in 91 ms
[2024-05-22 04:24:45] [INFO ] Flatten gal took : 744 ms
[2024-05-22 04:24:45] [INFO ] Flatten gal took : 290 ms
[2024-05-22 04:24:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6297116329242061526.gal : 135 ms
[2024-05-22 04:24:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14505393623083385901.prop : 4 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/ReachabilityCardinality6297116329242061526.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14505393623083385901.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 341/391 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 341/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality14505393623083385901.prop.
At refinement iteration 5 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
After SMT solving in domain Real declared 1945/1945 variables, and 796 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1801 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 5
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6 after 26
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :26 after 57
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :57 after 71
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 341/391 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 341/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :71 after 5631
[2024-05-22 04:24:48] [INFO ] Deduced a trap composed of 35 places in 1183 ms of which 20 ms to minimize.
[2024-05-22 04:24:49] [INFO ] Deduced a trap composed of 18 places in 1108 ms of which 45 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
[2024-05-22 04:24:50] [INFO ] Deduced a trap composed of 12 places in 960 ms of which 5 ms to minimize.
SDD size :5631 after 5.68099e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.68099e+06 after 5.71048e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.71048e+06 after 7.26849e+06
[2024-05-22 04:24:52] [INFO ] Deduced a trap composed of 16 places in 1334 ms of which 21 ms to minimize.
[2024-05-22 04:24:53] [INFO ] Deduced a trap composed of 35 places in 1011 ms of which 4 ms to minimize.
SMT process timed out in 8311ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 288 edges and 391 vertex of which 2 / 391 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1701 edges and 390 vertex of which 386 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.30 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 386 transition count 1436
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 128 rules applied. Total rules applied 243 place count 274 transition count 1420
Reduce places removed 9 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 265 transition count 1401
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 290 place count 246 transition count 1401
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 290 place count 246 transition count 1389
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 314 place count 234 transition count 1389
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 343 place count 205 transition count 1360
Iterating global reduction 4 with 29 rules applied. Total rules applied 372 place count 205 transition count 1360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 375 place count 205 transition count 1357
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 377 place count 203 transition count 1321
Iterating global reduction 5 with 2 rules applied. Total rules applied 379 place count 203 transition count 1321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 381 place count 203 transition count 1319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 382 place count 202 transition count 1319
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 480 place count 153 transition count 1270
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 488 place count 145 transition count 1118
Iterating global reduction 7 with 8 rules applied. Total rules applied 496 place count 145 transition count 1118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 500 place count 143 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 238 transitions
Redundant transition composition rules discarded 238 transitions
Iterating global reduction 7 with 238 rules applied. Total rules applied 738 place count 143 transition count 881
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 751 place count 143 transition count 868
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 764 place count 130 transition count 868
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 768 place count 130 transition count 864
Applied a total of 768 rules in 732 ms. Remains 130 /391 variables (removed 261) and now considering 864/1554 (removed 690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 748 ms. Remains : 130/391 places, 864/1554 transitions.
RANDOM walk for 40000 steps (565 resets) in 487 ms. (81 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (98 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
// Phase 1: matrix 864 rows 130 cols
[2024-05-22 04:24:54] [INFO ] Computed 14 invariants in 10 ms
[2024-05-22 04:24:54] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/130 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 864/994 variables, 130/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/994 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/994 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 994/994 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 7/7 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.26849e+06 after 4.23982e+07
[2024-05-22 04:24:55] [INFO ] Deduced a trap composed of 12 places in 460 ms of which 2 ms to minimize.
[2024-05-22 04:24:55] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 2 ms to minimize.
[2024-05-22 04:24:56] [INFO ] Deduced a trap composed of 7 places in 411 ms of which 3 ms to minimize.
[2024-05-22 04:24:56] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 1 ms to minimize.
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 1 ms to minimize.
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 1 ms to minimize.
[2024-05-22 04:24:57] [INFO ] Deduced a trap composed of 13 places in 344 ms of which 1 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2024-05-22 04:24:58] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 25/130 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 864/994 variables, 130/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/994 variables, 7/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.23982e+07 after 1.66076e+09
At refinement iteration 8 (INCLUDED_ONLY) 0/994 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:24:59] [INFO ] Deduced a trap composed of 13 places in 568 ms of which 2 ms to minimize.
[2024-05-22 04:25:00] [INFO ] Deduced a trap composed of 14 places in 524 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/994 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/994 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/994 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 994/994 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6146 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 130/130 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 6677ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 18 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 864/864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 130 transition count 849
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 115 transition count 847
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 114 transition count 843
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 41 place count 110 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 41 place count 110 transition count 841
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 45 place count 108 transition count 841
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 49 place count 104 transition count 819
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 104 transition count 819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 104 transition count 818
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 78 place count 92 transition count 806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 92 transition count 805
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 80 place count 91 transition count 795
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 91 transition count 795
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 90 transition count 795
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 86 place count 90 transition count 792
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 92 place count 90 transition count 786
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 107 place count 84 transition count 777
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 108 place count 83 transition count 776
Applied a total of 108 rules in 306 ms. Remains 83 /130 variables (removed 47) and now considering 776/864 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 83/130 places, 776/864 transitions.
RANDOM walk for 40000 steps (158 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (114 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 983593 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 983593 steps, saw 131048 distinct states, run finished after 3010 ms. (steps per millisecond=326 ) properties seen :0
// Phase 1: matrix 776 rows 83 cols
[2024-05-22 04:25:04] [INFO ] Computed 14 invariants in 20 ms
[2024-05-22 04:25:04] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 767/838 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/859 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/859 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/859 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:25:05] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2024-05-22 04:25:05] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 2 ms to minimize.
[2024-05-22 04:25:06] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 767/838 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/859 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/859 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/859 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/859 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 18 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 776/776 transitions.
Applied a total of 0 rules in 38 ms. Remains 83 /83 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 83/83 places, 776/776 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 776/776 transitions.
Applied a total of 0 rules in 38 ms. Remains 83 /83 variables (removed 0) and now considering 776/776 (removed 0) transitions.
[2024-05-22 04:25:06] [INFO ] Invariant cache hit.
[2024-05-22 04:25:07] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-22 04:25:07] [INFO ] Invariant cache hit.
[2024-05-22 04:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:25:07] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 995 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 776/776 transitions.
Applied a total of 0 rules in 38 ms. Remains 82 /82 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1073 ms. Remains : 82/83 places, 776/776 transitions.
RANDOM walk for 40000 steps (217 resets) in 540 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (113 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.66076e+09 after 1.95214e+10
Interrupted probabilistic random walk after 1038768 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1038768 steps, saw 139828 distinct states, run finished after 3002 ms. (steps per millisecond=346 ) properties seen :0
// Phase 1: matrix 776 rows 82 cols
[2024-05-22 04:25:11] [INFO ] Computed 13 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 766/833 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/858 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/858 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/858 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 858/858 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:25:12] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2024-05-22 04:25:12] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 766/833 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/858 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/858 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/858 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 1 ms to minimize.
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/858 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/858 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/858 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 858/858 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2465 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2824ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 270 ms.
Support contains 18 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 776/776 transitions.
Applied a total of 0 rules in 37 ms. Remains 82 /82 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 82/82 places, 776/776 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 776/776 transitions.
Applied a total of 0 rules in 34 ms. Remains 82 /82 variables (removed 0) and now considering 776/776 (removed 0) transitions.
[2024-05-22 04:25:14] [INFO ] Invariant cache hit.
[2024-05-22 04:25:14] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-22 04:25:14] [INFO ] Invariant cache hit.
[2024-05-22 04:25:15] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2024-05-22 04:25:15] [INFO ] Redundant transitions in 76 ms returned [727]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 771 sub problems to find dead transitions.
// Phase 1: matrix 775 rows 82 cols
[2024-05-22 04:25:15] [INFO ] Computed 13 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-22 04:25:40] [INFO ] Deduced a trap composed of 20 places in 779 ms of which 2 ms to minimize.
[2024-05-22 04:25:41] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 1 ms to minimize.
[2024-05-22 04:25:42] [INFO ] Deduced a trap composed of 4 places in 583 ms of which 1 ms to minimize.
[2024-05-22 04:25:45] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 2 ms to minimize.
[2024-05-22 04:25:45] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 2 ms to minimize.
[2024-05-22 04:25:45] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 1 ms to minimize.
[2024-05-22 04:25:46] [INFO ] Deduced a trap composed of 10 places in 387 ms of which 2 ms to minimize.
[2024-05-22 04:25:46] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2024-05-22 04:25:46] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 2 ms to minimize.
[2024-05-22 04:25:47] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 6 ms to minimize.
[2024-05-22 04:25:47] [INFO ] Deduced a trap composed of 6 places in 493 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.95214e+10 after 2.04945e+11
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 5 (OVERLAPS) 775/857 variables, 82/106 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 857/857 variables, and 106 constraints, problems are : Problem set: 0 solved, 771 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 771/771 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 771 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 3 (OVERLAPS) 4/82 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 6 (OVERLAPS) 775/857 variables, 82/106 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 877 constraints, problems are : Problem set: 0 solved, 771 unsolved in 30681 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 771/771 constraints, Known Traps: 11/11 constraints]
After SMT, in 76618ms problems are : Problem set: 0 solved, 771 unsolved
Search for dead transitions found 0 dead transitions in 76634ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 775/776 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 774
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 80 transition count 775
Applied a total of 4 rules in 57 ms. Remains 80 /82 variables (removed 2) and now considering 775/775 (removed 0) transitions.
// Phase 1: matrix 775 rows 80 cols
[2024-05-22 04:26:32] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 04:26:32] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-22 04:26:32] [INFO ] Invariant cache hit.
[2024-05-22 04:26:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:26:32] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 80/82 places, 775/776 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78586 ms. Remains : 80/82 places, 775/776 transitions.
RANDOM walk for 40000 steps (225 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 941489 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941489 steps, saw 126377 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
[2024-05-22 04:26:36] [INFO ] Invariant cache hit.
[2024-05-22 04:26:36] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 766/832 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/855 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/855 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:26:36] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2024-05-22 04:26:37] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2024-05-22 04:26:37] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 766/832 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/855 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/855 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/855 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 18 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 775/775 transitions.
Applied a total of 0 rules in 36 ms. Remains 80 /80 variables (removed 0) and now considering 775/775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 80/80 places, 775/775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 775/775 transitions.
Applied a total of 0 rules in 36 ms. Remains 80 /80 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2024-05-22 04:26:38] [INFO ] Invariant cache hit.
[2024-05-22 04:26:38] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-22 04:26:38] [INFO ] Invariant cache hit.
[2024-05-22 04:26:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 04:26:39] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2024-05-22 04:26:39] [INFO ] Redundant transitions in 135 ms returned []
Running 771 sub problems to find dead transitions.
[2024-05-22 04:26:39] [INFO ] Invariant cache hit.
[2024-05-22 04:26:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-22 04:27:01] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 2 ms to minimize.
[2024-05-22 04:27:02] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2024-05-22 04:27:05] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 1 ms to minimize.
[2024-05-22 04:27:05] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 1 ms to minimize.
[2024-05-22 04:27:05] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 2 ms to minimize.
[2024-05-22 04:27:06] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 1 ms to minimize.
[2024-05-22 04:27:06] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2024-05-22 04:27:06] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 1 ms to minimize.
[2024-05-22 04:27:07] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2024-05-22 04:27:07] [INFO ] Deduced a trap composed of 6 places in 440 ms of which 2 ms to minimize.
[2024-05-22 04:27:07] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 1 ms to minimize.
[2024-05-22 04:27:08] [INFO ] Deduced a trap composed of 8 places in 379 ms of which 2 ms to minimize.
[2024-05-22 04:27:08] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2024-05-22 04:27:09] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2024-05-22 04:27:09] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2024-05-22 04:27:09] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 5 (OVERLAPS) 775/855 variables, 80/109 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-22 04:27:24] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
SMT process timed out in 45114ms, After SMT, problems are : Problem set: 0 solved, 771 unsolved
Search for dead transitions found 0 dead transitions in 45125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46179 ms. Remains : 80/80 places, 775/775 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 36 ms. Remains 80 /80 variables (removed 0) and now considering 775/775 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 04:27:24] [INFO ] Invariant cache hit.
[2024-05-22 04:27:24] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 04:27:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-22 04:27:25] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:27:25] [INFO ] Deduced a trap composed of 6 places in 540 ms of which 12 ms to minimize.
[2024-05-22 04:27:26] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 1 ms to minimize.
[2024-05-22 04:27:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1142 ms
TRAPS : Iteration 1
[2024-05-22 04:27:26] [INFO ] Deduced a trap composed of 9 places in 439 ms of which 1 ms to minimize.
[2024-05-22 04:27:27] [INFO ] Deduced a trap composed of 9 places in 454 ms of which 1 ms to minimize.
[2024-05-22 04:27:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 981 ms
TRAPS : Iteration 2
[2024-05-22 04:27:27] [INFO ] After 2942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:27:27] [INFO ] After 3123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:27:27] [INFO ] Flatten gal took : 176 ms
[2024-05-22 04:27:28] [INFO ] Flatten gal took : 138 ms
[2024-05-22 04:27:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11919038821192030751.gal : 30 ms
[2024-05-22 04:27:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8556104883178837186.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/ReachabilityCardinality11919038821192030751.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8556104883178837186.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/ReachabilityCardinality8556104883178837186.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 242
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :242 after 5246
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5246 after 263574
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :263574 after 500642
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :500642 after 2.522e+06
Detected timeout of ITS tools.
[2024-05-22 04:27:43] [INFO ] Flatten gal took : 135 ms
[2024-05-22 04:27:43] [INFO ] Applying decomposition
[2024-05-22 04:27:43] [INFO ] Flatten gal took : 132 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/graph4166468182160244499.txt' '-o' '/tmp/graph4166468182160244499.bin' '-w' '/tmp/graph4166468182160244499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4166468182160244499.bin' '-l' '-1' '-v' '-w' '/tmp/graph4166468182160244499.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:27:44] [INFO ] Decomposing Gal with order
[2024-05-22 04:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:27:44] [INFO ] Removed a total of 5755 redundant transitions.
[2024-05-22 04:27:44] [INFO ] Flatten gal took : 375 ms
[2024-05-22 04:27:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 64 ms.
[2024-05-22 04:27:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10446232454199279691.gal : 5 ms
[2024-05-22 04:27:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality157636365846960613.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/ReachabilityCardinality10446232454199279691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality157636365846960613.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/ReachabilityCardinality157636365846960613.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :54 after 78
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :78 after 8.7065e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8.7065e+06 after 4.4976e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.4976e+07 after 1.53038e+08
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,2.37513e+09,0.504448,18960,717,119,25678,3152,385,80158,110,24464,0
Total reachable state count : 2375131570

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-09b-ReachabilityCardinality-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-09b-ReachabilityCardinality-2024-06,44800,0.52425,18960,62,26,25678,3152,416,80158,119,24464,1627
Over-approximation ignoring read arcs solved 0 properties in 20982 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 04:27:45] [INFO ] Flatten gal took : 111 ms
[2024-05-22 04:27:45] [INFO ] Applying decomposition
[2024-05-22 04:27:45] [INFO ] Flatten gal took : 109 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/graph13032560857032067116.txt' '-o' '/tmp/graph13032560857032067116.bin' '-w' '/tmp/graph13032560857032067116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13032560857032067116.bin' '-l' '-1' '-v' '-w' '/tmp/graph13032560857032067116.weights' '-q' '0' '-e' '0.001'
[2024-05-22 04:27:46] [INFO ] Decomposing Gal with order
[2024-05-22 04:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 04:27:46] [INFO ] Removed a total of 6011 redundant transitions.
[2024-05-22 04:27:46] [INFO ] Flatten gal took : 296 ms
[2024-05-22 04:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 39 ms.
[2024-05-22 04:27:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9592068870904818988.gal : 13 ms
[2024-05-22 04:27:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15036977474709119777.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/ReachabilityCardinality9592068870904818988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15036977474709119777.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15036977474709119777.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 156
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :156 after 1.77466e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.77466e+08 after 1.77466e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.77466e+08 after 1.77466e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.77466e+08 after 1.77466e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.77466e+08 after 1.77515e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.77515e+08 after 1.79878e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.79878e+08 after 2.38645e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.38645e+08 after 5.18193e+08

BK_STOP 1716352164341

--------------------
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="AutonomousCar-PT-09b"
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 AutonomousCar-PT-09b, 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 r026-smll-171620167500358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b 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 ;