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.r224-tall-171649612300231.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is LamportFastMutEx-COL-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612300231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 7.6K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K May 18 16:42 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 LamportFastMutEx-COL-5-ReachabilityFireability-2024-00
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-01
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-02
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-03
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-04
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-05
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-06
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-07
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-08
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-09
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-10
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-11
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-12
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-13
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-14
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716563228199

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202405141337
[2024-05-24 15:07:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:07:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 15:07:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 15:07:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 578 ms
[2024-05-24 15:07:10] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 15:07:10] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2024-05-24 15:07:10] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 3576 steps (0 resets) in 35 ms. (99 steps per ms) remains 0/1 properties
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 23 ms
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5239577379458319042.gal : 4 ms
[2024-05-24 15:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2580658011742182676.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5239577379458319042.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2580658011742182676.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

ITS tools runner thread asked to quit. Dying gracefully.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 2 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14425920388885013128.gal : 1 ms
[2024-05-24 15:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12860355186220437945.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14425920388885013128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12860355186220437945.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12860355186220437945.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7,0.002328,3564,2,23,5,68,6,0,80,32,0
Total reachable state count : 7

Domain [pid(6), pid(6)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 15:07:10] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 26 ms.
[2024-05-24 15:07:10] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 78 ms
[2024-05-24 15:07:10] [INFO ] Flatten gal took : 42 ms
[2024-05-24 15:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3451272255425702240.gal : 17 ms
[2024-05-24 15:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14333919616801745045.prop : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3451272255425702240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14333919616801745045.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14333919616801745045.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 67
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :67 after 101
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-14 is true.
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :101 after 146
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :146 after 200
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :200 after 991
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :991 after 1782
RANDOM walk for 40000 steps (8 resets) in 4443 ms. (9 steps per ms) remains 3/12 properties
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-05 is true.
Invariant property LamportFastMutEx-COL-5-ReachabilityFireability-2024-01 does not hold.
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :1782 after 2840
Invariant property LamportFastMutEx-COL-5-ReachabilityFireability-2024-12 does not hold.
BEST_FIRST walk for 40002 steps (8 resets) in 1567 ms. (25 steps per ms) remains 3/3 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2840 after 4721
BEST_FIRST walk for 40004 steps (8 resets) in 806 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
[2024-05-24 15:07:12] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-05-24 15:07:12] [INFO ] Computed 37 invariants in 17 ms
[2024-05-24 15:07:12] [INFO ] State equation strengthened by 55 read => feed constraints.
Problem LamportFastMutEx-COL-5-ReachabilityFireability-2024-13 is UNSAT
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 25/137 variables, 25/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/337 variables, 137/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 55/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 229 constraints, problems are : Problem set: 1 solved, 2 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :4721 after 17800
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/137 variables, 30/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 10 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-24 15:07:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-24 15:07:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 9/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 15:07:14] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 15:07:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 200/337 variables, 137/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 55/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 2/242 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/242 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 242 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 11/11 constraints]
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :17800 after 27745
After SMT, in 2317ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 901 ms.
Support contains 107 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 13 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 137/137 places, 260/260 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 526 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 619 ms. (64 steps per ms) remains 2/2 properties
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :27745 after 40275
Interrupted probabilistic random walk after 771841 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 2
Probabilistic random walk after 771841 steps, saw 211562 distinct states, run finished after 3006 ms. (steps per millisecond=256 ) properties seen :0
[2024-05-24 15:07:19] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 15:07:19] [INFO ] Invariant cache hit.
[2024-05-24 15:07:19] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:07:19] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 15:07:19] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 15:07:19] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-24 15:07:19] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/337 variables, 137/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 55/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/137 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 15:07:20] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 200/337 variables, 137/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 55/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:07:21] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:07:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
[2024-05-24 15:07:21] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
SDD size :40275 after 80527
[2024-05-24 15:07:21] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:21] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/337 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints]
After SMT, in 2656ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 858 ms.
Support contains 107 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 137/137 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-24 15:07:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 15:07:22] [INFO ] Invariant cache hit.
[2024-05-24 15:07:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 15:07:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 15:07:22] [INFO ] Invariant cache hit.
[2024-05-24 15:07:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-24 15:07:22] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-24 15:07:22] [INFO ] Redundant transitions in 12 ms returned []
Running 255 sub problems to find dead transitions.
[2024-05-24 15:07:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 15:07:22] [INFO ] Invariant cache hit.
[2024-05-24 15:07:22] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-24 15:07:23] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-24 15:07:23] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 8 solved, 247 unsolved
[2024-05-24 15:07:24] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 8 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 5 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:25] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 29 solved, 226 unsolved
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 15:07:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:07:27] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 15:07:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:29] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/117 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:07:30] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/137 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:07:31] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:32] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 16/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 200/337 variables, 137/290 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 55/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/345 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/337 variables, 2/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/337 variables, 0/347 constraints. Problems are: Problem set: 30 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 347 constraints, problems are : Problem set: 30 solved, 225 unsolved in 20950 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 62/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/99 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 56/155 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 16/171 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:47] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:07:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/174 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:47] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 10/184 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:07:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:07:50] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 15:07:50] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:50] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:07:50] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 200/337 variables, 137/341 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 55/396 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 225/621 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:07:56] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-24 15:07:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:07:57] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 9/630 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:02] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 19/649 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 2 ms to minimize.
[2024-05-24 15:08:09] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-24 15:08:10] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 8/657 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 657 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 203/203 constraints]
After SMT, in 51078ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 51083ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 137/137 places, 230/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-05-24 15:08:14] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51329 ms. Remains : 137/137 places, 230/260 transitions.
RANDOM walk for 40000 steps (8 resets) in 502 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 835647 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 2
Probabilistic random walk after 835647 steps, saw 227270 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-05-24 15:08:17] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2024-05-24 15:08:17] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 15:08:17] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 30/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:08:17] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:08:17] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-24 15:08:17] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 180/317 variables, 137/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 50/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/137 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:08:18] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:19] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:19] [INFO ] Deduced a trap composed of 28 places in 508 ms of which 32 ms to minimize.
[2024-05-24 15:08:19] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 180/317 variables, 137/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 50/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 3 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:20] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 250 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2936 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints]
After SMT, in 3625ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 347 ms.
Support contains 107 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 137/137 places, 230/230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 18 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-05-24 15:08:21] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2024-05-24 15:08:21] [INFO ] Invariant cache hit.
[2024-05-24 15:08:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 15:08:21] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2024-05-24 15:08:21] [INFO ] Invariant cache hit.
[2024-05-24 15:08:21] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-24 15:08:21] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-24 15:08:21] [INFO ] Redundant transitions in 2 ms returned []
Running 225 sub problems to find dead transitions.
[2024-05-24 15:08:21] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2024-05-24 15:08:21] [INFO ] Invariant cache hit.
[2024-05-24 15:08:21] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 5/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:08:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:08:24] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-24 15:08:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:27] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:28] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:29] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:08:30] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:08:31] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:32] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:33] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:34] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-24 15:08:34] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-24 15:08:35] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:36] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:37] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:39] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 15:08:39] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-24 15:08:39] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:39] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2024-05-24 15:08:39] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:40] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 15:08:40] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:08:40] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:41] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 17/221 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:42] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:44] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:44] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:44] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:44] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 15:08:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 15:08:45] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 15:08:46] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 15:08:47] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/137 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:48] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:48] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-24 15:08:48] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 15:08:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 15:08:49] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:49] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-24 15:08:49] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/137 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-24 15:08:50] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/137 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/137 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SMT process timed out in 30109ms, After SMT, problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 30115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30329 ms. Remains : 137/137 places, 230/230 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 137 transition count 180
Applied a total of 50 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 180/230 (removed 50) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 137 cols
[2024-05-24 15:08:52] [INFO ] Computed 37 invariants in 4 ms
[2024-05-24 15:08:52] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2024-05-24 15:08:52] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 15:08:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 15:08:52] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 15:08:52] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 15:08:53] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 15:08:53] [INFO ] Flatten gal took : 14 ms
[2024-05-24 15:08:53] [INFO ] Flatten gal took : 24 ms
[2024-05-24 15:08:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7883776046437329594.gal : 3 ms
[2024-05-24 15:08:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5380043123867839968.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7883776046437329594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5380043123867839968.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5380043123867839968.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 78
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :78 after 88
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :88 after 201
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :201 after 354
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-11 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :354 after 1062
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1062 after 11172
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-07 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,201984,0.206311,8084,2,1363,15,17044,6,0,730,7392,0
Total reachable state count : 201984

Verifying 2 reachability properties.
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-5-ReachabilityFireability-2024-07,4,1.15405,8304,2,237,15,17044,7,0,1107,7392,0
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-5-ReachabilityFireability-2024-11,681,2.73462,9088,2,907,15,30421,8,0,1342,9779,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 4022 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 15:08:56] [INFO ] Flatten gal took : 20 ms
[2024-05-24 15:08:56] [INFO ] Applying decomposition
[2024-05-24 15:08:56] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4915070976091332836.txt' '-o' '/tmp/graph4915070976091332836.bin' '-w' '/tmp/graph4915070976091332836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4915070976091332836.bin' '-l' '-1' '-v' '-w' '/tmp/graph4915070976091332836.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:08:56] [INFO ] Decomposing Gal with order
[2024-05-24 15:08:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:08:56] [INFO ] Removed a total of 358 redundant transitions.
[2024-05-24 15:08:56] [INFO ] Flatten gal took : 57 ms
[2024-05-24 15:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 15 ms.
[2024-05-24 15:08:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2432181257833229129.gal : 5 ms
[2024-05-24 15:08:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4339736632543730540.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2432181257833229129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4339736632543730540.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4339736632543730540.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 372
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :372 after 10231
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10231 after 41163
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41163 after 283214
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.30682e+08,63.8262,935436,4317,48,1.34039e+06,967,1076,4.4296e+06,75,4793,0
Total reachable state count : 530682432

Verifying 2 reachability properties.
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-07 does not hold.
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : LamportFastMutEx-COL-5-ReachabilityFireability-2024-07

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-5-ReachabilityFireability-2024-07,0,64.2158,935436,1,0,1.34039e+06,967,1604,4.4296e+06,90,4793,37584
Reachability property LamportFastMutEx-COL-5-ReachabilityFireability-2024-11 does not hold.
FORMULA LamportFastMutEx-COL-5-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : LamportFastMutEx-COL-5-ReachabilityFireability-2024-11

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-5-ReachabilityFireability-2024-11,0,64.4315,935436,1,0,1.34039e+06,967,2085,4.4296e+06,94,4793,106517
All properties solved without resorting to model-checking.
Total runtime 171493 ms.

BK_STOP 1716563400848

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-5"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-5, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649612300231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;