Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 07:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 07:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716564103175

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 15:21:44] [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-24 15:21:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:21:44] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2024-05-24 15:21:44] [INFO ] Transformed 2952 places.
[2024-05-24 15:21:44] [INFO ] Transformed 4255 transitions.
[2024-05-24 15:21:44] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1871 resets) in 2918 ms. (13 steps per ms) remains 12/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (468 resets) in 578 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (468 resets) in 495 ms. (80 steps per ms) remains 12/12 properties
[2024-05-24 15:21:46] [INFO ] Flatten gal took : 732 ms
BEST_FIRST walk for 40003 steps (467 resets) in 805 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (468 resets) in 648 ms. (61 steps per ms) remains 12/12 properties
[2024-05-24 15:21:46] [INFO ] Flatten gal took : 392 ms
BEST_FIRST walk for 40003 steps (468 resets) in 311 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (468 resets) in 355 ms. (112 steps per ms) remains 12/12 properties
[2024-05-24 15:21:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9501126831494772251.gal : 153 ms
[2024-05-24 15:21:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16321231813496040848.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/ReachabilityCardinality9501126831494772251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16321231813496040848.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (468 resets) in 245 ms. (162 steps per ms) remains 12/12 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (468 resets) in 379 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (468 resets) in 385 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (468 resets) in 453 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (468 resets) in 365 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (468 resets) in 295 ms. (135 steps per ms) remains 12/12 properties
[2024-05-24 15:21:47] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
Loading property file /tmp/ReachabilityCardinality16321231813496040848.prop.
[2024-05-24 15:21:47] [INFO ] Computed 421 invariants in 217 ms
[2024-05-24 15:21:47] [INFO ] State equation strengthened by 1090 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 630/933 variables, 17/42 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 7/49 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/933 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 4/937 variables, 4/53 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1560/2497 variables, 193/246 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2497 variables, 0/246 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 455/2952 variables, 175/421 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2952 variables, 0/421 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3983/6935 variables, 2952/3373 constraints. Problems are: Problem set: 6 solved, 6 unsolved
SMT process timed out in 6036ms, After SMT, problems are : Problem set: 6 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.16 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 505 rules applied. Total rules applied 506 place count 2928 transition count 3750
Reduce places removed 505 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 537 rules applied. Total rules applied 1043 place count 2423 transition count 3718
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1075 place count 2391 transition count 3718
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 1075 place count 2391 transition count 3654
Deduced a syphon composed of 64 places in 6 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 1203 place count 2327 transition count 3654
Discarding 465 places :
Symmetric choice reduction at 3 with 465 rule applications. Total rules 1668 place count 1862 transition count 3189
Iterating global reduction 3 with 465 rules applied. Total rules applied 2133 place count 1862 transition count 3189
Discarding 221 places :
Symmetric choice reduction at 3 with 221 rule applications. Total rules 2354 place count 1641 transition count 2747
Iterating global reduction 3 with 221 rules applied. Total rules applied 2575 place count 1641 transition count 2747
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 2597 place count 1630 transition count 2736
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 2674 place count 1630 transition count 2659
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 2751 place count 1553 transition count 2659
Partial Free-agglomeration rule applied 64 times.
Drop transitions (Partial Free agglomeration) removed 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 2815 place count 1553 transition count 2659
Applied a total of 2815 rules in 2688 ms. Remains 1553 /2952 variables (removed 1399) and now considering 2659/4255 (removed 1596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2713 ms. Remains : 1553/2952 places, 2659/4255 transitions.
RANDOM walk for 40000 steps (2589 resets) in 860 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (502 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40004 steps (504 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 7
BEST_FIRST walk for 40003 steps (503 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (504 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (502 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (503 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 16
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :16 after 26
Interrupted probabilistic random walk after 37412 steps, run timeout after 3009 ms. (steps per millisecond=12 ) properties seen :0 out of 6
Probabilistic random walk after 37412 steps, saw 17032 distinct states, run finished after 3034 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-24 15:22:00] [INFO ] Flow matrix only has 2310 transitions (discarded 349 similar events)
// Phase 1: matrix 2310 rows 1553 cols
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :26 after 40
[2024-05-24 15:22:00] [INFO ] Computed 397 invariants in 88 ms
[2024-05-24 15:22:00] [INFO ] State equation strengthened by 869 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 924/1013 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 443/1456 variables, 273/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1456 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 10/1466 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1466 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 87/1553 variables, 87/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1553 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2310/3863 variables, 1553/1950 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/3863 variables, 869/2819 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3863 variables, 0/2819 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3863 variables, 0/2819 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3863/3863 variables, and 2819 constraints, problems are : Problem set: 3 solved, 3 unsolved in 4036 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 364/364 constraints, State Equation: 1553/1553 constraints, ReadFeed: 869/869 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 939/1001 variables, 15/21 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :40 after 101
[2024-05-24 15:22:05] [INFO ] Deduced a trap composed of 202 places in 578 ms of which 32 ms to minimize.
[2024-05-24 15:22:06] [INFO ] Deduced a trap composed of 202 places in 1286 ms of which 8 ms to minimize.
[2024-05-24 15:22:07] [INFO ] Deduced a trap composed of 166 places in 459 ms of which 5 ms to minimize.
[2024-05-24 15:22:07] [INFO ] Deduced a trap composed of 202 places in 386 ms of which 6 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :101 after 170
[2024-05-24 15:22:08] [INFO ] Deduced a trap composed of 202 places in 418 ms of which 5 ms to minimize.
[2024-05-24 15:22:08] [INFO ] Deduced a trap composed of 384 places in 663 ms of which 5 ms to minimize.
[2024-05-24 15:22:09] [INFO ] Deduced a trap composed of 238 places in 532 ms of which 5 ms to minimize.
[2024-05-24 15:22:09] [INFO ] Deduced a trap composed of 256 places in 369 ms of which 6 ms to minimize.
[2024-05-24 15:22:10] [INFO ] Deduced a trap composed of 238 places in 391 ms of which 5 ms to minimize.
[2024-05-24 15:22:10] [INFO ] Deduced a trap composed of 238 places in 378 ms of which 5 ms to minimize.
[2024-05-24 15:22:11] [INFO ] Deduced a trap composed of 238 places in 390 ms of which 6 ms to minimize.
[2024-05-24 15:22:11] [INFO ] Deduced a trap composed of 238 places in 394 ms of which 6 ms to minimize.
[2024-05-24 15:22:11] [INFO ] Deduced a trap composed of 238 places in 384 ms of which 5 ms to minimize.
[2024-05-24 15:22:12] [INFO ] Deduced a trap composed of 233 places in 411 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 14/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/1004 variables, 3/38 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1004 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 449/1453 variables, 273/311 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :170 after 420
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :420 after 431
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :431 after 447
[2024-05-24 15:22:13] [INFO ] Deduced a trap composed of 146 places in 771 ms of which 9 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :447 after 476
[2024-05-24 15:22:14] [INFO ] Deduced a trap composed of 202 places in 786 ms of which 9 ms to minimize.
[2024-05-24 15:22:15] [INFO ] Deduced a trap composed of 269 places in 769 ms of which 9 ms to minimize.
[2024-05-24 15:22:15] [INFO ] Deduced a trap composed of 157 places in 813 ms of which 11 ms to minimize.
[2024-05-24 15:22:16] [INFO ] Deduced a trap composed of 156 places in 764 ms of which 9 ms to minimize.
[2024-05-24 15:22:17] [INFO ] Deduced a trap composed of 159 places in 801 ms of which 10 ms to minimize.
[2024-05-24 15:22:18] [INFO ] Deduced a trap composed of 157 places in 779 ms of which 10 ms to minimize.
[2024-05-24 15:22:19] [INFO ] Deduced a trap composed of 165 places in 776 ms of which 9 ms to minimize.
[2024-05-24 15:22:20] [INFO ] Deduced a trap composed of 7 places in 807 ms of which 9 ms to minimize.
[2024-05-24 15:22:20] [INFO ] Deduced a trap composed of 220 places in 775 ms of which 9 ms to minimize.
[2024-05-24 15:22:21] [INFO ] Deduced a trap composed of 276 places in 823 ms of which 9 ms to minimize.
[2024-05-24 15:22:22] [INFO ] Deduced a trap composed of 167 places in 1082 ms of which 20 ms to minimize.
[2024-05-24 15:22:24] [INFO ] Deduced a trap composed of 115 places in 1432 ms of which 17 ms to minimize.
[2024-05-24 15:22:25] [INFO ] Deduced a trap composed of 239 places in 1433 ms of which 18 ms to minimize.
[2024-05-24 15:22:27] [INFO ] Deduced a trap composed of 121 places in 1503 ms of which 15 ms to minimize.
[2024-05-24 15:22:28] [INFO ] Deduced a trap composed of 165 places in 1228 ms of which 16 ms to minimize.
[2024-05-24 15:22:29] [INFO ] Deduced a trap composed of 207 places in 1402 ms of which 22 ms to minimize.
[2024-05-24 15:22:30] [INFO ] Deduced a trap composed of 161 places in 364 ms of which 9 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :476 after 713
[2024-05-24 15:22:31] [INFO ] Deduced a trap composed of 185 places in 1395 ms of which 20 ms to minimize.
[2024-05-24 15:22:32] [INFO ] Deduced a trap composed of 278 places in 281 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1453 variables, 20/331 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 15:22:33] [INFO ] Deduced a trap composed of 165 places in 808 ms of which 15 ms to minimize.
[2024-05-24 15:22:33] [INFO ] Deduced a trap composed of 193 places in 815 ms of which 10 ms to minimize.
[2024-05-24 15:22:34] [INFO ] Deduced a trap composed of 175 places in 800 ms of which 9 ms to minimize.
[2024-05-24 15:22:36] [INFO ] Deduced a trap composed of 176 places in 1417 ms of which 17 ms to minimize.
[2024-05-24 15:22:37] [INFO ] Deduced a trap composed of 186 places in 1390 ms of which 22 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :713 after 913
[2024-05-24 15:22:38] [INFO ] Deduced a trap composed of 167 places in 1382 ms of which 17 ms to minimize.
[2024-05-24 15:22:39] [INFO ] Deduced a trap composed of 169 places in 787 ms of which 11 ms to minimize.
[2024-05-24 15:22:40] [INFO ] Deduced a trap composed of 164 places in 809 ms of which 9 ms to minimize.
[2024-05-24 15:22:41] [INFO ] Deduced a trap composed of 170 places in 808 ms of which 9 ms to minimize.
[2024-05-24 15:22:42] [INFO ] Deduced a trap composed of 156 places in 818 ms of which 9 ms to minimize.
[2024-05-24 15:22:43] [INFO ] Deduced a trap composed of 163 places in 1366 ms of which 24 ms to minimize.
[2024-05-24 15:22:44] [INFO ] Deduced a trap composed of 161 places in 801 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1453 variables, 12/343 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 15:22:46] [INFO ] Deduced a trap composed of 146 places in 1372 ms of which 19 ms to minimize.
[2024-05-24 15:22:46] [INFO ] Deduced a trap composed of 163 places in 826 ms of which 9 ms to minimize.
[2024-05-24 15:22:47] [INFO ] Deduced a trap composed of 178 places in 855 ms of which 9 ms to minimize.
[2024-05-24 15:22:49] [INFO ] Deduced a trap composed of 175 places in 1386 ms of which 24 ms to minimize.
[2024-05-24 15:22:50] [INFO ] Deduced a trap composed of 195 places in 846 ms of which 10 ms to minimize.
SMT process timed out in 49912ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 2659/2659 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1553 transition count 2655
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1549 transition count 2655
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 1549 transition count 2653
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1547 transition count 2653
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 1543 transition count 2647
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 1543 transition count 2647
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 1541 transition count 2643
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 1541 transition count 2643
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 2 with 2 rules applied. Total rules applied 26 place count 1540 transition count 2642
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 37 place count 1540 transition count 2631
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 48 place count 1529 transition count 2631
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 1527 transition count 2629
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 1527 transition count 2629
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 1525 transition count 2625
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 1525 transition count 2625
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 1525 transition count 2625
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1523 transition count 2623
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1523 transition count 2623
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1521 transition count 2619
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1521 transition count 2619
Applied a total of 68 rules in 548 ms. Remains 1521 /1553 variables (removed 32) and now considering 2619/2659 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 1521/1553 places, 2619/2659 transitions.
RANDOM walk for 40000 steps (2625 resets) in 662 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (504 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (504 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (504 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
Probably explored full state space saw : 21251 states, properties seen :0
Probabilistic random walk after 46923 steps, saw 21251 distinct states, run finished after 2328 ms. (steps per millisecond=20 ) properties seen :0
Explored full state space saw : 21251 states, properties seen :0
Exhaustive walk after 46923 steps, saw 21251 distinct states, run finished after 2304 ms. (steps per millisecond=20 ) properties seen :0
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 71436 ms.

BK_STOP 1716564175846

--------------------
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//
++ 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 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="MultiCrashLeafsetExtension-PT-S16C02"
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 MultiCrashLeafsetExtension-PT-S16C02, 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 r246-tall-171654350700007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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