Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700559.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANConstruction-PT-090, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 11K Apr 29 12:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 29 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 29 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 29 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 29 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 12M May 10 09:33 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-090-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654202499787

Running Version 202205111006
[2022-06-02 20:41:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:41:41] [INFO ] Load time of PNML (sax parser for PT used): 842 ms
[2022-06-02 20:41:41] [INFO ] Transformed 17282 places.
[2022-06-02 20:41:42] [INFO ] Transformed 33120 transitions.
[2022-06-02 20:41:42] [INFO ] Parsed PT model containing 17282 places and 33120 transitions in 1070 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 870 ms. (steps per millisecond=11 ) properties (out of 16) seen :6
FORMULA CANConstruction-PT-090-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 33120 rows 17282 cols
[2022-06-02 20:41:44] [INFO ] Computed 181 place invariants in 506 ms
[2022-06-02 20:41:49] [INFO ] [Real]Absence check using 91 positive place invariants in 392 ms returned sat
[2022-06-02 20:41:49] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 189 ms returned sat
[2022-06-02 20:41:51] [INFO ] After 7251ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-06-02 20:41:55] [INFO ] [Nat]Absence check using 91 positive place invariants in 334 ms returned sat
[2022-06-02 20:41:55] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 160 ms returned sat
[2022-06-02 20:42:16] [INFO ] After 18672ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2022-06-02 20:42:16] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2022-06-02 20:42:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:42:16] [INFO ] After 25275ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:9
FORMULA CANConstruction-PT-090-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 186 out of 17282 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 17282 transition count 32617
Reduce places removed 503 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 509 rules applied. Total rules applied 1012 place count 16779 transition count 32611
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1018 place count 16773 transition count 32611
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 1018 place count 16773 transition count 32584
Deduced a syphon composed of 27 places in 13 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1072 place count 16746 transition count 32584
Discarding 7834 places :
Symmetric choice reduction at 3 with 7834 rule applications. Total rules 8906 place count 8912 transition count 16916
Iterating global reduction 3 with 7834 rules applied. Total rules applied 16740 place count 8912 transition count 16916
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 8 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 16864 place count 8850 transition count 16854
Free-agglomeration rule applied 72 times.
Iterating global reduction 3 with 72 rules applied. Total rules applied 16936 place count 8850 transition count 16782
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 17008 place count 8778 transition count 16782
Free-agglomeration rule (complex) applied 89 times.
Iterating global reduction 4 with 89 rules applied. Total rules applied 17097 place count 8778 transition count 16693
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 4 with 89 rules applied. Total rules applied 17186 place count 8689 transition count 16693
Partial Free-agglomeration rule applied 133 times.
Drop transitions removed 133 transitions
Iterating global reduction 5 with 133 rules applied. Total rules applied 17319 place count 8689 transition count 16693
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 17337 place count 8689 transition count 16693
Applied a total of 17337 rules in 21152 ms. Remains 8689 /17282 variables (removed 8593) and now considering 16693/33120 (removed 16427) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/17282 places, 16693/33120 transitions.
Interrupted random walk after 649514 steps, including 975 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 5
FORMULA CANConstruction-PT-090-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3094 ms. (steps per millisecond=323 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 2919 ms. (steps per millisecond=342 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2713 ms. (steps per millisecond=368 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2742 ms. (steps per millisecond=364 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16693 rows 8689 cols
[2022-06-02 20:43:19] [INFO ] Computed 181 place invariants in 140 ms
[2022-06-02 20:43:21] [INFO ] [Real]Absence check using 91 positive place invariants in 226 ms returned sat
[2022-06-02 20:43:21] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 130 ms returned sat
[2022-06-02 20:43:21] [INFO ] After 2139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 20:43:23] [INFO ] [Nat]Absence check using 91 positive place invariants in 212 ms returned sat
[2022-06-02 20:43:23] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 128 ms returned sat
[2022-06-02 20:43:38] [INFO ] After 14269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 20:43:38] [INFO ] State equation strengthened by 16246 read => feed constraints.
[2022-06-02 20:43:48] [INFO ] After 10413ms SMT Verify possible using 16246 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 20:43:53] [INFO ] After 15494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3886 ms.
[2022-06-02 20:43:57] [INFO ] After 35712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA CANConstruction-PT-090-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 3299 ms.
Support contains 44 out of 8689 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8689/8689 places, 16693/16693 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8689 transition count 16690
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8686 transition count 16690
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 28 place count 8664 transition count 16646
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 8664 transition count 16646
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 146 place count 8616 transition count 16598
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 182 place count 8598 transition count 16601
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 183 place count 8598 transition count 16600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 184 place count 8597 transition count 16600
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 8596 transition count 16598
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 8596 transition count 16598
Applied a total of 186 rules in 15140 ms. Remains 8596 /8689 variables (removed 93) and now considering 16598/16693 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 8596/8689 places, 16598/16693 transitions.
Interrupted random walk after 886622 steps, including 1390 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2544 ms. (steps per millisecond=393 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2457 ms. (steps per millisecond=407 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1077253 steps, run timeout after 102001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 1077253 steps, saw 544149 distinct states, run finished after 102004 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16598 rows 8596 cols
[2022-06-02 20:46:33] [INFO ] Computed 181 place invariants in 140 ms
[2022-06-02 20:46:34] [INFO ] [Real]Absence check using 91 positive place invariants in 192 ms returned sat
[2022-06-02 20:46:34] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 123 ms returned sat
[2022-06-02 20:46:34] [INFO ] After 1638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:46:36] [INFO ] [Nat]Absence check using 91 positive place invariants in 197 ms returned sat
[2022-06-02 20:46:36] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 127 ms returned sat
[2022-06-02 20:46:47] [INFO ] After 11039ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:46:47] [INFO ] State equation strengthened by 16317 read => feed constraints.
[2022-06-02 20:46:53] [INFO ] After 5852ms SMT Verify possible using 16317 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:46:56] [INFO ] After 8686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1704 ms.
[2022-06-02 20:46:57] [INFO ] After 23031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 741 ms.
Support contains 44 out of 8596 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8596/8596 places, 16598/16598 transitions.
Applied a total of 0 rules in 2561 ms. Remains 8596 /8596 variables (removed 0) and now considering 16598/16598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8596/8596 places, 16598/16598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8596/8596 places, 16598/16598 transitions.
Applied a total of 0 rules in 2585 ms. Remains 8596 /8596 variables (removed 0) and now considering 16598/16598 (removed 0) transitions.
// Phase 1: matrix 16598 rows 8596 cols
[2022-06-02 20:47:03] [INFO ] Computed 181 place invariants in 112 ms
[2022-06-02 20:47:04] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 892 ms to find 0 implicit places.
// Phase 1: matrix 16598 rows 8596 cols
[2022-06-02 20:47:04] [INFO ] Computed 181 place invariants in 118 ms
[2022-06-02 20:47:05] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8596/8596 places, 16598/16598 transitions.
Interrupted random walk after 902419 steps, including 1415 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2442 ms. (steps per millisecond=409 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2419 ms. (steps per millisecond=413 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1065772 steps, run timeout after 102001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 1065772 steps, saw 541881 distinct states, run finished after 102001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16598 rows 8596 cols
[2022-06-02 20:49:22] [INFO ] Computed 181 place invariants in 118 ms
[2022-06-02 20:49:23] [INFO ] [Real]Absence check using 91 positive place invariants in 205 ms returned sat
[2022-06-02 20:49:24] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 130 ms returned sat
[2022-06-02 20:49:24] [INFO ] After 1607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:49:25] [INFO ] [Nat]Absence check using 91 positive place invariants in 204 ms returned sat
[2022-06-02 20:49:25] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 117 ms returned sat
[2022-06-02 20:49:40] [INFO ] After 14674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:49:40] [INFO ] State equation strengthened by 16317 read => feed constraints.
[2022-06-02 20:49:46] [INFO ] After 6249ms SMT Verify possible using 16317 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:49:50] [INFO ] After 9557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1823 ms.
[2022-06-02 20:49:52] [INFO ] After 27756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 938 ms.
Support contains 44 out of 8596 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8596/8596 places, 16598/16598 transitions.
Applied a total of 0 rules in 2782 ms. Remains 8596 /8596 variables (removed 0) and now considering 16598/16598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8596/8596 places, 16598/16598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8596/8596 places, 16598/16598 transitions.
Applied a total of 0 rules in 2738 ms. Remains 8596 /8596 variables (removed 0) and now considering 16598/16598 (removed 0) transitions.
// Phase 1: matrix 16598 rows 8596 cols
[2022-06-02 20:49:58] [INFO ] Computed 181 place invariants in 116 ms
[2022-06-02 20:49:59] [INFO ] Implicit Places using invariants in 994 ms returned []
Implicit Place search using SMT only with invariants took 999 ms to find 0 implicit places.
// Phase 1: matrix 16598 rows 8596 cols
[2022-06-02 20:49:59] [INFO ] Computed 181 place invariants in 110 ms
[2022-06-02 20:50:00] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8596/8596 places, 16598/16598 transitions.
Graph (trivial) has 15576 edges and 8596 vertex of which 7396 / 8596 are part of one of the 81 SCC in 9 ms
Free SCC test removed 7315 places
Drop transitions removed 14506 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 14524 transitions.
Graph (complete) has 2670 edges and 1281 vertex of which 977 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.9 ms
Discarding 304 places :
Also discarding 174 output transitions
Drop transitions removed 174 transitions
Ensure Unique test removed 4 places
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 973 transition count 1604
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 174 transitions
Reduce isomorphic transitions removed 174 transitions.
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 625
Iterating post reduction 1 with 976 rules applied. Total rules applied 1278 place count 796 transition count 805
Reduce places removed 625 places and 0 transitions.
Ensure Unique test removed 611 transitions
Reduce isomorphic transitions removed 611 transitions.
Iterating post reduction 2 with 1236 rules applied. Total rules applied 2514 place count 171 transition count 194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2514 place count 171 transition count 172
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2558 place count 149 transition count 172
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2570 place count 137 transition count 160
Iterating global reduction 3 with 12 rules applied. Total rules applied 2582 place count 137 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2585 place count 137 transition count 157
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 4 with 2 rules applied. Total rules applied 2587 place count 136 transition count 156
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2589 place count 136 transition count 154
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 2602 place count 136 transition count 141
Ensure Unique test removed 7 places
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 2630 place count 116 transition count 133
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 2637 place count 116 transition count 126
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2644 place count 109 transition count 126
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 2662 place count 109 transition count 126
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2680 place count 91 transition count 108
Iterating global reduction 6 with 18 rules applied. Total rules applied 2698 place count 91 transition count 108
Applied a total of 2698 rules in 152 ms. Remains 91 /8596 variables (removed 8505) and now considering 108/16598 (removed 16490) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 108 rows 91 cols
[2022-06-02 20:50:00] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-02 20:50:00] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-06-02 20:50:00] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-02 20:50:00] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:50:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-06-02 20:50:00] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-02 20:50:00] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:50:00] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-02 20:50:00] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:50:01] [INFO ] Flatten gal took : 30 ms
[2022-06-02 20:50:01] [INFO ] Flatten gal took : 10 ms
[2022-06-02 20:50:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15760950146030218287.gal : 8 ms
[2022-06-02 20:50:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16186855544827680574.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15760950146030218287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16186855544827680574.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16186855544827680574.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 108
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :108 after 2916
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2916 after 524880
Detected timeout of ITS tools.
[2022-06-02 20:50:16] [INFO ] Flatten gal took : 9 ms
[2022-06-02 20:50:16] [INFO ] Applying decomposition
[2022-06-02 20:50:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13283723550952760303.txt' '-o' '/tmp/graph13283723550952760303.bin' '-w' '/tmp/graph13283723550952760303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13283723550952760303.bin' '-l' '-1' '-v' '-w' '/tmp/graph13283723550952760303.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:50:16] [INFO ] Decomposing Gal with order
[2022-06-02 20:50:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:50:16] [INFO ] Removed a total of 11 redundant transitions.
[2022-06-02 20:50:16] [INFO ] Flatten gal took : 36 ms
[2022-06-02 20:50:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2022-06-02 20:50:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2355517090722975098.gal : 3 ms
[2022-06-02 20:50:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14703232382841843039.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2355517090722975098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14703232382841843039.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality14703232382841843039.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 48
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :48 after 27648
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :27648 after 4.24596e+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,1.20345e+16,0.021767,4740,86,18,967,84,244,827,40,168,0
Total reachable state count : 12034531613030400

Verifying 2 reachability properties.
Reachability property CANConstruction-PT-090-ReachabilityFireability-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-090-ReachabilityFireability-08,3.48285e+11,0.038112,4740,62,15,967,84,286,827,45,168,155
Invariant property CANConstruction-PT-090-ReachabilityFireability-10 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
CANConstruction-PT-090-ReachabilityFireability-10,3.22164e+13,0.04156,4740,122,17,981,84,314,1186,46,168,569
[2022-06-02 20:50:17] [INFO ] Flatten gal took : 663 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14563804670947727833
[2022-06-02 20:50:17] [INFO ] Too many transitions (16598) to apply POR reductions. Disabling POR matrices.
[2022-06-02 20:50:17] [INFO ] Applying decomposition
[2022-06-02 20:50:17] [INFO ] Built C files in 278ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14563804670947727833
Running compilation step : cd /tmp/ltsmin14563804670947727833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 20:50:18] [INFO ] Flatten gal took : 794 ms
[2022-06-02 20:50:18] [INFO ] Flatten gal took : 633 ms
Compilation finished in 163022 ms.
Running link step : cd /tmp/ltsmin14563804670947727833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 205 ms.
Running LTSmin : cd /tmp/ltsmin14563804670947727833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT090ReachabilityFireability08==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14563804670947727833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT090ReachabilityFireability08==true'
Running LTSmin : cd /tmp/ltsmin14563804670947727833;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT090ReachabilityFireability10==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-090"
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-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-090, 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 r024-tall-165251918700559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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