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-167873966100417.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-S05J80, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 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 94K 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 1678891452746

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-S05J80
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:44:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:44:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:44:14] [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:44:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:44:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 481 ms
[2023-03-15 14:44:14] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 19 ms.
[2023-03-15 14:44:14] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 60 ms.
[2023-03-15 14:44:14] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:44:14] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 14:44:14] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 14:44:14] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 686 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 14:44:15] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 14:44:15] [INFO ] Computed 182 place invariants in 108 ms
[2023-03-15 14:44:16] [INFO ] [Real]Absence check using 175 positive place invariants in 60 ms returned sat
[2023-03-15 14:44:16] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:44:16] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:16] [INFO ] [Nat]Absence check using 175 positive place invariants in 49 ms returned sat
[2023-03-15 14:44:16] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:44:20] [INFO ] After 3563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:21] [INFO ] After 751ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:21] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-15 14:44:21] [INFO ] After 4737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
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 353 place count 1010 transition count 1521
Applied a total of 353 rules in 396 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
[2023-03-15 14:44:21] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2023-03-15 14:44:21] [INFO ] Computed 177 place invariants in 86 ms
[2023-03-15 14:44:22] [INFO ] Dead Transitions using invariants and state equation in 1161 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 : 1010/1189 places, 1426/1695 transitions.
Applied a total of 0 rules in 52 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1614 ms. Remains : 1010/1189 places, 1426/1695 transitions.
Incomplete random walk after 1000000 steps, including 52229 resets, run finished after 6469 ms. (steps per millisecond=154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2818 resets, run finished after 1517 ms. (steps per millisecond=659 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1931115 steps, run timeout after 21001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 1931115 steps, saw 600458 distinct states, run finished after 21002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:44:52] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 14:44:52] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 14:44:52] [INFO ] [Real]Absence check using 170 positive place invariants in 40 ms returned sat
[2023-03-15 14:44:52] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:44:52] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:52] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 14:44:52] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:44:53] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:53] [INFO ] After 380ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:54] [INFO ] Deduced a trap composed of 320 places in 344 ms of which 1 ms to minimize.
[2023-03-15 14:44:54] [INFO ] Deduced a trap composed of 320 places in 327 ms of which 1 ms to minimize.
[2023-03-15 14:44:54] [INFO ] Deduced a trap composed of 314 places in 313 ms of which 2 ms to minimize.
[2023-03-15 14:44:55] [INFO ] Deduced a trap composed of 317 places in 340 ms of which 15 ms to minimize.
[2023-03-15 14:44:55] [INFO ] Deduced a trap composed of 311 places in 320 ms of which 1 ms to minimize.
[2023-03-15 14:44:56] [INFO ] Deduced a trap composed of 320 places in 296 ms of which 0 ms to minimize.
[2023-03-15 14:44:56] [INFO ] Deduced a trap composed of 332 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:44:57] [INFO ] Deduced a trap composed of 314 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:44:57] [INFO ] Deduced a trap composed of 332 places in 302 ms of which 0 ms to minimize.
[2023-03-15 14:44:57] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:44:58] [INFO ] Deduced a trap composed of 311 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:44:58] [INFO ] Deduced a trap composed of 326 places in 296 ms of which 0 ms to minimize.
[2023-03-15 14:44:58] [INFO ] Deduced a trap composed of 329 places in 315 ms of which 1 ms to minimize.
[2023-03-15 14:44:59] [INFO ] Deduced a trap composed of 332 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:44:59] [INFO ] Deduced a trap composed of 332 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 3 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 317 places in 315 ms of which 0 ms to minimize.
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 329 places in 300 ms of which 0 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 338 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 338 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 317 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 308 places in 296 ms of which 0 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 335 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 317 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 338 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 329 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 308 places in 319 ms of which 1 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 326 places in 308 ms of which 0 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 332 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 329 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 320 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 335 places in 327 ms of which 1 ms to minimize.
[2023-03-15 14:45:08] [INFO ] Deduced a trap composed of 323 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:45:09] [INFO ] Deduced a trap composed of 320 places in 314 ms of which 10 ms to minimize.
[2023-03-15 14:45:09] [INFO ] Deduced a trap composed of 347 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:45:09] [INFO ] Deduced a trap composed of 329 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:45:10] [INFO ] Deduced a trap composed of 320 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:45:19] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 25559 ms
[2023-03-15 14:45:19] [INFO ] After 26276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:45:19] [INFO ] After 26948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 44 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 42 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 14:45:19] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:45:19] [INFO ] Invariant cache hit.
[2023-03-15 14:45:21] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2023-03-15 14:45:21] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:45:21] [INFO ] Invariant cache hit.
[2023-03-15 14:45:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:26] [INFO ] Implicit Places using invariants and state equation in 5773 ms returned []
Implicit Place search using SMT with State Equation took 7177 ms to find 0 implicit places.
[2023-03-15 14:45:27] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-15 14:45:27] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:45:27] [INFO ] Invariant cache hit.
[2023-03-15 14:45:28] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8342 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5223 resets, run finished after 767 ms. (steps per millisecond=130 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:45:28] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:45:28] [INFO ] Invariant cache hit.
[2023-03-15 14:45:29] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-15 14:45:29] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 14:45:29] [INFO ] After 450ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:29] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:45:29] [INFO ] After 148ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:29] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:29] [INFO ] [Nat]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-15 14:45:29] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 14:45:30] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:30] [INFO ] After 511ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 308 places in 307 ms of which 1 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 311 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 323 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 320 places in 310 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 320 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 311 places in 327 ms of which 9 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 0 ms to minimize.
[2023-03-15 14:45:34] [INFO ] Deduced a trap composed of 320 places in 310 ms of which 1 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 335 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:45:35] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 317 places in 325 ms of which 1 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 347 places in 305 ms of which 0 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 341 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 326 places in 313 ms of which 1 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 0 ms to minimize.
[2023-03-15 14:45:39] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:45:39] [INFO ] Deduced a trap composed of 332 places in 335 ms of which 3 ms to minimize.
[2023-03-15 14:45:40] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:45:41] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 1 ms to minimize.
[2023-03-15 14:45:41] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:45:41] [INFO ] Deduced a trap composed of 338 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:45:42] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-15 14:45:42] [INFO ] Deduced a trap composed of 341 places in 326 ms of which 1 ms to minimize.
[2023-03-15 14:45:43] [INFO ] Deduced a trap composed of 341 places in 322 ms of which 1 ms to minimize.
[2023-03-15 14:45:43] [INFO ] Deduced a trap composed of 332 places in 327 ms of which 1 ms to minimize.
[2023-03-15 14:45:43] [INFO ] Deduced a trap composed of 305 places in 320 ms of which 1 ms to minimize.
[2023-03-15 14:45:44] [INFO ] Deduced a trap composed of 317 places in 305 ms of which 3 ms to minimize.
[2023-03-15 14:45:46] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 3 ms to minimize.
[2023-03-15 14:45:46] [INFO ] Deduced a trap composed of 335 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:45:47] [INFO ] Deduced a trap composed of 335 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:45:47] [INFO ] Deduced a trap composed of 308 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:45:48] [INFO ] Deduced a trap composed of 326 places in 324 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 308 places in 325 ms of which 1 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 317 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 344 places in 309 ms of which 0 ms to minimize.
[2023-03-15 14:46:02] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 31649 ms
[2023-03-15 14:46:02] [INFO ] After 32403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:46:02] [INFO ] After 32979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 51910 resets, run finished after 6461 ms. (steps per millisecond=154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2622 resets, run finished after 1515 ms. (steps per millisecond=660 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1928393 steps, run timeout after 21001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 1928393 steps, saw 599556 distinct states, run finished after 21001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:46:31] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:46:31] [INFO ] Invariant cache hit.
[2023-03-15 14:46:31] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-15 14:46:31] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 14:46:31] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:46:32] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 14:46:32] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 14:46:32] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:46:33] [INFO ] After 534ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:46:33] [INFO ] Deduced a trap composed of 308 places in 311 ms of which 0 ms to minimize.
[2023-03-15 14:46:33] [INFO ] Deduced a trap composed of 311 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:46:34] [INFO ] Deduced a trap composed of 326 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:46:34] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 0 ms to minimize.
[2023-03-15 14:46:34] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:46:35] [INFO ] Deduced a trap composed of 320 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:46:35] [INFO ] Deduced a trap composed of 320 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:46:35] [INFO ] Deduced a trap composed of 311 places in 297 ms of which 0 ms to minimize.
[2023-03-15 14:46:36] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:46:36] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 1 ms to minimize.
[2023-03-15 14:46:37] [INFO ] Deduced a trap composed of 335 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:46:37] [INFO ] Deduced a trap composed of 332 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:46:38] [INFO ] Deduced a trap composed of 317 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:46:38] [INFO ] Deduced a trap composed of 347 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:46:38] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 1 ms to minimize.
[2023-03-15 14:46:39] [INFO ] Deduced a trap composed of 326 places in 317 ms of which 0 ms to minimize.
[2023-03-15 14:46:39] [INFO ] Deduced a trap composed of 326 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:46:41] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:46:41] [INFO ] Deduced a trap composed of 332 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:46:42] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 308 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 338 places in 293 ms of which 0 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 323 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 341 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 341 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 332 places in 299 ms of which 0 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 305 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:46:46] [INFO ] Deduced a trap composed of 317 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 320 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:46:48] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:46:48] [INFO ] Deduced a trap composed of 335 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:46:49] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:46:49] [INFO ] Deduced a trap composed of 326 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:46:52] [INFO ] Deduced a trap composed of 323 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:46:53] [INFO ] Deduced a trap composed of 308 places in 286 ms of which 1 ms to minimize.
[2023-03-15 14:46:53] [INFO ] Deduced a trap composed of 317 places in 307 ms of which 1 ms to minimize.
[2023-03-15 14:46:54] [INFO ] Deduced a trap composed of 344 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 30745 ms
[2023-03-15 14:47:03] [INFO ] After 31494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:47:03] [INFO ] After 32122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 38 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 36 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 14:47:04] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:47:04] [INFO ] Invariant cache hit.
[2023-03-15 14:47:05] [INFO ] Implicit Places using invariants in 1303 ms returned []
[2023-03-15 14:47:05] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:47:05] [INFO ] Invariant cache hit.
[2023-03-15 14:47:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:09] [INFO ] Implicit Places using invariants and state equation in 3924 ms returned []
Implicit Place search using SMT with State Equation took 5234 ms to find 0 implicit places.
[2023-03-15 14:47:09] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-15 14:47:09] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:47:09] [INFO ] Invariant cache hit.
[2023-03-15 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6319 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5227 resets, run finished after 615 ms. (steps per millisecond=162 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:47:10] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:47:10] [INFO ] Invariant cache hit.
[2023-03-15 14:47:11] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-15 14:47:11] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 14:47:11] [INFO ] After 388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:11] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:47:11] [INFO ] After 125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:11] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:11] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2023-03-15 14:47:11] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:47:12] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:12] [INFO ] After 474ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 311 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 326 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 323 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 320 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 320 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 311 places in 300 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 326 places in 300 ms of which 0 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 332 places in 290 ms of which 0 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 317 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 347 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 341 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 326 places in 306 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 332 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 314 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 308 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 323 places in 307 ms of which 1 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 338 places in 307 ms of which 0 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 323 places in 305 ms of which 0 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 341 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 341 places in 285 ms of which 1 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 332 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 305 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 317 places in 297 ms of which 2 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 335 places in 287 ms of which 1 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 335 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:47:29] [INFO ] Deduced a trap composed of 326 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 323 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 308 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 317 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 344 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 30582 ms
[2023-03-15 14:47:43] [INFO ] After 31282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:47:43] [INFO ] After 31833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 544 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275487 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275487 steps, saw 82964 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:47:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:47:46] [INFO ] Invariant cache hit.
[2023-03-15 14:47:46] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-15 14:47:46] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 14:47:46] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:46] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 14:47:46] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:47:47] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:47] [INFO ] After 334ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 341 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 311 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 326 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 311 places in 303 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 305 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 332 places in 293 ms of which 0 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 314 places in 289 ms of which 0 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 324 places in 321 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 320 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 320 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 347 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 332 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 314 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 305 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 299 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 326 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 323 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 311 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 0 ms to minimize.
[2023-03-15 14:47:57] [INFO ] Deduced a trap composed of 332 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 326 places in 298 ms of which 0 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2023-03-15 14:47:59] [INFO ] Deduced a trap composed of 332 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:47:59] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 326 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 353 places in 297 ms of which 0 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:48:02] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:48:02] [INFO ] Deduced a trap composed of 311 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 335 places in 297 ms of which 0 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 317 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 311 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 317 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 335 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 311 places in 295 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 344 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 341 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 305 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 311 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 317 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24055 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:48:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:48:11] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 37 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 14:48:11] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:48:11] [INFO ] Invariant cache hit.
[2023-03-15 14:48:12] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1045 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 10000 steps, including 529 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279316 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279316 steps, saw 84138 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:48:15] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:48:15] [INFO ] Invariant cache hit.
[2023-03-15 14:48:16] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-15 14:48:16] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-15 14:48:16] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:16] [INFO ] [Nat]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-15 14:48:16] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:48:16] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:48:17] [INFO ] After 328ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:17] [INFO ] Deduced a trap composed of 341 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:48:17] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2023-03-15 14:48:18] [INFO ] Deduced a trap composed of 311 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:48:18] [INFO ] Deduced a trap composed of 326 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 305 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 332 places in 315 ms of which 6 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 324 places in 304 ms of which 1 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 320 places in 287 ms of which 1 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 326 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:48:22] [INFO ] Deduced a trap composed of 326 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:48:22] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 0 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Deduced a trap composed of 347 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Deduced a trap composed of 332 places in 285 ms of which 0 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Deduced a trap composed of 314 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 305 places in 302 ms of which 0 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 299 places in 295 ms of which 0 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 326 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:48:25] [INFO ] Deduced a trap composed of 323 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:48:25] [INFO ] Deduced a trap composed of 311 places in 296 ms of which 0 ms to minimize.
[2023-03-15 14:48:26] [INFO ] Deduced a trap composed of 326 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:48:26] [INFO ] Deduced a trap composed of 332 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:48:27] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:48:28] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2023-03-15 14:48:28] [INFO ] Deduced a trap composed of 332 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 302 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 326 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 353 places in 302 ms of which 0 ms to minimize.
[2023-03-15 14:48:30] [INFO ] Deduced a trap composed of 317 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:48:31] [INFO ] Deduced a trap composed of 311 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:48:31] [INFO ] Deduced a trap composed of 311 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 335 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 311 places in 288 ms of which 2 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 1 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:48:33] [INFO ] Deduced a trap composed of 317 places in 287 ms of which 1 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 335 places in 320 ms of which 1 ms to minimize.
[2023-03-15 14:48:34] [INFO ] Deduced a trap composed of 311 places in 323 ms of which 1 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 344 places in 318 ms of which 1 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 341 places in 322 ms of which 1 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 305 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:48:41] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24065 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:48:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:48:41] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 41 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 52 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 14:48:41] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:48:41] [INFO ] Invariant cache hit.
[2023-03-15 14:48:42] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2023-03-15 14:48:42] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:48:42] [INFO ] Invariant cache hit.
[2023-03-15 14:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:48:47] [INFO ] Implicit Places using invariants and state equation in 4864 ms returned []
Implicit Place search using SMT with State Equation took 6235 ms to find 0 implicit places.
[2023-03-15 14:48:47] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-15 14:48:47] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 14:48:47] [INFO ] Invariant cache hit.
[2023-03-15 14:48:48] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7303 ms. Remains : 1010/1010 places, 1426/1426 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 1010 transition count 1422
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 1010 transition count 1421
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 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 133 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2023-03-15 14:48:48] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 14:48:48] [INFO ] [Real]Absence check using 170 positive place invariants in 31 ms returned sat
[2023-03-15 14:48:48] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:48:49] [INFO ] After 394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:48:49] [INFO ] Deduced a trap composed of 327 places in 305 ms of which 1 ms to minimize.
[2023-03-15 14:48:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-15 14:48:49] [INFO ] After 823ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:49] [INFO ] After 997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:49] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 14:48:49] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 14:48:50] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:50] [INFO ] Deduced a trap composed of 327 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:50] [INFO ] Deduced a trap composed of 312 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:48:51] [INFO ] Deduced a trap composed of 330 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:48:51] [INFO ] Deduced a trap composed of 327 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:48:52] [INFO ] Deduced a trap composed of 309 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:48:52] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 2 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 330 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 312 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:53] [INFO ] Deduced a trap composed of 333 places in 291 ms of which 0 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 324 places in 301 ms of which 0 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 330 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:48:54] [INFO ] Deduced a trap composed of 324 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:48:55] [INFO ] Deduced a trap composed of 321 places in 298 ms of which 2 ms to minimize.
[2023-03-15 14:48:55] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 327 places in 310 ms of which 1 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:48:56] [INFO ] Deduced a trap composed of 324 places in 310 ms of which 0 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Deduced a trap composed of 324 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Deduced a trap composed of 321 places in 300 ms of which 1 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Deduced a trap composed of 318 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:48:58] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 0 ms to minimize.
[2023-03-15 14:48:58] [INFO ] Deduced a trap composed of 330 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:48:59] [INFO ] Deduced a trap composed of 321 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:48:59] [INFO ] Deduced a trap composed of 309 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:48:59] [INFO ] Deduced a trap composed of 342 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 330 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 321 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:49:00] [INFO ] Deduced a trap composed of 336 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:49:01] [INFO ] Deduced a trap composed of 306 places in 284 ms of which 1 ms to minimize.
[2023-03-15 14:49:01] [INFO ] Deduced a trap composed of 327 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:02] [INFO ] Deduced a trap composed of 324 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:49:02] [INFO ] Deduced a trap composed of 330 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:49:02] [INFO ] Deduced a trap composed of 333 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:49:03] [INFO ] Deduced a trap composed of 291 places in 297 ms of which 0 ms to minimize.
[2023-03-15 14:49:03] [INFO ] Deduced a trap composed of 306 places in 305 ms of which 1 ms to minimize.
[2023-03-15 14:49:04] [INFO ] Deduced a trap composed of 300 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:49:04] [INFO ] Deduced a trap composed of 315 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:05] [INFO ] Deduced a trap composed of 330 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:05] [INFO ] Deduced a trap composed of 321 places in 299 ms of which 0 ms to minimize.
[2023-03-15 14:49:05] [INFO ] Deduced a trap composed of 327 places in 304 ms of which 0 ms to minimize.
[2023-03-15 14:49:06] [INFO ] Deduced a trap composed of 339 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:06] [INFO ] Deduced a trap composed of 315 places in 296 ms of which 0 ms to minimize.
[2023-03-15 14:49:07] [INFO ] Deduced a trap composed of 333 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:08] [INFO ] Deduced a trap composed of 339 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:49:08] [INFO ] Deduced a trap composed of 324 places in 302 ms of which 1 ms to minimize.
[2023-03-15 14:49:08] [INFO ] Deduced a trap composed of 330 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:49:09] [INFO ] Deduced a trap composed of 336 places in 286 ms of which 1 ms to minimize.
[2023-03-15 14:49:09] [INFO ] Deduced a trap composed of 312 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:49:10] [INFO ] Deduced a trap composed of 333 places in 287 ms of which 0 ms to minimize.
[2023-03-15 14:49:10] [INFO ] Deduced a trap composed of 327 places in 316 ms of which 0 ms to minimize.
[2023-03-15 14:49:10] [INFO ] Deduced a trap composed of 315 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:49:11] [INFO ] Deduced a trap composed of 300 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:11] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 0 ms to minimize.
[2023-03-15 14:49:11] [INFO ] Deduced a trap composed of 336 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:49:12] [INFO ] Deduced a trap composed of 330 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:49:12] [INFO ] Deduced a trap composed of 318 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:13] [INFO ] Deduced a trap composed of 321 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:49:14] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:14] [INFO ] Deduced a trap composed of 327 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:14] [INFO ] Deduced a trap composed of 330 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:49:15] [INFO ] Deduced a trap composed of 324 places in 301 ms of which 1 ms to minimize.
[2023-03-15 14:49:16] [INFO ] Deduced a trap composed of 318 places in 304 ms of which 0 ms to minimize.
[2023-03-15 14:49:16] [INFO ] Deduced a trap composed of 300 places in 288 ms of which 0 ms to minimize.
[2023-03-15 14:49:17] [INFO ] Deduced a trap composed of 312 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:49:18] [INFO ] Deduced a trap composed of 324 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:49:21] [INFO ] Deduced a trap composed of 321 places in 285 ms of which 1 ms to minimize.
[2023-03-15 14:49:25] [INFO ] Deduced a trap composed of 324 places in 294 ms of which 0 ms to minimize.
[2023-03-15 14:49:25] [INFO ] Deduced a trap composed of 333 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:25] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 0 ms to minimize.
[2023-03-15 14:49:28] [INFO ] Deduced a trap composed of 318 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:49:29] [INFO ] Deduced a trap composed of 300 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:49:31] [INFO ] Deduced a trap composed of 303 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 50147 ms
[2023-03-15 14:49:40] [INFO ] After 50706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:49:40] [INFO ] After 50880ms 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 1010 transition count 1422
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 1010 transition count 1421
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 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 112 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:49:40] [INFO ] Invariant cache hit.
[2023-03-15 14:49:40] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-15 14:49:40] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:49:40] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:49:41] [INFO ] [Nat]Absence check using 170 positive place invariants in 38 ms returned sat
[2023-03-15 14:49:41] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:49:41] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 306 places in 327 ms of which 1 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 336 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 333 places in 286 ms of which 0 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 303 places in 286 ms of which 1 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 327 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 312 places in 284 ms of which 1 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 315 places in 297 ms of which 1 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 315 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 327 places in 287 ms of which 1 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 318 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 318 places in 288 ms of which 0 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 318 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 330 places in 292 ms of which 0 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 318 places in 284 ms of which 0 ms to minimize.
[2023-03-15 14:49:48] [INFO ] Deduced a trap composed of 315 places in 292 ms of which 1 ms to minimize.
[2023-03-15 14:49:48] [INFO ] Deduced a trap composed of 309 places in 288 ms of which 0 ms to minimize.
[2023-03-15 14:49:49] [INFO ] Deduced a trap composed of 306 places in 295 ms of which 1 ms to minimize.
[2023-03-15 14:49:49] [INFO ] Deduced a trap composed of 330 places in 289 ms of which 0 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 342 places in 286 ms of which 1 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 318 places in 309 ms of which 1 ms to minimize.
[2023-03-15 14:49:51] [INFO ] Deduced a trap composed of 309 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:49:51] [INFO ] Deduced a trap composed of 315 places in 291 ms of which 0 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 327 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 321 places in 287 ms of which 0 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 333 places in 295 ms of which 0 ms to minimize.
[2023-03-15 14:49:53] [INFO ] Deduced a trap composed of 321 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:49:53] [INFO ] Deduced a trap composed of 315 places in 298 ms of which 2 ms to minimize.
[2023-03-15 14:49:54] [INFO ] Deduced a trap composed of 318 places in 286 ms of which 0 ms to minimize.
[2023-03-15 14:49:54] [INFO ] Deduced a trap composed of 318 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:49:54] [INFO ] Deduced a trap composed of 312 places in 304 ms of which 1 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Deduced a trap composed of 330 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Deduced a trap composed of 318 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Deduced a trap composed of 336 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:49:56] [INFO ] Deduced a trap composed of 315 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:49:56] [INFO ] Deduced a trap composed of 339 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:49:57] [INFO ] Deduced a trap composed of 309 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:49:58] [INFO ] Deduced a trap composed of 333 places in 299 ms of which 0 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 327 places in 298 ms of which 1 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 306 places in 290 ms of which 1 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 1 ms to minimize.
[2023-03-15 14:50:00] [INFO ] Deduced a trap composed of 309 places in 289 ms of which 1 ms to minimize.
[2023-03-15 14:50:00] [INFO ] Deduced a trap composed of 333 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:50:00] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 1 ms to minimize.
[2023-03-15 14:50:01] [INFO ] Deduced a trap composed of 321 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:50:01] [INFO ] Deduced a trap composed of 324 places in 318 ms of which 1 ms to minimize.
[2023-03-15 14:50:02] [INFO ] Deduced a trap composed of 327 places in 285 ms of which 1 ms to minimize.
[2023-03-15 14:50:03] [INFO ] Deduced a trap composed of 309 places in 294 ms of which 0 ms to minimize.
[2023-03-15 14:50:03] [INFO ] Deduced a trap composed of 327 places in 284 ms of which 1 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 315 places in 294 ms of which 1 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 330 places in 288 ms of which 0 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 0 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 312 places in 288 ms of which 1 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 324 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:50:06] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 0 ms to minimize.
[2023-03-15 14:50:11] [INFO ] Deduced a trap composed of 300 places in 314 ms of which 0 ms to minimize.
[2023-03-15 14:50:20] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 39436 ms
[2023-03-15 14:50:21] [INFO ] After 39955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:50:21] [INFO ] After 40157ms 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 366910 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S05J80
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 1678891822485

--------------------
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-S05J80"
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-S05J80, 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-167873966100417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 ;