Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760400115.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 11 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 253K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-030A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717227206182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:33:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:33:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:33:27] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-01 07:33:27] [INFO ] Transformed 753 places.
[2024-06-01 07:33:27] [INFO ] Transformed 723 transitions.
[2024-06-01 07:33:27] [INFO ] Found NUPN structural information;
[2024-06-01 07:33:27] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-030A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 57 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:33:27] [INFO ] Computed 271 invariants in 29 ms
[2024-06-01 07:33:28] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-06-01 07:33:28] [INFO ] Invariant cache hit.
[2024-06-01 07:33:29] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:33:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:33:51] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 10 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 4 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:33:59] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:33:59] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:33:59] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30437ms
Finished structural reductions in LTL mode , in 1 iterations and 31921 ms. Remains : 753/753 places, 723/723 transitions.
Support contains 18 out of 753 places after structural reductions.
[2024-06-01 07:33:59] [INFO ] Flatten gal took : 130 ms
[2024-06-01 07:34:00] [INFO ] Flatten gal took : 72 ms
[2024-06-01 07:34:00] [INFO ] Input system was already deterministic with 723 transitions.
Support contains 16 out of 753 places (down from 18) after GAL structural reductions.
RANDOM walk for 35915 steps (21 resets) in 1749 ms. (20 steps per ms) remains 0/9 properties
FORMULA ShieldIIPs-PT-030A-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 21 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-06-01 07:34:00] [INFO ] Invariant cache hit.
[2024-06-01 07:34:01] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 07:34:01] [INFO ] Invariant cache hit.
[2024-06-01 07:34:02] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:34:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 5 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:34:27] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 4 ms to minimize.
[2024-06-01 07:34:30] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:34:31] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
SMT process timed out in 30240ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30249ms
Finished structural reductions in LTL mode , in 1 iterations and 31479 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-030A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLCardinality-02 finished in 31723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Reduce places removed 1 places and 1 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 752 transition count 721
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 750 transition count 721
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 5 place count 749 transition count 720
Applied a total of 5 rules in 92 ms. Remains 749 /753 variables (removed 4) and now considering 720/723 (removed 3) transitions.
// Phase 1: matrix 720 rows 749 cols
[2024-06-01 07:34:32] [INFO ] Computed 270 invariants in 4 ms
[2024-06-01 07:34:32] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 07:34:32] [INFO ] Invariant cache hit.
[2024-06-01 07:34:33] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2024-06-01 07:34:33] [INFO ] Redundant transitions in 123 ms returned [712]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 718 sub problems to find dead transitions.
// Phase 1: matrix 719 rows 749 cols
[2024-06-01 07:34:33] [INFO ] Computed 270 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:34:44] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 20/1039 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:34:55] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 10/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 1.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/1468 variables, and 1049 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30032 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 30/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 719/1468 variables, 749/1798 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1468 variables, 718/2516 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:35:31] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:35:33] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:35:33] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:35:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 2521 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30027 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 749/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 35/35 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 749/753 places, 719/723 transitions.
Applied a total of 0 rules in 28 ms. Remains 749 /749 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61451 ms. Remains : 749/753 places, 719/723 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLCardinality-04
Product exploration explored 100000 steps with 93 reset in 700 ms.
Product exploration explored 100000 steps with 94 reset in 740 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 4261 steps (0 resets) in 40 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 07:35:35] [INFO ] Invariant cache hit.
[2024-06-01 07:35:36] [INFO ] [Real]Absence check using 270 positive place invariants in 104 ms returned sat
[2024-06-01 07:35:37] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2024-06-01 07:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:35:38] [INFO ] [Nat]Absence check using 270 positive place invariants in 88 ms returned sat
[2024-06-01 07:35:39] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2024-06-01 07:35:39] [INFO ] Computed and/alt/rep : 718/1787/718 causal constraints (skipped 0 transitions) in 45 ms.
[2024-06-01 07:35:52] [INFO ] Added : 630 causal constraints over 126 iterations in 13090 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 719/719 transitions.
Applied a total of 0 rules in 21 ms. Remains 749 /749 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2024-06-01 07:35:52] [INFO ] Invariant cache hit.
[2024-06-01 07:35:53] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-01 07:35:53] [INFO ] Invariant cache hit.
[2024-06-01 07:35:53] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2024-06-01 07:35:53] [INFO ] Redundant transitions in 78 ms returned []
Running 718 sub problems to find dead transitions.
[2024-06-01 07:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:36:01] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:36:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 4 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 20/1039 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 10/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/1468 variables, and 1049 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30020 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 30/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 719/1468 variables, 749/1798 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1468 variables, 718/2516 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:36:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:36:46] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:36:46] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:36:46] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:36:46] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:36:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:36:47] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:36:48] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:36:48] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:36:49] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 2526 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30027 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 749/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 40/40 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61474 ms. Remains : 749/749 places, 719/719 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 4322 steps (0 resets) in 48 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-06-01 07:36:54] [INFO ] Invariant cache hit.
[2024-06-01 07:36:55] [INFO ] [Real]Absence check using 270 positive place invariants in 105 ms returned sat
[2024-06-01 07:36:56] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2024-06-01 07:36:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:36:56] [INFO ] [Nat]Absence check using 270 positive place invariants in 87 ms returned sat
[2024-06-01 07:36:58] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2024-06-01 07:36:58] [INFO ] Computed and/alt/rep : 718/1787/718 causal constraints (skipped 0 transitions) in 39 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 94 reset in 594 ms.
Product exploration explored 100000 steps with 93 reset in 700 ms.
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 719/719 transitions.
Applied a total of 0 rules in 19 ms. Remains 749 /749 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2024-06-01 07:37:12] [INFO ] Invariant cache hit.
[2024-06-01 07:37:13] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-01 07:37:13] [INFO ] Invariant cache hit.
[2024-06-01 07:37:13] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-06-01 07:37:13] [INFO ] Redundant transitions in 67 ms returned []
Running 718 sub problems to find dead transitions.
[2024-06-01 07:37:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:37:22] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:37:23] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:37:23] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:37:23] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:37:23] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:37:23] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 20/1039 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 10/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/1468 variables, and 1049 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30019 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 749/749 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 270/1019 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 30/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 719/1468 variables, 749/1798 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1468 variables, 718/2516 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:38:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:38:06] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:38:07] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:38:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:38:08] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:38:08] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:38:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:38:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:38:09] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1468/1468 variables, and 2526 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30024 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 749/749 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 40/40 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61387 ms. Remains : 749/749 places, 719/719 transitions.
Treatment of property ShieldIIPs-PT-030A-LTLCardinality-04 finished in 221572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
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 751 transition count 721
Applied a total of 4 rules in 45 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:38:14] [INFO ] Computed 271 invariants in 5 ms
[2024-06-01 07:38:14] [INFO ] Implicit Places using invariants in 390 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 37 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 476 ms. Remains : 750/753 places, 721/723 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLCardinality-07
Product exploration explored 100000 steps with 65 reset in 721 ms.
Stuttering criterion allowed to conclude after 13689 steps with 8 reset in 123 ms.
FORMULA ShieldIIPs-PT-030A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLCardinality-07 finished in 1414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 15 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:38:15] [INFO ] Computed 271 invariants in 5 ms
[2024-06-01 07:38:15] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-06-01 07:38:15] [INFO ] Invariant cache hit.
[2024-06-01 07:38:16] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:38:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:38:43] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:38:44] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:38:44] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:38:44] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:38:46] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30021 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30024 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in LTL mode , in 1 iterations and 61368 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-030A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLCardinality-10 finished in 61472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
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 751 transition count 721
Applied a total of 4 rules in 43 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:39:17] [INFO ] Computed 271 invariants in 3 ms
[2024-06-01 07:39:17] [INFO ] Implicit Places using invariants in 360 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 721/723 transitions.
Applied a total of 0 rules in 16 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 750/753 places, 721/723 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLCardinality-13
Product exploration explored 100000 steps with 178 reset in 614 ms.
Stuttering criterion allowed to conclude after 6184 steps with 9 reset in 47 ms.
FORMULA ShieldIIPs-PT-030A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLCardinality-13 finished in 1200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 14 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:39:18] [INFO ] Computed 271 invariants in 4 ms
[2024-06-01 07:39:18] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-06-01 07:39:18] [INFO ] Invariant cache hit.
[2024-06-01 07:39:19] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:39:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:39:43] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:39:43] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:39:43] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:39:43] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:39:43] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:39:47] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:39:47] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:39:47] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:39:47] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:39:48] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1476 variables, and 1053 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30016 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 0/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 29/1053 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:40:05] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1807 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 722/2529 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 2529 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30023 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 722/722 constraints, Known Traps: 30/30 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Finished structural reductions in LTL mode , in 1 iterations and 61320 ms. Remains : 753/753 places, 723/723 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030A-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-030A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030A-LTLCardinality-14 finished in 61417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-06-01 07:40:19] [INFO ] Flatten gal took : 69 ms
[2024-06-01 07:40:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 07:40:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 753 places, 723 transitions and 3246 arcs took 6 ms.
Total runtime 412571 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldIIPs-PT-030A-LTLCardinality-04

BK_STOP 1717227850106

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-030A-LTLCardinality-04
ltl formula formula --ltl=/tmp/1479/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 723 transitions and 3246 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 755 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 754, there are 725 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1349 levels ~10000 states ~55828 transitions
pnml2lts-mc( 2/ 4): ~1349 levels ~20000 states ~80888 transitions
pnml2lts-mc( 2/ 4): ~1352 levels ~40000 states ~133456 transitions
pnml2lts-mc( 2/ 4): ~1352 levels ~80000 states ~255528 transitions
pnml2lts-mc( 2/ 4): ~1378 levels ~160000 states ~465304 transitions
pnml2lts-mc( 2/ 4): ~1378 levels ~320000 states ~950448 transitions
pnml2lts-mc( 2/ 4): ~1378 levels ~640000 states ~2036064 transitions
pnml2lts-mc( 2/ 4): ~1378 levels ~1280000 states ~4067768 transitions
pnml2lts-mc( 3/ 4): ~1324 levels ~2560000 states ~9654432 transitions
pnml2lts-mc( 2/ 4): ~1378 levels ~5120000 states ~18764876 transitions
pnml2lts-mc( 2/ 4): ~1378 levels ~10240000 states ~38892628 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12030325
pnml2lts-mc( 0/ 4): unique states count: 12035685
pnml2lts-mc( 0/ 4): unique transitions count: 50835661
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 38746456
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12035699
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5445
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12035699 states 50835685 transitions, fanout: 4.224
pnml2lts-mc( 0/ 4): Total exploration time 229.450 sec (229.430 sec minimum, 229.445 sec on average)
pnml2lts-mc( 0/ 4): States per second: 52455, Transitions per second: 221555
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 156.2MB, 13.6 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 36.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 735 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 156.2MB (~256.0MB paged-in)

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="ShieldIIPs-PT-030A"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-030A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760400115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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