fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r070-tall-171620505100087
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CANConstruction-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1509682.00 0.00 0.00 ??FTTFT?T?TFT?FF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505100087.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 CANConstruction-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 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 15M 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 CANConstruction-PT-100-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2023-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716234993183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 19:56:34] [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 19:56:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 19:56:35] [INFO ] Load time of PNML (sax parser for PT used): 754 ms
[2024-05-20 19:56:35] [INFO ] Transformed 21202 places.
[2024-05-20 19:56:35] [INFO ] Transformed 40800 transitions.
[2024-05-20 19:56:35] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 965 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 5471 ms. (7 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 480 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1094 ms. (36 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 19:56:38] [INFO ] Flatten gal took : 1997 ms
[2024-05-20 19:56:39] [INFO ] Computed 201 invariants in 706 ms
[2024-05-20 19:56:39] [INFO ] Flatten gal took : 915 ms
[2024-05-20 19:56:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16631492400252471659.gal : 235 ms
[2024-05-20 19:56:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10631537237642843590.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/ReachabilityCardinality16631492400252471659.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10631537237642843590.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2024-05-20 19:56:39] [INFO ] State equation strengthened by 19900 read => feed constraints.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20911/21084 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21084 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 17/21101 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21101/62002 variables, and 101 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5060 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 0/100 constraints, State Equation: 0/21202 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20911/21084 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality10631537237642843590.prop.
[2024-05-20 19:57:55] [INFO ] Deduced a trap composed of 5 places in 67625 ms of which 754 ms to minimize.
SMT process timed out in 77521ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 173 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 21202 transition count 40173
Reduce places removed 627 places and 0 transitions.
Iterating post reduction 1 with 627 rules applied. Total rules applied 1254 place count 20575 transition count 40173
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 1254 place count 20575 transition count 40148
Deduced a syphon composed of 25 places in 19 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 1304 place count 20550 transition count 40148
Performed 9906 Post agglomeration using F-continuation condition.Transition count delta: 9906
Deduced a syphon composed of 9906 places in 34 ms
Reduce places removed 9906 places and 0 transitions.
Iterating global reduction 2 with 19812 rules applied. Total rules applied 21116 place count 10644 transition count 30242
Free-agglomeration rule (complex) applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 21164 place count 10644 transition count 30194
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 21212 place count 10596 transition count 30194
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 21237 place count 10596 transition count 30194
Applied a total of 21237 rules in 7178 ms. Remains 10596 /21202 variables (removed 10606) and now considering 30194/40800 (removed 10606) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7193 ms. Remains : 10596/21202 places, 30194/40800 transitions.
RANDOM walk for 40000 steps (53 resets) in 2477 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 77832 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :1 out of 6
Probabilistic random walk after 77832 steps, saw 72531 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :1
FORMULA CANConstruction-PT-100-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 30194 rows 10596 cols
[2024-05-20 19:58:07] [INFO ] Computed 201 invariants in 257 ms
[2024-05-20 19:58:08] [INFO ] State equation strengthened by 29831 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10306/10478 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10478 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/10495 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10495 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10595 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10595 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 30194/40789 variables, 10595/10796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40789 variables, 29831/40627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40789 variables, 0/40627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40790 variables, 1/40628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40790 variables, 0/40628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 40790/40790 variables, and 40628 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45041 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10596/10596 constraints, ReadFeed: 29831/29831 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10306/10478 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 19:59:20] [INFO ] Deduced a trap composed of 104 places in 26340 ms of which 71 ms to minimize.
[2024-05-20 19:59:44] [INFO ] Deduced a trap composed of 3 places in 23488 ms of which 67 ms to minimize.
SMT process timed out in 97204ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 172 out of 10596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10596/10596 places, 30194/30194 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10595 transition count 30193
Applied a total of 2 rules in 348 ms. Remains 10595 /10596 variables (removed 1) and now considering 30193/30194 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 10595/10596 places, 30193/30194 transitions.
RANDOM walk for 40000 steps (52 resets) in 2433 ms. (16 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 76267 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 5
Probabilistic random walk after 76267 steps, saw 72221 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 30193 rows 10595 cols
[2024-05-20 19:59:49] [INFO ] Computed 201 invariants in 251 ms
[2024-05-20 19:59:49] [INFO ] State equation strengthened by 29832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10305/10477 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10477 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/10494 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10494 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10594 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10594 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 30193/40787 variables, 10594/10795 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40787 variables, 29832/40627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40787 variables, 0/40627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40788 variables, 1/40628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40788 variables, 0/40628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/40788 variables, 0/40628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40788/40788 variables, and 40628 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49527 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10595/10595 constraints, ReadFeed: 29832/29832 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10305/10477 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 20:01:03] [INFO ] Deduced a trap composed of 2 places in 22564 ms of which 68 ms to minimize.
[2024-05-20 20:01:27] [INFO ] Deduced a trap composed of 2 places in 23948 ms of which 65 ms to minimize.
[2024-05-20 20:01:53] [INFO ] Deduced a trap composed of 2 places in 25782 ms of which 63 ms to minimize.
[2024-05-20 20:02:20] [INFO ] Deduced a trap composed of 2 places in 27178 ms of which 63 ms to minimize.
SMT process timed out in 151694ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 172 out of 10595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10595/10595 places, 30193/30193 transitions.
Applied a total of 0 rules in 202 ms. Remains 10595 /10595 variables (removed 0) and now considering 30193/30193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 10595/10595 places, 30193/30193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10595/10595 places, 30193/30193 transitions.
Applied a total of 0 rules in 190 ms. Remains 10595 /10595 variables (removed 0) and now considering 30193/30193 (removed 0) transitions.
[2024-05-20 20:02:21] [INFO ] Invariant cache hit.
[2024-05-20 20:02:31] [INFO ] Implicit Places using invariants in 10372 ms returned [5, 11, 17, 23, 29, 35, 42, 49, 56, 62, 68, 75, 81, 87, 93, 99, 105, 111, 117, 124, 130, 136, 142, 148, 154, 160, 166, 173, 180, 186, 192, 198, 205, 212, 219, 225, 232, 238, 244, 250, 256, 262, 268, 274, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 348, 354, 360, 366, 372, 378, 385, 391, 397, 403, 410, 416, 423, 430, 437, 444, 450, 456, 462, 468, 474, 481, 488, 494, 501, 508, 515, 521, 527, 533, 539, 545, 551, 557, 563, 570, 576, 582, 588, 594, 600, 606, 612, 618, 624]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 10404 ms to find 100 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10495/10595 places, 30193/30193 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 10470 transition count 30168
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 10470 transition count 30168
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 8 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 0 with 254 rules applied. Total rules applied 304 place count 10343 transition count 30041
Applied a total of 304 rules in 392461 ms. Remains 10343 /10495 variables (removed 152) and now considering 30041/30193 (removed 152) transitions.
// Phase 1: matrix 30041 rows 10343 cols
[2024-05-20 20:09:05] [INFO ] Computed 101 invariants in 1510 ms
[2024-05-20 20:09:15] [INFO ] Implicit Places using invariants in 11343 ms returned []
Implicit Place search using SMT only with invariants took 11345 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 10343/10595 places, 30041/30193 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 414401 ms. Remains : 10343/10595 places, 30041/30193 transitions.
RANDOM walk for 40000 steps (65 resets) in 2219 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 102346 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 5
Probabilistic random walk after 102346 steps, saw 101923 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-20 20:09:19] [INFO ] Invariant cache hit.
[2024-05-20 20:09:20] [INFO ] State equation strengthened by 29732 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10153/10325 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10325 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/10342 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10342 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 30041/40383 variables, 10342/10443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40383 variables, 29732/40175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40383 variables, 0/40175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/40384 variables, 1/40176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40384 variables, 0/40176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/40384 variables, 0/40176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40384/40384 variables, and 40176 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49422 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 10343/10343 constraints, ReadFeed: 29732/29732 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10153/10325 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 20:10:34] [INFO ] Deduced a trap composed of 2 places in 23171 ms of which 57 ms to minimize.
[2024-05-20 20:10:43] [INFO ] Deduced a trap composed of 103 places in 9768 ms of which 43 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 102 places in 9433 ms of which 46 ms to minimize.
[2024-05-20 20:11:03] [INFO ] Deduced a trap composed of 103 places in 9534 ms of which 47 ms to minimize.
[2024-05-20 20:11:12] [INFO ] Deduced a trap composed of 102 places in 9193 ms of which 40 ms to minimize.
[2024-05-20 20:11:21] [INFO ] Deduced a trap composed of 103 places in 8705 ms of which 41 ms to minimize.
[2024-05-20 20:11:30] [INFO ] Deduced a trap composed of 103 places in 8797 ms of which 37 ms to minimize.
[2024-05-20 20:11:39] [INFO ] Deduced a trap composed of 103 places in 8623 ms of which 40 ms to minimize.
[2024-05-20 20:11:47] [INFO ] Deduced a trap composed of 104 places in 8215 ms of which 40 ms to minimize.
SMT process timed out in 148019ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 172 out of 10343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10343/10343 places, 30041/30041 transitions.
Applied a total of 0 rules in 282967 ms. Remains 10343 /10343 variables (removed 0) and now considering 30041/30041 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282968 ms. Remains : 10343/10343 places, 30041/30041 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10343/10343 places, 30041/30041 transitions.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 102
Applied a total of 0 rules in 249979 ms. Remains 10343 /10343 variables (removed 0) and now considering 30041/30041 (removed 0) transitions.
[2024-05-20 20:20:40] [INFO ] Invariant cache hit.
[2024-05-20 20:20:49] [INFO ] Implicit Places using invariants in 9137 ms returned []
Implicit Place search using SMT only with invariants took 9150 ms to find 0 implicit places.
Running 29941 sub problems to find dead transitions.
[2024-05-20 20:20:49] [INFO ] Invariant cache hit.
[2024-05-20 20:20:50] [INFO ] State equation strengthened by 29732 read => feed constraints.

BK_STOP 1716236502865

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="CANConstruction-PT-100"
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 CANConstruction-PT-100, 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-171620505100087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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