Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r313-tall-167873966100397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBNT-COL-S05J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678891257848

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:40:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:40:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:40:59] [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.
[2023-03-15 14:40:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:40:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2023-03-15 14:40:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 19 ms.
[2023-03-15 14:40:59] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 49 ms.
[2023-03-15 14:40:59] [INFO ] Unfolded 38 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:40:59] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 14:40:59] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 14:40:59] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 162 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 14:41:00] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-15 14:41:00] [INFO ] Computed 62 place invariants in 34 ms
[2023-03-15 14:41:01] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2023-03-15 14:41:01] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:41:01] [INFO ] After 1012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:41:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-15 14:41:01] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 14:41:02] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:41:02] [INFO ] After 116ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:02] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 4 ms to minimize.
[2023-03-15 14:41:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-15 14:41:02] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-15 14:41:02] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 109 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2023-03-15 14:41:02] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2023-03-15 14:41:02] [INFO ] Computed 57 place invariants in 14 ms
[2023-03-15 14:41:02] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 18 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 290/349 places, 406/555 transitions.
Incomplete random walk after 1000000 steps, including 52308 resets, run finished after 2863 ms. (steps per millisecond=349 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7223 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2754548 steps, run timeout after 9001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 2754548 steps, saw 802834 distinct states, run finished after 9004 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:41:15] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-15 14:41:15] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-15 14:41:15] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-15 14:41:15] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 14:41:15] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:41:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-15 14:41:15] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 14:41:16] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:41:16] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:41:16] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2023-03-15 14:41:16] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2023-03-15 14:41:16] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 1 ms to minimize.
[2023-03-15 14:41:16] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:41:16] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2023-03-15 14:41:16] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 1 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 1 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 1 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 0 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:41:17] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 0 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 0 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 0 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 0 ms to minimize.
[2023-03-15 14:41:18] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2023-03-15 14:41:19] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 0 ms to minimize.
[2023-03-15 14:41:19] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2023-03-15 14:41:19] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2023-03-15 14:41:19] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:41:19] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:41:21] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:41:21] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2023-03-15 14:41:22] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:41:22] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 0 ms to minimize.
[2023-03-15 14:41:26] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:41:29] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2023-03-15 14:41:29] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2023-03-15 14:41:29] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:41:29] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:41:29] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:41:29] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:41:30] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:41:30] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:41:30] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:41:30] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:41:30] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:41:32] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2023-03-15 14:41:32] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:41:33] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:41:39] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:41:40] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:41:40] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:41:42] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:41:45] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:41:46] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:41:47] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:41:47] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2023-03-15 14:41:48] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 5 ms to minimize.
[2023-03-15 14:41:55] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:41:56] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:41:57] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:41:58] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:42:02] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:42:04] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:42:05] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2023-03-15 14:42:09] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2023-03-15 14:42:18] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 62599 ms
[2023-03-15 14:42:18] [INFO ] After 62690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:42:18] [INFO ] After 63123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 14:42:18] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:42:18] [INFO ] Invariant cache hit.
[2023-03-15 14:42:19] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-15 14:42:19] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:42:19] [INFO ] Invariant cache hit.
[2023-03-15 14:42:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:19] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-15 14:42:19] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 14:42:19] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:42:19] [INFO ] Invariant cache hit.
[2023-03-15 14:42:20] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1139 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5242 resets, run finished after 460 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:42:20] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:42:20] [INFO ] Invariant cache hit.
[2023-03-15 14:42:20] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2023-03-15 14:42:20] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 14:42:20] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:42:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:20] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:42:20] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:20] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:42:20] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:42:20] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:20] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 4 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:42:21] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2023-03-15 14:42:22] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 0 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:42:23] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 104 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:42:24] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:42:25] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 1 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:42:26] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:42:35] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 14813 ms
[2023-03-15 14:42:35] [INFO ] After 14969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:42:35] [INFO ] After 15114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52168 resets, run finished after 2757 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7197 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2787548 steps, run timeout after 9001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 2787548 steps, saw 812640 distinct states, run finished after 9001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:42:48] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:42:48] [INFO ] Invariant cache hit.
[2023-03-15 14:42:48] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:42:48] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:42:48] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-15 14:42:48] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:42:48] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:48] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:48] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:42:49] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:42:50] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:42:51] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2023-03-15 14:42:52] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2023-03-15 14:42:53] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:42:54] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:42:54] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:03] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 14672 ms
[2023-03-15 14:43:03] [INFO ] After 14825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:03] [INFO ] After 15000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 14:43:03] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:03] [INFO ] Invariant cache hit.
[2023-03-15 14:43:03] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-15 14:43:03] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:03] [INFO ] Invariant cache hit.
[2023-03-15 14:43:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:04] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-15 14:43:04] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 14:43:04] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:04] [INFO ] Invariant cache hit.
[2023-03-15 14:43:04] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5200 resets, run finished after 278 ms. (steps per millisecond=359 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:04] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:04] [INFO ] Invariant cache hit.
[2023-03-15 14:43:05] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:43:05] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 14:43:05] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:43:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:05] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:43:05] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:05] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:43:05] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:43:05] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:05] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:05] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:05] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:43:05] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:43:05] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:05] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:43:05] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 1 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:06] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:07] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:08] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:43:09] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2023-03-15 14:43:10] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:43:10] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:43:10] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2023-03-15 14:43:10] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:43:10] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:43:19] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 14554 ms
[2023-03-15 14:43:19] [INFO ] After 14691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:20] [INFO ] After 14839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 517 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 841941 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 841941 steps, saw 263356 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:23] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:23] [INFO ] Invariant cache hit.
[2023-03-15 14:43:23] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2023-03-15 14:43:23] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 14:43:23] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:43:23] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:43:23] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:23] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2023-03-15 14:43:23] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:43:24] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 1 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:27] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:27] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:27] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:43:27] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 2 ms to minimize.
[2023-03-15 14:43:36] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 13530 ms
[2023-03-15 14:43:36] [INFO ] After 13647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:36] [INFO ] After 13818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 14 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 14:43:36] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:36] [INFO ] Invariant cache hit.
[2023-03-15 14:43:37] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 10000 steps, including 547 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 862743 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 862743 steps, saw 270269 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:40] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:40] [INFO ] Invariant cache hit.
[2023-03-15 14:43:40] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-15 14:43:40] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:43:40] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-15 14:43:40] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:43:40] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:40] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:40] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:43:40] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:43:40] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:43:40] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2023-03-15 14:43:41] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:43:42] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 1 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:43:43] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:43:44] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:43:44] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:43:44] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2023-03-15 14:43:44] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:43:45] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:43:54] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 13504 ms
[2023-03-15 14:43:54] [INFO ] After 13600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:54] [INFO ] After 13770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-15 14:43:54] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:54] [INFO ] Invariant cache hit.
[2023-03-15 14:43:54] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-15 14:43:54] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:54] [INFO ] Invariant cache hit.
[2023-03-15 14:43:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:54] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-15 14:43:54] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 14:43:54] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-15 14:43:54] [INFO ] Invariant cache hit.
[2023-03-15 14:43:55] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1096 ms. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 36 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2023-03-15 14:43:55] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 14:43:55] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:43:55] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-15 14:43:55] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:43:55] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-15 14:43:55] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:55] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:55] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:43:55] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:55] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:57] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 0 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:43:59] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:44:00] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:01] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:44:01] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:44:02] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:44:03] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:44:03] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:44:04] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:04] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:04] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:04] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:44:05] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 1 ms to minimize.
[2023-03-15 14:44:05] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:44:14] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 19009 ms
[2023-03-15 14:44:14] [INFO ] After 19314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:14] [INFO ] After 19370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 29 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:44:14] [INFO ] Invariant cache hit.
[2023-03-15 14:44:14] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:44:14] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 14:44:14] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-15 14:44:14] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 14:44:14] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:15] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2023-03-15 14:44:16] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:44:17] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2023-03-15 14:44:18] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2023-03-15 14:44:19] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 0 ms to minimize.
[2023-03-15 14:44:20] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:20] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:44:21] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2023-03-15 14:44:22] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:22] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:44:23] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 0 ms to minimize.
[2023-03-15 14:44:24] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 0 ms to minimize.
[2023-03-15 14:44:27] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:44:33] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2023-03-15 14:44:33] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2023-03-15 14:44:40] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 0 ms to minimize.
[2023-03-15 14:44:41] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2023-03-15 14:44:50] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 35782 ms
[2023-03-15 14:44:50] [INFO ] After 35904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:50] [INFO ] After 35960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 231459 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S05J20
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 48 places, 38 transitions, 140 arcs.
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P12)>=1)))
(potential((tk(P3)>=1) & (tk(P6)>=1) & (tk(P7)>=1)))
(potential((tk(P3)>=1) & (tk(P10)>=1) & (tk(P8)>=1)))
(potential((tk(P3)>=1) & (tk(P11)>=1) & (tk(P9)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P13)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P14)>=1)))
(potential((tk(P16)>=1) & (tk(P46)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P17)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P36)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P33)>=1) & (tk(P28)>=1)))
(potential((tk(P15)>=1) & (tk(P29)>=1)))
(potential((tk(P15)>=1) & (tk(P30)>=1)))
(potential((tk(P15)>=1) & (tk(P31)>=1)))
(potential((tk(P15)>=1) & (tk(P32)>=1)))
(potential((tk(P26)>=1) & (tk(P34)>=1) & (tk(P35)>=1) & (tk(P37)>=1)))
(potential((tk(P37)>=1) & (tk(P38)>=1) & (tk(P25)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P39)>=1) & (tk(P45)>=1)))
(potential((tk(P39)>=1) & (tk(P46)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P27)>=1) & (tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P41)>=1)))
FORMULA QuasiLiveness FALSE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1678891492340

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
WARNING:
No initial marking given, assuming zero
within model automodel built in file model.sm near line 245

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="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-COL-S05J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r313-tall-167873966100397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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