Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716900306.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 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 ShieldIIPt-PT-040A-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679438929545

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:48:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:48:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:48:53] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-21 22:48:53] [INFO ] Transformed 763 places.
[2023-03-21 22:48:53] [INFO ] Transformed 563 transitions.
[2023-03-21 22:48:53] [INFO ] Found NUPN structural information;
[2023-03-21 22:48:53] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 172 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 61 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-21 22:48:53] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-21 22:48:54] [INFO ] Implicit Places using invariants in 1645 ms returned []
[2023-03-21 22:48:54] [INFO ] Invariant cache hit.
[2023-03-21 22:48:57] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 4062 ms to find 0 implicit places.
[2023-03-21 22:48:57] [INFO ] Invariant cache hit.
[2023-03-21 22:48:57] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4770 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 172 out of 763 places after structural reductions.
[2023-03-21 22:48:58] [INFO ] Flatten gal took : 123 ms
[2023-03-21 22:48:58] [INFO ] Flatten gal took : 90 ms
[2023-03-21 22:48:58] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 163 out of 763 places (down from 172) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 72) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=13 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-21 22:49:00] [INFO ] Invariant cache hit.
[2023-03-21 22:49:01] [INFO ] [Real]Absence check using 361 positive place invariants in 305 ms returned sat
[2023-03-21 22:49:04] [INFO ] After 4396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:50
[2023-03-21 22:49:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 126 ms returned sat
[2023-03-21 22:49:11] [INFO ] After 4766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :50
[2023-03-21 22:49:16] [INFO ] After 9841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :50
Attempting to minimize the solution found.
Minimization took 4114 ms.
[2023-03-21 22:49:20] [INFO ] After 15726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :50
Fused 50 Parikh solutions to 49 different solutions.
Parikh walk visited 0 properties in 8082 ms.
Support contains 124 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 65 place count 761 transition count 560
Applied a total of 65 rules in 220 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 50) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:49:29] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-21 22:49:31] [INFO ] [Real]Absence check using 361 positive place invariants in 818 ms returned sat
[2023-03-21 22:49:33] [INFO ] After 3365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:35
[2023-03-21 22:49:33] [INFO ] [Nat]Absence check using 361 positive place invariants in 93 ms returned sat
[2023-03-21 22:49:37] [INFO ] After 2743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :35
[2023-03-21 22:49:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 22:49:39] [INFO ] After 2091ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :35
[2023-03-21 22:49:42] [INFO ] After 5129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :35
Attempting to minimize the solution found.
Minimization took 2284 ms.
[2023-03-21 22:49:45] [INFO ] After 12004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :35
Parikh walk visited 0 properties in 4816 ms.
Support contains 82 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 761 transition count 560
Applied a total of 6 rules in 64 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 35) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:49:50] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 22:49:51] [INFO ] [Real]Absence check using 361 positive place invariants in 60 ms returned sat
[2023-03-21 22:49:52] [INFO ] After 1915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-21 22:49:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 110 ms returned sat
[2023-03-21 22:49:56] [INFO ] After 2128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-21 22:49:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-21 22:49:57] [INFO ] After 1505ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-21 22:50:00] [INFO ] After 3920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1730 ms.
[2023-03-21 22:50:01] [INFO ] After 9312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 9 properties in 4583 ms.
Support contains 49 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 761 transition count 560
Applied a total of 3 rules in 43 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 171767 steps, run timeout after 3012 ms. (steps per millisecond=57 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1}
Probabilistic random walk after 171767 steps, saw 167759 distinct states, run finished after 3017 ms. (steps per millisecond=56 ) properties seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:50:10] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-21 22:50:10] [INFO ] [Real]Absence check using 361 positive place invariants in 294 ms returned sat
[2023-03-21 22:50:11] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 165 ms returned sat
[2023-03-21 22:50:12] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-21 22:50:12] [INFO ] After 150ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:12] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-21 22:50:12] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 9 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 761 transition count 560
Applied a total of 9 rules in 53 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292143 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292143 steps, saw 282851 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-21 22:50:15] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-21 22:50:16] [INFO ] [Real]Absence check using 361 positive place invariants in 70 ms returned sat
[2023-03-21 22:50:16] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 202 ms returned sat
[2023-03-21 22:50:17] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-21 22:50:17] [INFO ] After 143ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:17] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-21 22:50:17] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 9 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 46 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 761/761 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 23 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-21 22:50:17] [INFO ] Invariant cache hit.
[2023-03-21 22:50:18] [INFO ] Implicit Places using invariants in 686 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 714 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 759/761 places, 560/560 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 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 19 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-21 22:50:18] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:50:19] [INFO ] Implicit Places using invariants in 636 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 641 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 757/761 places, 559/560 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 756 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 66 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-21 22:50:19] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:50:20] [INFO ] Implicit Places using invariants in 878 ms returned []
[2023-03-21 22:50:20] [INFO ] Invariant cache hit.
[2023-03-21 22:50:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-21 22:50:21] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 756/761 places, 558/560 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3790 ms. Remains : 756/761 places, 558/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 296720 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296720 steps, saw 287158 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:50:24] [INFO ] Invariant cache hit.
[2023-03-21 22:50:25] [INFO ] [Real]Absence check using 358 positive place invariants in 190 ms returned sat
[2023-03-21 22:50:25] [INFO ] After 909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:25] [INFO ] [Nat]Absence check using 358 positive place invariants in 92 ms returned sat
[2023-03-21 22:50:26] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-21 22:50:26] [INFO ] After 147ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:26] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-21 22:50:26] [INFO ] After 1042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 9 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 19 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 756/756 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 17 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-21 22:50:26] [INFO ] Invariant cache hit.
[2023-03-21 22:50:27] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-21 22:50:27] [INFO ] Invariant cache hit.
[2023-03-21 22:50:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-21 22:50:28] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
[2023-03-21 22:50:28] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-21 22:50:28] [INFO ] Invariant cache hit.
[2023-03-21 22:50:29] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2605 ms. Remains : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 756 transition count 558
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 756 transition count 519
Applied a total of 78 rules in 55 ms. Remains 756 /756 variables (removed 0) and now considering 519/558 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 756 cols
[2023-03-21 22:50:29] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:50:29] [INFO ] [Real]Absence check using 358 positive place invariants in 62 ms returned sat
[2023-03-21 22:50:29] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:50:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2023-03-21 22:50:30] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:31] [INFO ] After 927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-21 22:50:31] [INFO ] After 1210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 53 ms
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 69 ms
[2023-03-21 22:50:31] [INFO ] Input system was already deterministic with 562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 39 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 34 ms
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 46 ms
[2023-03-21 22:50:31] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 38 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 29 ms
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 30 ms
[2023-03-21 22:50:31] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:31] [INFO ] Flatten gal took : 29 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 29 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 32 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 52 ms
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 28 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 34 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 42 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 35 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 39 ms
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 36 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 33 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 45 ms
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 24 ms
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 26 ms
[2023-03-21 22:50:32] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:32] [INFO ] Flatten gal took : 24 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 40 ms
[2023-03-21 22:50:33] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 25 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 26 ms
[2023-03-21 22:50:33] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 26 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:33] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 26 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 40 ms
[2023-03-21 22:50:33] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 24 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 40 ms
[2023-03-21 22:50:33] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 25 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:33] [INFO ] Input system was already deterministic with 562 transitions.
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 35 ms
[2023-03-21 22:50:33] [INFO ] Flatten gal took : 27 ms
[2023-03-21 22:50:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 22:50:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 763 places, 562 transitions and 2404 arcs took 16 ms.
Total runtime 101070 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/578/ctl_0_ --ctl=/tmp/578/ctl_1_ --ctl=/tmp/578/ctl_2_ --ctl=/tmp/578/ctl_3_ --ctl=/tmp/578/ctl_4_ --ctl=/tmp/578/ctl_5_ --ctl=/tmp/578/ctl_6_ --ctl=/tmp/578/ctl_7_ --ctl=/tmp/578/ctl_8_ --ctl=/tmp/578/ctl_9_ --ctl=/tmp/578/ctl_10_ --ctl=/tmp/578/ctl_11_ --ctl=/tmp/578/ctl_12_ --ctl=/tmp/578/ctl_13_ --ctl=/tmp/578/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 16010800 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096212 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldIIPt-PT-040A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-040A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716900306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;