fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282500599
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Medical-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5835.991 3600000.00 13957522.00 613.50 TTFTFTT?FFFFTFFF normal

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.r312-tall-165472282500599.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 Medical-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282500599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.5K Jun 7 17:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 7 17:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 7 17:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.1M Jun 6 12:11 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 Medical-PT-18-ReachabilityFireability-00
FORMULA_NAME Medical-PT-18-ReachabilityFireability-01
FORMULA_NAME Medical-PT-18-ReachabilityFireability-02
FORMULA_NAME Medical-PT-18-ReachabilityFireability-03
FORMULA_NAME Medical-PT-18-ReachabilityFireability-04
FORMULA_NAME Medical-PT-18-ReachabilityFireability-05
FORMULA_NAME Medical-PT-18-ReachabilityFireability-06
FORMULA_NAME Medical-PT-18-ReachabilityFireability-07
FORMULA_NAME Medical-PT-18-ReachabilityFireability-08
FORMULA_NAME Medical-PT-18-ReachabilityFireability-09
FORMULA_NAME Medical-PT-18-ReachabilityFireability-10
FORMULA_NAME Medical-PT-18-ReachabilityFireability-11
FORMULA_NAME Medical-PT-18-ReachabilityFireability-12
FORMULA_NAME Medical-PT-18-ReachabilityFireability-13
FORMULA_NAME Medical-PT-18-ReachabilityFireability-14
FORMULA_NAME Medical-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654896384770

Running Version 202205111006
[2022-06-10 21:26:25] [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-10 21:26:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:26:26] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2022-06-10 21:26:26] [INFO ] Transformed 312 places.
[2022-06-10 21:26:26] [INFO ] Transformed 5431 transitions.
[2022-06-10 21:26:26] [INFO ] Parsed PT model containing 312 places and 5431 transitions in 481 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-18-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 38 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1107772 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{}
Probabilistic random walk after 1107772 steps, saw 707606 distinct states, run finished after 3003 ms. (steps per millisecond=368 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 21:26:29] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2022-06-10 21:26:29] [INFO ] Computed 10 place invariants in 15 ms
[2022-06-10 21:26:29] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-10 21:26:29] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:26:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-10 21:26:29] [INFO ] After 20ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:29] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-10 21:26:30] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:30] [INFO ] After 16ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 3 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2022-06-10 21:26:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 418 ms
[2022-06-10 21:26:30] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 21:26:30] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 67 transition count 225
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 65 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 64 transition count 225
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 62 transition count 223
Applied a total of 11 rules in 37 ms. Remains 62 /69 variables (removed 7) and now considering 223/227 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/69 places, 223/227 transitions.
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1321860 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :{}
Probabilistic random walk after 1321860 steps, saw 792862 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 21:26:34] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:34] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-10 21:26:34] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:34] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:34] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:34] [INFO ] After 13ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:34] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2022-06-10 21:26:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2022-06-10 21:26:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2022-06-10 21:26:34] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-10 21:26:34] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2022-06-10 21:26:34] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:34] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:26:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-10 21:26:34] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:34] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 21:26:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:35] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-06-10 21:26:35] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-10 21:26:35] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:35] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-10 21:26:35] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 223/223 transitions.
Incomplete random walk after 100004 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=684 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-10 21:26:35] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:26:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:35] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:26:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:35] [INFO ] After 12ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:35] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:35] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:35] [INFO ] After 10ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:35] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-06-10 21:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-10 21:26:35] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-10 21:26:35] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1349962 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{}
Probabilistic random walk after 1349962 steps, saw 809723 distinct states, run finished after 3001 ms. (steps per millisecond=449 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 21:26:39] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:39] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:26:39] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:39] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:39] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:39] [INFO ] After 12ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:39] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2022-06-10 21:26:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-06-10 21:26:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2022-06-10 21:26:39] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-10 21:26:39] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 14 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2022-06-10 21:26:39] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:39] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:26:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-06-10 21:26:39] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:39] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:26:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-06-10 21:26:40] [INFO ] Redundant transitions in 11 ms returned []
[2022-06-10 21:26:40] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:40] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:26:40] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 223/223 transitions.
Incomplete random walk after 100007 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=2040 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-10 21:26:40] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:40] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-10 21:26:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:40] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:26:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:40] [INFO ] After 13ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:40] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:40] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:40] [INFO ] After 11ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:40] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-06-10 21:26:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-10 21:26:40] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-10 21:26:40] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1346997 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1346997 steps, saw 807944 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 21:26:43] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:26:43] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-10 21:26:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:43] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:26:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:43] [INFO ] After 13ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:43] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:43] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:43] [INFO ] After 11ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-06-10 21:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-10 21:26:43] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-10 21:26:43] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 223/223 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 62 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 222
Applied a total of 2 rules in 45 ms. Remains 61 /62 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 222/223 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1459220 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :{}
Probabilistic random walk after 1459220 steps, saw 836862 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 21:26:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:26:46] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:26:46] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:46] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:26:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:46] [INFO ] After 20ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:46] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-10 21:26:46] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:46] [INFO ] After 11ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:46] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-06-10 21:26:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-10 21:26:46] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-10 21:26:46] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2022-06-10 21:26:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:26:47] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:26:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-06-10 21:26:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:26:47] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:26:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-10 21:26:47] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2022-06-10 21:26:47] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 21:26:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2022-06-10 21:26:47] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 21:26:47] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 55 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 54 transition count 221
Applied a total of 65 rules in 18 ms. Remains 54 /61 variables (removed 7) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 54 cols
[2022-06-10 21:26:47] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 21:26:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:47] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:26:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 21:26:47] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:47] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:26:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-10 21:26:47] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:47] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:47] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-10 21:26:47] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:26:47] [INFO ] Flatten gal took : 55 ms
[2022-06-10 21:26:47] [INFO ] Flatten gal took : 20 ms
[2022-06-10 21:26:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3982115643799369501.gal : 12 ms
[2022-06-10 21:26:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2190896771704388690.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1104676969689917818;'/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/ReachabilityCardinality3982115643799369501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2190896771704388690.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...319
Loading property file /tmp/ReachabilityCardinality2190896771704388690.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 267
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :267 after 525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :525 after 1039
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1039 after 2065
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2065 after 4115
Detected timeout of ITS tools.
[2022-06-10 21:27:02] [INFO ] Flatten gal took : 19 ms
[2022-06-10 21:27:02] [INFO ] Applying decomposition
[2022-06-10 21:27:02] [INFO ] Flatten gal took : 15 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/graph127708825882141000.txt' '-o' '/tmp/graph127708825882141000.bin' '-w' '/tmp/graph127708825882141000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph127708825882141000.bin' '-l' '-1' '-v' '-w' '/tmp/graph127708825882141000.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:27:02] [INFO ] Decomposing Gal with order
[2022-06-10 21:27:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:27:03] [INFO ] Removed a total of 102 redundant transitions.
[2022-06-10 21:27:03] [INFO ] Flatten gal took : 59 ms
[2022-06-10 21:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 5 ms.
[2022-06-10 21:27:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9686574654313156564.gal : 4 ms
[2022-06-10 21:27:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3025902698558500650.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1104676969689917818;'/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/ReachabilityCardinality9686574654313156564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3025902698558500650.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...298
Loading property file /tmp/ReachabilityCardinality3025902698558500650.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :43 after 108
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :108 after 237
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :237 after 494
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :494 after 1007
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1007 after 2032
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2032 after 4081
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7456239703600029562
[2022-06-10 21:27:18] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7456239703600029562
Running compilation step : cd /tmp/ltsmin7456239703600029562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 451 ms.
Running link step : cd /tmp/ltsmin7456239703600029562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7456239703600029562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
LTSmin run took 2025 ms.
Found Violation
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 62 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 62 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 61 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 60 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 57 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 57 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 56 transition count 199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 56 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 55 transition count 222
Applied a total of 65 rules in 18 ms. Remains 55 /62 variables (removed 7) and now considering 222/223 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 55 cols
[2022-06-10 21:27:20] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 21:27:20] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-10 21:27:20] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 21:27:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-10 21:27:20] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:27:20] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 21:27:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-10 21:27:20] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 21:27:20] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:27:20] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-10 21:27:20] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 21:27:20] [INFO ] Flatten gal took : 21 ms
[2022-06-10 21:27:20] [INFO ] Flatten gal took : 17 ms
[2022-06-10 21:27:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6853250932302006650.gal : 3 ms
[2022-06-10 21:27:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17228559406403435837.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/ReachabilityCardinality6853250932302006650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17228559406403435837.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...320
Loading property file /tmp/ReachabilityCardinality17228559406403435837.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 267
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :267 after 525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :525 after 1039
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1039 after 2065
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2065 after 4115
Detected timeout of ITS tools.
[2022-06-10 21:27:35] [INFO ] Flatten gal took : 14 ms
[2022-06-10 21:27:35] [INFO ] Applying decomposition
[2022-06-10 21:27:36] [INFO ] Flatten gal took : 18 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/graph13985945104523644567.txt' '-o' '/tmp/graph13985945104523644567.bin' '-w' '/tmp/graph13985945104523644567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13985945104523644567.bin' '-l' '-1' '-v' '-w' '/tmp/graph13985945104523644567.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:27:36] [INFO ] Decomposing Gal with order
[2022-06-10 21:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:27:36] [INFO ] Removed a total of 102 redundant transitions.
[2022-06-10 21:27:36] [INFO ] Flatten gal took : 36 ms
[2022-06-10 21:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 3 ms.
[2022-06-10 21:27:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13112607778311033830.gal : 11 ms
[2022-06-10 21:27:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7416134091173210787.prop : 2 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/ReachabilityCardinality13112607778311033830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7416134091173210787.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/ReachabilityCardinality7416134091173210787.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 80
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :80 after 210
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :210 after 468
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :468 after 982
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :982 after 2008
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2008 after 4058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4058 after 8156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3568695772384084071
[2022-06-10 21:27:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3568695772384084071
Running compilation step : cd /tmp/ltsmin3568695772384084071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin3568695772384084071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin3568695772384084071;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'MedicalPT18ReachabilityFireability07==true'
LTSmin run took 413 ms.
Found Violation
[2022-06-10 21:27:51] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
[2022-06-10 21:27:51] [INFO ] Flatten gal took : 14 ms
[2022-06-10 21:27:51] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin1230270654887295772
[2022-06-10 21:27:52] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2022-06-10 21:27:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:27:52] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2022-06-10 21:27:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:27:52] [INFO ] Flatten gal took : 96 ms
[2022-06-10 21:27:52] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2022-06-10 21:27:52] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 21:27:52] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1230270654887295772
Running compilation step : cd /tmp/ltsmin1230270654887295772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph9234900891927630561.txt' '-o' '/tmp/graph9234900891927630561.bin' '-w' '/tmp/graph9234900891927630561.weights'
[2022-06-10 21:27:52] [INFO ] Input system was already deterministic with 223 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9234900891927630561.bin' '-l' '-1' '-v' '-w' '/tmp/graph9234900891927630561.weights' '-q' '0' '-e' '0.001'
[2022-06-10 21:27:52] [INFO ] Decomposing Gal with order
[2022-06-10 21:27:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:27:52] [INFO ] Removed a total of 99 redundant transitions.
[2022-06-10 21:27:52] [INFO ] Flatten gal took : 44 ms
[2022-06-10 21:27:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 2 ms.
[2022-06-10 21:27:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10274573277394916229.gal : 8 ms
[2022-06-10 21:27:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12123577958471017397.prop : 0 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/ReachabilityFireability10274573277394916229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12123577958471017397.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...300
Loading property file /tmp/ReachabilityFireability12123577958471017397.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 130
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :130 after 301
[2022-06-10 21:27:52] [INFO ] Ran tautology test, simplified 0 / 1 in 338 ms.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :301 after 586
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :586 after 1099
[2022-06-10 21:27:52] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=0 took 27 ms
[2022-06-10 21:27:52] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=1 took 4 ms
[2022-06-10 21:27:52] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=2 took 31 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1099 after 2125
[2022-06-10 21:27:52] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=3 took 64 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2125 after 4120
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 177 out of 223 initially.
// Phase 1: matrix 177 rows 62 cols
[2022-06-10 21:27:52] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:27:52] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 21:27:52] [INFO ] Proved 62 variables to be positive in 167 ms
[2022-06-10 21:27:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:27:52] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=0 took 4 ms
[2022-06-10 21:27:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:27:52] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=1 took 28 ms
[2022-06-10 21:27:52] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=4 took 335 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4120 after 8053
Compilation finished in 810 ms.
Running link step : cd /tmp/ltsmin1230270654887295772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1230270654887295772;'/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' 'MedicalPT18ReachabilityFireability07==true'
[2022-06-10 21:27:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:27:53] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=2 took 313 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8053 after 15862
[2022-06-10 21:27:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:27:54] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=3 took 1749 ms
[2022-06-10 21:27:58] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=5 took 5876 ms
[2022-06-10 21:27:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:27:59] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=4 took 4567 ms
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :15862 after 31480
[2022-06-10 21:28:09] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=6 took 11088 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31480 after 62659
[2022-06-10 21:28:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:28:23] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=5 took 23956 ms
[2022-06-10 21:28:27] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=7 took 18188 ms
[2022-06-10 21:29:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:29:08] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=6 took 45298 ms
[2022-06-10 21:29:29] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=8 took 61733 ms
[2022-06-10 21:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:30:06] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=7 took 57603 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :62659 after 124960
[2022-06-10 21:30:37] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=9 took 67750 ms
[2022-06-10 21:32:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:32:32] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=8 took 146408 ms
[2022-06-10 21:32:49] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=10 took 131885 ms
[2022-06-10 21:34:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:34:15] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=9 took 102691 ms
[2022-06-10 21:37:25] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=11 took 276452 ms
[2022-06-10 21:37:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:37:35] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=10 took 199902 ms
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :124960 after 249505
[2022-06-10 21:42:23] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=12 took 297821 ms
[2022-06-10 21:42:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:42:52] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=11 took 316745 ms
Detected timeout of ITS tools.
[2022-06-10 21:48:20] [INFO ] Applying decomposition
[2022-06-10 21:48:20] [INFO ] Flatten gal took : 78 ms
[2022-06-10 21:48:20] [INFO ] Decomposing Gal with order
[2022-06-10 21:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to l0 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to l3 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to l7 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to p16 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to p17 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to p23 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [INFO ] Could not find partition element corresponding to x0_AA_q5 in partition [l4, l6, x1_AA_q0, x1_AA_q1, x1_AA_q5, x1_HA_q5, x1_HQ_q1],[p11, p12, p13, x3_AA_q0, x3_AA_q1, x3_AA_q2, x3_AA_q5, x3_HA_q5, x3_HQ_q1, x3_HQ_q2, ch2_AA_q2, ch2_AA_q5, ch2_HA_q5, ch2_HQ_q2],[p18, x4_AA_q0, x4_HA_q0, x4_HA_q1, x4_HA_q2, x4_HA_q5],[p20, p22, x5_AA_q0, x5_AA_q3, x5_AA_q5, x5_HA_q5, x5_HQ_q3, x6_AA_q0, x6_HA_q0, x6_HA_q3, x6_HA_q5, ch1_HA_q4, ch1_HA_q5, ch4_AA_q3, ch4_AA_q5, ch4_HA_q5, ch4_HQ_q3],[x0_AA_q0, x0_HA_q3, x0_HA_q4, x0_HA_q5, x0_HQ_q0, ch0_AA_q1, ch0_AA_q5, ch0_HA_q5, ch0_HQ_q1, ch1_AA_q5, ch1_HA_q3],

[2022-06-10 21:48:20] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 10
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:564)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:231)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:116)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-10 21:48:20] [INFO ] Flatten gal took : 46 ms
[2022-06-10 21:48:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15851245172209422449.gal : 29 ms
[2022-06-10 21:48:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3329580094333359532.prop : 0 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/ReachabilityFireability15851245172209422449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3329580094333359532.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...320
Loading property file /tmp/ReachabilityFireability3329580094333359532.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 95
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :95 after 1575
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1575 after 5280
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5280 after 12633
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12633 after 27282
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :27282 after 56523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56523 after 114948
[2022-06-10 21:48:54] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=13 took 390325 ms
[2022-06-10 21:49:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 21:49:31] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=12 took 399180 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :114948 after 231741
[2022-06-10 21:56:58] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=14 took 484285 ms
[2022-06-10 22:00:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMedical-PT-18-ReachabilityFireability-07
[2022-06-10 22:00:03] [INFO ] KInduction solution for property Medical-PT-18-ReachabilityFireability-07(SAT) depth K=13 took 632645 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :231741 after 465270
Detected timeout of ITS tools.
[2022-06-10 22:08:49] [INFO ] Flatten gal took : 59 ms
[2022-06-10 22:08:49] [INFO ] Input system was already deterministic with 223 transitions.
[2022-06-10 22:08:49] [INFO ] Transformed 62 places.
[2022-06-10 22:08:49] [INFO ] Transformed 223 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 22:08:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6186282512388515044.gal : 2 ms
[2022-06-10 22:08:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1472893136543248564.prop : 0 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/ReachabilityFireability6186282512388515044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1472893136543248564.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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...364
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability1472893136543248564.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 115
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :115 after 691
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :691 after 3120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3120 after 15418
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15418 after 68913
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :68913 after 291497
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :291497 after 1.17579e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.17579e+06 after 4.74668e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.74668e+06 after 1.90747e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.90747e+07 after 7.6476e+07
[2022-06-10 22:18:14] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=15 took 1275732 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.6476e+07 after 3.05885e+08
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 224, guards 223
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.060: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 0.223: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.223: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.224: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.224: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.227: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.227: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.228: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.228: There are 224 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.228: State length is 62, there are 223 groups
pins2lts-mc-linux64( 0/ 8), 0.228: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.228: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.228: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.228: Visible groups: 0 / 223, labels: 1 / 224
pins2lts-mc-linux64( 0/ 8), 0.228: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.228: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.228: "MedicalPT18ReachabilityFireability07==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.801: ~6 levels ~960 states ~3640 transitions
pins2lts-mc-linux64( 4/ 8), 0.879: ~7 levels ~1920 states ~7392 transitions
pins2lts-mc-linux64( 3/ 8), 1.222: ~5 levels ~3840 states ~15008 transitions
pins2lts-mc-linux64( 3/ 8), 1.939: ~7 levels ~7680 states ~30824 transitions
pins2lts-mc-linux64( 0/ 8), 2.476: ~20 levels ~15360 states ~58000 transitions
pins2lts-mc-linux64( 3/ 8), 3.947: ~10 levels ~30720 states ~125656 transitions
pins2lts-mc-linux64( 3/ 8), 6.247: ~13 levels ~61440 states ~256320 transitions
pins2lts-mc-linux64( 3/ 8), 10.380: ~17 levels ~122880 states ~520088 transitions
pins2lts-mc-linux64( 4/ 8), 16.601: ~25 levels ~245760 states ~1045704 transitions
pins2lts-mc-linux64( 4/ 8), 35.980: ~27 levels ~491520 states ~2138576 transitions
pins2lts-mc-linux64( 3/ 8), 67.650: ~25 levels ~983040 states ~4724400 transitions
pins2lts-mc-linux64( 2/ 8), 112.283: ~34 levels ~1966080 states ~9948368 transitions
pins2lts-mc-linux64( 2/ 8), 169.240: ~38 levels ~3932160 states ~20469856 transitions
pins2lts-mc-linux64( 4/ 8), 262.567: ~42 levels ~7864320 states ~37718024 transitions
pins2lts-mc-linux64( 4/ 8), 449.691: ~47 levels ~15728640 states ~77104808 transitions
pins2lts-mc-linux64( 4/ 8), 840.434: ~51 levels ~31457280 states ~158877248 transitions
pins2lts-mc-linux64( 4/ 8), 1636.468: ~57 levels ~62914560 states ~324727048 transitions
pins2lts-mc-linux64( 4/ 8), 3277.904: ~64 levels ~125829120 states ~667423272 transitions
pins2lts-mc-linux64( 0/ 8), 3308.350: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3308.378:
pins2lts-mc-linux64( 0/ 8), 3308.379: mean standard work distribution: 2.9% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 3308.379:
pins2lts-mc-linux64( 0/ 8), 3308.379: Explored 120475516 states 688307994 transitions, fanout: 5.713
pins2lts-mc-linux64( 0/ 8), 3308.379: Total exploration time 3308.150 sec (3308.100 sec minimum, 3308.120 sec on average)
pins2lts-mc-linux64( 0/ 8), 3308.379: States per second: 36418, Transitions per second: 208064
pins2lts-mc-linux64( 0/ 8), 3308.379: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 3308.379:
pins2lts-mc-linux64( 0/ 8), 3308.379: Queue width: 8B, total height: 14304724, memory: 109.14MB
pins2lts-mc-linux64( 0/ 8), 3308.379: Tree memory: 1036.2MB, 8.1 B/state, compr.: 3.2%
pins2lts-mc-linux64( 0/ 8), 3308.379: Tree fill ratio (roots/leafs): 99.0%/4.0%
pins2lts-mc-linux64( 0/ 8), 3308.379: Stored 223 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3308.379: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3308.379: Est. total memory use: 1145.4MB (~1133.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1230270654887295772;'/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' 'MedicalPT18ReachabilityFireability07==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1230270654887295772;'/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' 'MedicalPT18ReachabilityFireability07==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-10 22:26:05] [INFO ] BMC solution for property Medical-PT-18-ReachabilityFireability-07(UNSAT) depth K=16 took 471704 ms

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="Medical-PT-18"
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 Medical-PT-18, 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 r312-tall-165472282500599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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