Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 04:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:34 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 1652814172726

Running Version 202205111006
[2022-05-17 19:02:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 19:02:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 19:02:53] [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.
[2022-05-17 19:02:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 19:02:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 608 ms
[2022-05-17 19:02:54] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 21 ms.
[2022-05-17 19:02:54] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 185 ms.
[2022-05-17 19:02:54] [INFO ] Unfolded 38 HLPN properties in 5 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 19:02:54] [INFO ] Reduced 9285 identical enabling conditions.
[2022-05-17 19:02:54] [INFO ] Reduced 780 identical enabling conditions.
[2022-05-17 19:02:54] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 30 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1198 ms. (steps per millisecond=8 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-05-17 19:02:56] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2022-05-17 19:02:56] [INFO ] Computed 152 place invariants in 228 ms
[2022-05-17 19:02:58] [INFO ] [Real]Absence check using 145 positive place invariants in 56 ms returned sat
[2022-05-17 19:02:58] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-17 19:03:00] [INFO ] After 1663ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:12
[2022-05-17 19:03:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:03:00] [INFO ] After 128ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:12
[2022-05-17 19:03:01] [INFO ] After 309ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:12
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-05-17 19:03:01] [INFO ] After 3239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:12
[2022-05-17 19:03:01] [INFO ] [Nat]Absence check using 145 positive place invariants in 52 ms returned sat
[2022-05-17 19:03:01] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2022-05-17 19:03:11] [INFO ] After 9789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-17 19:03:19] [INFO ] After 7461ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-17 19:03:22] [INFO ] Deduced a trap composed of 634 places in 717 ms of which 2 ms to minimize.
[2022-05-17 19:03:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 964 ms
[2022-05-17 19:03:24] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 1 ms to minimize.
[2022-05-17 19:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2022-05-17 19:03:24] [INFO ] After 13027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1256 ms.
[2022-05-17 19:03:26] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 2938 ms.
Support contains 999 out of 1234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 1220 transition count 2806
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 1220 transition count 2804
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 1218 transition count 2804
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 1216 transition count 2802
Applied a total of 26 rules in 266 ms. Remains 1216 /1234 variables (removed 18) and now considering 2802/2810 (removed 8) transitions.
[2022-05-17 19:03:29] [INFO ] Flow matrix only has 2793 transitions (discarded 9 similar events)
// Phase 1: matrix 2793 rows 1216 cols
[2022-05-17 19:03:29] [INFO ] Computed 142 place invariants in 169 ms
[2022-05-17 19:03:32] [INFO ] Dead Transitions using invariants and state equation in 2958 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1216/1234 places, 2187/2810 transitions.
Applied a total of 0 rules in 43 ms. Remains 1216 /1216 variables (removed 0) and now considering 2187/2187 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1216/1234 places, 2187/2810 transitions.
Incomplete random walk after 1000000 steps, including 62971 resets, run finished after 8392 ms. (steps per millisecond=119 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 1000001 steps, including 6822 resets, run finished after 1800 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:03:42] [INFO ] Flow matrix only has 2178 transitions (discarded 9 similar events)
// Phase 1: matrix 2178 rows 1216 cols
[2022-05-17 19:03:42] [INFO ] Computed 142 place invariants in 46 ms
[2022-05-17 19:03:42] [INFO ] [Real]Absence check using 136 positive place invariants in 45 ms returned sat
[2022-05-17 19:03:42] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 36 ms returned sat
[2022-05-17 19:03:42] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:03:43] [INFO ] [Nat]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-17 19:03:43] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 39 ms returned sat
[2022-05-17 19:03:43] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:03:44] [INFO ] After 400ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:03:44] [INFO ] Deduced a trap composed of 573 places in 538 ms of which 2 ms to minimize.
[2022-05-17 19:03:45] [INFO ] Deduced a trap composed of 569 places in 541 ms of which 1 ms to minimize.
[2022-05-17 19:03:46] [INFO ] Deduced a trap composed of 563 places in 509 ms of which 1 ms to minimize.
[2022-05-17 19:03:46] [INFO ] Deduced a trap composed of 565 places in 544 ms of which 2 ms to minimize.
[2022-05-17 19:03:47] [INFO ] Deduced a trap composed of 557 places in 544 ms of which 1 ms to minimize.
[2022-05-17 19:03:48] [INFO ] Deduced a trap composed of 565 places in 558 ms of which 2 ms to minimize.
[2022-05-17 19:03:48] [INFO ] Deduced a trap composed of 561 places in 535 ms of which 1 ms to minimize.
[2022-05-17 19:03:50] [INFO ] Deduced a trap composed of 563 places in 536 ms of which 1 ms to minimize.
[2022-05-17 19:03:51] [INFO ] Deduced a trap composed of 577 places in 585 ms of which 1 ms to minimize.
[2022-05-17 19:03:52] [INFO ] Deduced a trap composed of 573 places in 555 ms of which 1 ms to minimize.
[2022-05-17 19:03:52] [INFO ] Deduced a trap composed of 571 places in 610 ms of which 2 ms to minimize.
[2022-05-17 19:03:53] [INFO ] Deduced a trap composed of 567 places in 559 ms of which 1 ms to minimize.
[2022-05-17 19:03:54] [INFO ] Deduced a trap composed of 567 places in 564 ms of which 1 ms to minimize.
[2022-05-17 19:03:54] [INFO ] Deduced a trap composed of 583 places in 609 ms of which 1 ms to minimize.
[2022-05-17 19:04:03] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 19629 ms
[2022-05-17 19:04:04] [INFO ] After 20145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:04:04] [INFO ] After 21099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 1216 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1216/1216 places, 2187/2187 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1216 transition count 2125
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 1154 transition count 2125
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 124 place count 1154 transition count 2062
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 250 place count 1091 transition count 2062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 1090 transition count 2061
Applied a total of 252 rules in 235 ms. Remains 1090 /1216 variables (removed 126) and now considering 2061/2187 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1216 places, 2061/2187 transitions.
Incomplete random walk after 1000000 steps, including 72719 resets, run finished after 10912 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7208 resets, run finished after 2003 ms. (steps per millisecond=499 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3578657 steps, run timeout after 36001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 3578657 steps, saw 597070 distinct states, run finished after 36003 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:04:53] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:04:53] [INFO ] Computed 142 place invariants in 46 ms
[2022-05-17 19:04:53] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-17 19:04:53] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-17 19:04:53] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:04:53] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-17 19:04:53] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-17 19:04:54] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:04:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:05:00] [INFO ] After 6231ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:05:01] [INFO ] Deduced a trap composed of 446 places in 475 ms of which 1 ms to minimize.
[2022-05-17 19:05:01] [INFO ] Deduced a trap composed of 442 places in 467 ms of which 1 ms to minimize.
[2022-05-17 19:05:02] [INFO ] Deduced a trap composed of 444 places in 474 ms of which 1 ms to minimize.
[2022-05-17 19:05:02] [INFO ] Deduced a trap composed of 438 places in 492 ms of which 4 ms to minimize.
[2022-05-17 19:05:03] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:05:03] [INFO ] Deduced a trap composed of 442 places in 445 ms of which 1 ms to minimize.
[2022-05-17 19:05:04] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2022-05-17 19:05:05] [INFO ] Deduced a trap composed of 448 places in 416 ms of which 1 ms to minimize.
[2022-05-17 19:05:05] [INFO ] Deduced a trap composed of 446 places in 462 ms of which 1 ms to minimize.
[2022-05-17 19:05:06] [INFO ] Deduced a trap composed of 446 places in 457 ms of which 1 ms to minimize.
[2022-05-17 19:05:07] [INFO ] Deduced a trap composed of 440 places in 461 ms of which 1 ms to minimize.
[2022-05-17 19:05:07] [INFO ] Deduced a trap composed of 440 places in 461 ms of which 1 ms to minimize.
[2022-05-17 19:05:08] [INFO ] Deduced a trap composed of 436 places in 464 ms of which 1 ms to minimize.
[2022-05-17 19:05:08] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:05:09] [INFO ] Deduced a trap composed of 434 places in 451 ms of which 1 ms to minimize.
[2022-05-17 19:05:09] [INFO ] Deduced a trap composed of 446 places in 464 ms of which 2 ms to minimize.
[2022-05-17 19:05:10] [INFO ] Deduced a trap composed of 444 places in 489 ms of which 3 ms to minimize.
[2022-05-17 19:05:11] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:05:11] [INFO ] Deduced a trap composed of 452 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:05:12] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:05:14] [INFO ] Deduced a trap composed of 438 places in 437 ms of which 1 ms to minimize.
[2022-05-17 19:05:14] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 2 ms to minimize.
[2022-05-17 19:05:15] [INFO ] Deduced a trap composed of 442 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:05:16] [INFO ] Deduced a trap composed of 448 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:05:17] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:05:18] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:05:18] [INFO ] Deduced a trap composed of 442 places in 440 ms of which 1 ms to minimize.
[2022-05-17 19:05:20] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:05:21] [INFO ] Deduced a trap composed of 446 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:05:23] [INFO ] Deduced a trap composed of 436 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:05:23] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:05:24] [INFO ] Deduced a trap composed of 436 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:05:24] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 2 ms to minimize.
[2022-05-17 19:05:25] [INFO ] Deduced a trap composed of 436 places in 449 ms of which 1 ms to minimize.
[2022-05-17 19:05:28] [INFO ] Deduced a trap composed of 450 places in 438 ms of which 1 ms to minimize.
[2022-05-17 19:05:30] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 2 ms to minimize.
[2022-05-17 19:05:30] [INFO ] Deduced a trap composed of 438 places in 419 ms of which 1 ms to minimize.
[2022-05-17 19:05:31] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:05:40] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 39716 ms
[2022-05-17 19:05:40] [INFO ] After 45989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:05:40] [INFO ] After 46760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 52 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 51 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-17 19:05:40] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:05:40] [INFO ] Computed 142 place invariants in 68 ms
[2022-05-17 19:05:41] [INFO ] Implicit Places using invariants in 946 ms returned []
[2022-05-17 19:05:41] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:05:41] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-17 19:05:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:05:48] [INFO ] Implicit Places using invariants and state equation in 7070 ms returned []
Implicit Place search using SMT with State Equation took 8021 ms to find 0 implicit places.
[2022-05-17 19:05:48] [INFO ] Redundant transitions in 115 ms returned []
[2022-05-17 19:05:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:05:48] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-17 19:05:49] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7199 resets, run finished after 1168 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:05:50] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:05:50] [INFO ] Computed 142 place invariants in 33 ms
[2022-05-17 19:05:51] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2022-05-17 19:05:51] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-17 19:05:51] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:05:51] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2022-05-17 19:05:51] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 19:05:51] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:05:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:05:57] [INFO ] After 6094ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:05:58] [INFO ] Deduced a trap composed of 446 places in 471 ms of which 3 ms to minimize.
[2022-05-17 19:05:58] [INFO ] Deduced a trap composed of 442 places in 450 ms of which 1 ms to minimize.
[2022-05-17 19:05:59] [INFO ] Deduced a trap composed of 444 places in 461 ms of which 1 ms to minimize.
[2022-05-17 19:06:00] [INFO ] Deduced a trap composed of 438 places in 448 ms of which 1 ms to minimize.
[2022-05-17 19:06:00] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2022-05-17 19:06:01] [INFO ] Deduced a trap composed of 442 places in 459 ms of which 1 ms to minimize.
[2022-05-17 19:06:01] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 1 ms to minimize.
[2022-05-17 19:06:02] [INFO ] Deduced a trap composed of 448 places in 431 ms of which 2 ms to minimize.
[2022-05-17 19:06:02] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:06:03] [INFO ] Deduced a trap composed of 446 places in 434 ms of which 6 ms to minimize.
[2022-05-17 19:06:04] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 2 ms to minimize.
[2022-05-17 19:06:04] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:06:05] [INFO ] Deduced a trap composed of 436 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:06:05] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:06:06] [INFO ] Deduced a trap composed of 434 places in 455 ms of which 1 ms to minimize.
[2022-05-17 19:06:07] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2022-05-17 19:06:07] [INFO ] Deduced a trap composed of 444 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:06:08] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:06:08] [INFO ] Deduced a trap composed of 452 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:06:09] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:06:11] [INFO ] Deduced a trap composed of 438 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:06:11] [INFO ] Deduced a trap composed of 440 places in 437 ms of which 1 ms to minimize.
[2022-05-17 19:06:12] [INFO ] Deduced a trap composed of 442 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:06:13] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:06:14] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 0 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 438 places in 441 ms of which 1 ms to minimize.
[2022-05-17 19:06:15] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 1 ms to minimize.
[2022-05-17 19:06:17] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:06:18] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 0 ms to minimize.
[2022-05-17 19:06:20] [INFO ] Deduced a trap composed of 436 places in 436 ms of which 1 ms to minimize.
[2022-05-17 19:06:20] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:06:21] [INFO ] Deduced a trap composed of 436 places in 417 ms of which 1 ms to minimize.
[2022-05-17 19:06:21] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:06:22] [INFO ] Deduced a trap composed of 436 places in 424 ms of which 0 ms to minimize.
[2022-05-17 19:06:25] [INFO ] Deduced a trap composed of 450 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:06:26] [INFO ] Deduced a trap composed of 440 places in 417 ms of which 1 ms to minimize.
[2022-05-17 19:06:27] [INFO ] Deduced a trap composed of 438 places in 419 ms of which 1 ms to minimize.
[2022-05-17 19:06:28] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 0 ms to minimize.
[2022-05-17 19:06:37] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 39109 ms
[2022-05-17 19:06:37] [INFO ] After 45486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:06:37] [INFO ] After 46252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72636 resets, run finished after 10688 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7038 resets, run finished after 1937 ms. (steps per millisecond=516 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3582181 steps, run timeout after 36001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 3582181 steps, saw 597740 distinct states, run finished after 36001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:07:25] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:07:26] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-17 19:07:26] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2022-05-17 19:07:26] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-17 19:07:26] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:07:26] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2022-05-17 19:07:26] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-17 19:07:26] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:07:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:07:33] [INFO ] After 6068ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:07:33] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:07:34] [INFO ] Deduced a trap composed of 442 places in 439 ms of which 0 ms to minimize.
[2022-05-17 19:07:34] [INFO ] Deduced a trap composed of 444 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:07:35] [INFO ] Deduced a trap composed of 438 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:07:35] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:07:36] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:07:36] [INFO ] Deduced a trap composed of 444 places in 450 ms of which 1 ms to minimize.
[2022-05-17 19:07:37] [INFO ] Deduced a trap composed of 448 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:07:37] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 1 ms to minimize.
[2022-05-17 19:07:38] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2022-05-17 19:07:39] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:07:39] [INFO ] Deduced a trap composed of 440 places in 417 ms of which 1 ms to minimize.
[2022-05-17 19:07:40] [INFO ] Deduced a trap composed of 436 places in 427 ms of which 0 ms to minimize.
[2022-05-17 19:07:40] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:07:41] [INFO ] Deduced a trap composed of 434 places in 451 ms of which 1 ms to minimize.
[2022-05-17 19:07:41] [INFO ] Deduced a trap composed of 446 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:07:42] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2022-05-17 19:07:43] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:07:43] [INFO ] Deduced a trap composed of 452 places in 417 ms of which 1 ms to minimize.
[2022-05-17 19:07:44] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 1 ms to minimize.
[2022-05-17 19:07:46] [INFO ] Deduced a trap composed of 438 places in 420 ms of which 1 ms to minimize.
[2022-05-17 19:07:46] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:07:46] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:07:48] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 0 ms to minimize.
[2022-05-17 19:07:48] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2022-05-17 19:07:50] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:07:50] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:07:52] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 0 ms to minimize.
[2022-05-17 19:07:53] [INFO ] Deduced a trap composed of 446 places in 439 ms of which 1 ms to minimize.
[2022-05-17 19:07:54] [INFO ] Deduced a trap composed of 436 places in 420 ms of which 1 ms to minimize.
[2022-05-17 19:07:55] [INFO ] Deduced a trap composed of 438 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:07:56] [INFO ] Deduced a trap composed of 436 places in 430 ms of which 0 ms to minimize.
[2022-05-17 19:07:56] [INFO ] Deduced a trap composed of 444 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:07:57] [INFO ] Deduced a trap composed of 436 places in 418 ms of which 1 ms to minimize.
[2022-05-17 19:07:59] [INFO ] Deduced a trap composed of 450 places in 427 ms of which 1 ms to minimize.
[2022-05-17 19:08:01] [INFO ] Deduced a trap composed of 440 places in 420 ms of which 1 ms to minimize.
[2022-05-17 19:08:02] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:08:02] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:08:11] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 38750 ms
[2022-05-17 19:08:11] [INFO ] After 45006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:08:11] [INFO ] After 45756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 52 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 50 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-17 19:08:12] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:08:12] [INFO ] Computed 142 place invariants in 33 ms
[2022-05-17 19:08:13] [INFO ] Implicit Places using invariants in 940 ms returned []
[2022-05-17 19:08:13] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:08:13] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-17 19:08:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:08:20] [INFO ] Implicit Places using invariants and state equation in 7173 ms returned []
Implicit Place search using SMT with State Equation took 8114 ms to find 0 implicit places.
[2022-05-17 19:08:20] [INFO ] Redundant transitions in 89 ms returned []
[2022-05-17 19:08:20] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:08:20] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-17 19:08:21] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7187 resets, run finished after 1054 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:08:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:08:22] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-17 19:08:22] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-17 19:08:22] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 19:08:22] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:08:22] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2022-05-17 19:08:22] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 38 ms returned sat
[2022-05-17 19:08:23] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:08:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:08:29] [INFO ] After 6013ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:08:29] [INFO ] Deduced a trap composed of 446 places in 454 ms of which 1 ms to minimize.
[2022-05-17 19:08:30] [INFO ] Deduced a trap composed of 442 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:08:30] [INFO ] Deduced a trap composed of 444 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:08:31] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:08:32] [INFO ] Deduced a trap composed of 438 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:08:32] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:08:33] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 1 ms to minimize.
[2022-05-17 19:08:33] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:08:34] [INFO ] Deduced a trap composed of 446 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:08:35] [INFO ] Deduced a trap composed of 446 places in 418 ms of which 1 ms to minimize.
[2022-05-17 19:08:35] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:08:36] [INFO ] Deduced a trap composed of 440 places in 463 ms of which 1 ms to minimize.
[2022-05-17 19:08:36] [INFO ] Deduced a trap composed of 436 places in 461 ms of which 0 ms to minimize.
[2022-05-17 19:08:37] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:08:37] [INFO ] Deduced a trap composed of 434 places in 454 ms of which 1 ms to minimize.
[2022-05-17 19:08:38] [INFO ] Deduced a trap composed of 446 places in 443 ms of which 1 ms to minimize.
[2022-05-17 19:08:38] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:08:39] [INFO ] Deduced a trap composed of 442 places in 414 ms of which 1 ms to minimize.
[2022-05-17 19:08:39] [INFO ] Deduced a trap composed of 452 places in 416 ms of which 1 ms to minimize.
[2022-05-17 19:08:40] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:08:42] [INFO ] Deduced a trap composed of 438 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:08:43] [INFO ] Deduced a trap composed of 440 places in 419 ms of which 0 ms to minimize.
[2022-05-17 19:08:43] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:08:45] [INFO ] Deduced a trap composed of 448 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:08:45] [INFO ] Deduced a trap composed of 444 places in 426 ms of which 0 ms to minimize.
[2022-05-17 19:08:46] [INFO ] Deduced a trap composed of 438 places in 420 ms of which 1 ms to minimize.
[2022-05-17 19:08:47] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:08:49] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:08:49] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:08:51] [INFO ] Deduced a trap composed of 436 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:08:52] [INFO ] Deduced a trap composed of 438 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:08:52] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:08:53] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2022-05-17 19:08:54] [INFO ] Deduced a trap composed of 436 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:08:56] [INFO ] Deduced a trap composed of 450 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:08:58] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:08:58] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:08:59] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 0 ms to minimize.
[2022-05-17 19:09:08] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 39019 ms
[2022-05-17 19:09:08] [INFO ] After 45234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:09:08] [INFO ] After 45987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 729 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290292 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290292 steps, saw 47575 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:09:11] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:09:11] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-17 19:09:12] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2022-05-17 19:09:12] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-17 19:09:12] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:09:12] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2022-05-17 19:09:12] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-17 19:09:12] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:09:14] [INFO ] After 1684ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:14] [INFO ] Deduced a trap composed of 436 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:09:15] [INFO ] Deduced a trap composed of 434 places in 432 ms of which 0 ms to minimize.
[2022-05-17 19:09:16] [INFO ] Deduced a trap composed of 434 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:09:16] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 0 ms to minimize.
[2022-05-17 19:09:17] [INFO ] Deduced a trap composed of 442 places in 421 ms of which 0 ms to minimize.
[2022-05-17 19:09:17] [INFO ] Deduced a trap composed of 444 places in 432 ms of which 0 ms to minimize.
[2022-05-17 19:09:18] [INFO ] Deduced a trap composed of 458 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:09:18] [INFO ] Deduced a trap composed of 442 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:09:19] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:09:19] [INFO ] Deduced a trap composed of 446 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:09:20] [INFO ] Deduced a trap composed of 448 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:09:21] [INFO ] Deduced a trap composed of 440 places in 421 ms of which 1 ms to minimize.
[2022-05-17 19:09:21] [INFO ] Deduced a trap composed of 434 places in 420 ms of which 1 ms to minimize.
[2022-05-17 19:09:22] [INFO ] Deduced a trap composed of 448 places in 427 ms of which 1 ms to minimize.
[2022-05-17 19:09:22] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:09:23] [INFO ] Deduced a trap composed of 440 places in 439 ms of which 1 ms to minimize.
[2022-05-17 19:09:23] [INFO ] Deduced a trap composed of 446 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:09:24] [INFO ] Deduced a trap composed of 430 places in 440 ms of which 1 ms to minimize.
[2022-05-17 19:09:24] [INFO ] Deduced a trap composed of 454 places in 447 ms of which 2 ms to minimize.
[2022-05-17 19:09:25] [INFO ] Deduced a trap composed of 432 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:09:25] [INFO ] Deduced a trap composed of 436 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:09:27] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:09:27] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:09:28] [INFO ] Deduced a trap composed of 436 places in 446 ms of which 1 ms to minimize.
[2022-05-17 19:09:28] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:09:29] [INFO ] Deduced a trap composed of 446 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:09:30] [INFO ] Deduced a trap composed of 452 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:09:31] [INFO ] Deduced a trap composed of 436 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:09:31] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2022-05-17 19:09:32] [INFO ] Deduced a trap composed of 438 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:09:32] [INFO ] Deduced a trap composed of 446 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:09:33] [INFO ] Deduced a trap composed of 438 places in 416 ms of which 0 ms to minimize.
[2022-05-17 19:09:33] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 0 ms to minimize.
[2022-05-17 19:09:34] [INFO ] Deduced a trap composed of 450 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:09:35] [INFO ] Deduced a trap composed of 436 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:09:35] [INFO ] Deduced a trap composed of 448 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:09:36] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2022-05-17 19:09:37] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 22551 ms
[2022-05-17 19:09:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:09:37] [INFO ] After 25023ms 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 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 49 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-17 19:09:37] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:09:37] [INFO ] Computed 142 place invariants in 33 ms
[2022-05-17 19:09:38] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 746 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 297909 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297909 steps, saw 48759 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 19:09:41] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:09:41] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-17 19:09:41] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-17 19:09:41] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-17 19:09:41] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:09:41] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-17 19:09:41] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 19:09:42] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:09:44] [INFO ] After 1621ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 19:09:44] [INFO ] Deduced a trap composed of 436 places in 430 ms of which 1 ms to minimize.
[2022-05-17 19:09:44] [INFO ] Deduced a trap composed of 434 places in 416 ms of which 1 ms to minimize.
[2022-05-17 19:09:45] [INFO ] Deduced a trap composed of 434 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:09:45] [INFO ] Deduced a trap composed of 446 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:09:46] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:09:47] [INFO ] Deduced a trap composed of 444 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:09:47] [INFO ] Deduced a trap composed of 458 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:09:48] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:09:48] [INFO ] Deduced a trap composed of 446 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:09:49] [INFO ] Deduced a trap composed of 446 places in 419 ms of which 1 ms to minimize.
[2022-05-17 19:09:49] [INFO ] Deduced a trap composed of 448 places in 435 ms of which 1 ms to minimize.
[2022-05-17 19:09:50] [INFO ] Deduced a trap composed of 440 places in 423 ms of which 0 ms to minimize.
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 434 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:09:51] [INFO ] Deduced a trap composed of 448 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:09:52] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:09:52] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2022-05-17 19:09:53] [INFO ] Deduced a trap composed of 446 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:09:53] [INFO ] Deduced a trap composed of 430 places in 434 ms of which 1 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 454 places in 425 ms of which 0 ms to minimize.
[2022-05-17 19:09:54] [INFO ] Deduced a trap composed of 432 places in 425 ms of which 1 ms to minimize.
[2022-05-17 19:09:55] [INFO ] Deduced a trap composed of 436 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:09:56] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 1 ms to minimize.
[2022-05-17 19:09:57] [INFO ] Deduced a trap composed of 436 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:09:57] [INFO ] Deduced a trap composed of 436 places in 444 ms of which 1 ms to minimize.
[2022-05-17 19:09:58] [INFO ] Deduced a trap composed of 436 places in 427 ms of which 1 ms to minimize.
[2022-05-17 19:09:58] [INFO ] Deduced a trap composed of 446 places in 429 ms of which 0 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 452 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:10:00] [INFO ] Deduced a trap composed of 436 places in 442 ms of which 1 ms to minimize.
[2022-05-17 19:10:01] [INFO ] Deduced a trap composed of 448 places in 442 ms of which 1 ms to minimize.
[2022-05-17 19:10:01] [INFO ] Deduced a trap composed of 438 places in 456 ms of which 1 ms to minimize.
[2022-05-17 19:10:02] [INFO ] Deduced a trap composed of 446 places in 442 ms of which 1 ms to minimize.
[2022-05-17 19:10:02] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 1 ms to minimize.
[2022-05-17 19:10:03] [INFO ] Deduced a trap composed of 442 places in 444 ms of which 1 ms to minimize.
[2022-05-17 19:10:04] [INFO ] Deduced a trap composed of 450 places in 438 ms of which 1 ms to minimize.
[2022-05-17 19:10:04] [INFO ] Deduced a trap composed of 436 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 448 places in 445 ms of which 1 ms to minimize.
[2022-05-17 19:10:05] [INFO ] Deduced a trap composed of 444 places in 429 ms of which 1 ms to minimize.
[2022-05-17 19:10:06] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 22635 ms
[2022-05-17 19:10:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 19:10:06] [INFO ] After 25024ms 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 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 65 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 54 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-17 19:10:06] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:10:06] [INFO ] Computed 142 place invariants in 33 ms
[2022-05-17 19:10:07] [INFO ] Implicit Places using invariants in 861 ms returned []
[2022-05-17 19:10:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:10:07] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-17 19:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 19:10:18] [INFO ] Implicit Places using invariants and state equation in 10437 ms returned []
Implicit Place search using SMT with State Equation took 11298 ms to find 0 implicit places.
[2022-05-17 19:10:18] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-17 19:10:18] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-17 19:10:18] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-17 19:10:19] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
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 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 224 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2022-05-17 19:10:19] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-17 19:10:19] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2022-05-17 19:10:19] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-17 19:10:20] [INFO ] After 548ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 19:10:20] [INFO ] Deduced a trap composed of 438 places in 392 ms of which 1 ms to minimize.
[2022-05-17 19:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 535 ms
[2022-05-17 19:10:20] [INFO ] After 1127ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:10:20] [INFO ] After 1312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:10:20] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2022-05-17 19:10:20] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 32 ms returned sat
[2022-05-17 19:10:21] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 438 places in 406 ms of which 1 ms to minimize.
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:10:22] [INFO ] Deduced a trap composed of 438 places in 401 ms of which 1 ms to minimize.
[2022-05-17 19:10:23] [INFO ] Deduced a trap composed of 436 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:10:23] [INFO ] Deduced a trap composed of 430 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:10:24] [INFO ] Deduced a trap composed of 446 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:10:24] [INFO ] Deduced a trap composed of 434 places in 399 ms of which 1 ms to minimize.
[2022-05-17 19:10:25] [INFO ] Deduced a trap composed of 444 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:25] [INFO ] Deduced a trap composed of 444 places in 397 ms of which 1 ms to minimize.
[2022-05-17 19:10:26] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:10:26] [INFO ] Deduced a trap composed of 442 places in 391 ms of which 3 ms to minimize.
[2022-05-17 19:10:27] [INFO ] Deduced a trap composed of 434 places in 397 ms of which 1 ms to minimize.
[2022-05-17 19:10:27] [INFO ] Deduced a trap composed of 440 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:28] [INFO ] Deduced a trap composed of 424 places in 421 ms of which 1 ms to minimize.
[2022-05-17 19:10:28] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:10:28] [INFO ] Deduced a trap composed of 440 places in 393 ms of which 1 ms to minimize.
[2022-05-17 19:10:29] [INFO ] Deduced a trap composed of 446 places in 402 ms of which 1 ms to minimize.
[2022-05-17 19:10:29] [INFO ] Deduced a trap composed of 440 places in 406 ms of which 1 ms to minimize.
[2022-05-17 19:10:30] [INFO ] Deduced a trap composed of 458 places in 399 ms of which 1 ms to minimize.
[2022-05-17 19:10:30] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:10:31] [INFO ] Deduced a trap composed of 444 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:10:31] [INFO ] Deduced a trap composed of 446 places in 401 ms of which 1 ms to minimize.
[2022-05-17 19:10:32] [INFO ] Deduced a trap composed of 444 places in 424 ms of which 1 ms to minimize.
[2022-05-17 19:10:32] [INFO ] Deduced a trap composed of 434 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:33] [INFO ] Deduced a trap composed of 440 places in 397 ms of which 1 ms to minimize.
[2022-05-17 19:10:33] [INFO ] Deduced a trap composed of 438 places in 396 ms of which 1 ms to minimize.
[2022-05-17 19:10:34] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:10:34] [INFO ] Deduced a trap composed of 436 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:35] [INFO ] Deduced a trap composed of 436 places in 390 ms of which 0 ms to minimize.
[2022-05-17 19:10:35] [INFO ] Deduced a trap composed of 442 places in 399 ms of which 1 ms to minimize.
[2022-05-17 19:10:35] [INFO ] Deduced a trap composed of 438 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:36] [INFO ] Deduced a trap composed of 438 places in 387 ms of which 1 ms to minimize.
[2022-05-17 19:10:36] [INFO ] Deduced a trap composed of 442 places in 408 ms of which 1 ms to minimize.
[2022-05-17 19:10:37] [INFO ] Deduced a trap composed of 436 places in 399 ms of which 1 ms to minimize.
[2022-05-17 19:10:37] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:10:38] [INFO ] Deduced a trap composed of 444 places in 391 ms of which 1 ms to minimize.
[2022-05-17 19:10:38] [INFO ] Deduced a trap composed of 444 places in 396 ms of which 1 ms to minimize.
[2022-05-17 19:10:39] [INFO ] Deduced a trap composed of 448 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:10:39] [INFO ] Deduced a trap composed of 448 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:10:40] [INFO ] Deduced a trap composed of 434 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:10:40] [INFO ] Deduced a trap composed of 434 places in 399 ms of which 1 ms to minimize.
[2022-05-17 19:10:41] [INFO ] Deduced a trap composed of 442 places in 406 ms of which 1 ms to minimize.
[2022-05-17 19:10:41] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 0 ms to minimize.
[2022-05-17 19:10:42] [INFO ] Deduced a trap composed of 434 places in 405 ms of which 1 ms to minimize.
[2022-05-17 19:10:42] [INFO ] Deduced a trap composed of 444 places in 389 ms of which 1 ms to minimize.
[2022-05-17 19:10:43] [INFO ] Deduced a trap composed of 450 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:43] [INFO ] Deduced a trap composed of 436 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:10:44] [INFO ] Deduced a trap composed of 442 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:10:44] [INFO ] Deduced a trap composed of 430 places in 402 ms of which 1 ms to minimize.
[2022-05-17 19:10:44] [INFO ] Deduced a trap composed of 436 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:10:45] [INFO ] Deduced a trap composed of 454 places in 396 ms of which 1 ms to minimize.
[2022-05-17 19:10:45] [INFO ] Deduced a trap composed of 426 places in 394 ms of which 1 ms to minimize.
[2022-05-17 19:10:46] [INFO ] Deduced a trap composed of 442 places in 392 ms of which 1 ms to minimize.
[2022-05-17 19:10:46] [INFO ] Deduced a trap composed of 440 places in 407 ms of which 1 ms to minimize.
[2022-05-17 19:10:51] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 1 ms to minimize.
[2022-05-17 19:10:51] [INFO ] Deduced a trap composed of 454 places in 396 ms of which 0 ms to minimize.
[2022-05-17 19:10:52] [INFO ] Deduced a trap composed of 436 places in 411 ms of which 1 ms to minimize.
[2022-05-17 19:10:52] [INFO ] Deduced a trap composed of 438 places in 406 ms of which 0 ms to minimize.
[2022-05-17 19:10:53] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 1 ms to minimize.
[2022-05-17 19:10:54] [INFO ] Deduced a trap composed of 450 places in 404 ms of which 1 ms to minimize.
[2022-05-17 19:10:54] [INFO ] Deduced a trap composed of 446 places in 428 ms of which 1 ms to minimize.
[2022-05-17 19:11:04] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 42873 ms
[2022-05-17 19:11:04] [INFO ] After 43574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:11:04] [INFO ] After 43774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
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 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 199 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2022-05-17 19:11:04] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-17 19:11:04] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2022-05-17 19:11:05] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 19:11:05] [INFO ] After 536ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 19:11:06] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:11:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2022-05-17 19:11:06] [INFO ] After 1087ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:11:06] [INFO ] After 1286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 19:11:06] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2022-05-17 19:11:06] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 19:11:06] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 19:11:07] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:11:07] [INFO ] Deduced a trap composed of 438 places in 402 ms of which 0 ms to minimize.
[2022-05-17 19:11:08] [INFO ] Deduced a trap composed of 438 places in 392 ms of which 1 ms to minimize.
[2022-05-17 19:11:08] [INFO ] Deduced a trap composed of 436 places in 406 ms of which 0 ms to minimize.
[2022-05-17 19:11:09] [INFO ] Deduced a trap composed of 430 places in 407 ms of which 1 ms to minimize.
[2022-05-17 19:11:09] [INFO ] Deduced a trap composed of 446 places in 405 ms of which 1 ms to minimize.
[2022-05-17 19:11:10] [INFO ] Deduced a trap composed of 434 places in 404 ms of which 0 ms to minimize.
[2022-05-17 19:11:10] [INFO ] Deduced a trap composed of 444 places in 411 ms of which 1 ms to minimize.
[2022-05-17 19:11:11] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:11:11] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:11:12] [INFO ] Deduced a trap composed of 442 places in 401 ms of which 1 ms to minimize.
[2022-05-17 19:11:12] [INFO ] Deduced a trap composed of 434 places in 408 ms of which 1 ms to minimize.
[2022-05-17 19:11:12] [INFO ] Deduced a trap composed of 440 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:11:13] [INFO ] Deduced a trap composed of 424 places in 402 ms of which 1 ms to minimize.
[2022-05-17 19:11:13] [INFO ] Deduced a trap composed of 438 places in 410 ms of which 1 ms to minimize.
[2022-05-17 19:11:14] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 1 ms to minimize.
[2022-05-17 19:11:14] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2022-05-17 19:11:15] [INFO ] Deduced a trap composed of 440 places in 390 ms of which 1 ms to minimize.
[2022-05-17 19:11:15] [INFO ] Deduced a trap composed of 458 places in 399 ms of which 1 ms to minimize.
[2022-05-17 19:11:16] [INFO ] Deduced a trap composed of 442 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:11:16] [INFO ] Deduced a trap composed of 444 places in 401 ms of which 1 ms to minimize.
[2022-05-17 19:11:17] [INFO ] Deduced a trap composed of 446 places in 394 ms of which 1 ms to minimize.
[2022-05-17 19:11:17] [INFO ] Deduced a trap composed of 444 places in 398 ms of which 0 ms to minimize.
[2022-05-17 19:11:18] [INFO ] Deduced a trap composed of 434 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:11:18] [INFO ] Deduced a trap composed of 440 places in 421 ms of which 0 ms to minimize.
[2022-05-17 19:11:19] [INFO ] Deduced a trap composed of 438 places in 406 ms of which 1 ms to minimize.
[2022-05-17 19:11:19] [INFO ] Deduced a trap composed of 438 places in 412 ms of which 1 ms to minimize.
[2022-05-17 19:11:20] [INFO ] Deduced a trap composed of 436 places in 398 ms of which 1 ms to minimize.
[2022-05-17 19:11:20] [INFO ] Deduced a trap composed of 436 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:11:21] [INFO ] Deduced a trap composed of 442 places in 420 ms of which 1 ms to minimize.
[2022-05-17 19:11:21] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:11:21] [INFO ] Deduced a trap composed of 438 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:11:22] [INFO ] Deduced a trap composed of 442 places in 401 ms of which 1 ms to minimize.
[2022-05-17 19:11:22] [INFO ] Deduced a trap composed of 436 places in 402 ms of which 1 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 438 places in 404 ms of which 1 ms to minimize.
[2022-05-17 19:11:23] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2022-05-17 19:11:24] [INFO ] Deduced a trap composed of 444 places in 404 ms of which 1 ms to minimize.
[2022-05-17 19:11:24] [INFO ] Deduced a trap composed of 448 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:11:25] [INFO ] Deduced a trap composed of 448 places in 408 ms of which 1 ms to minimize.
[2022-05-17 19:11:25] [INFO ] Deduced a trap composed of 434 places in 396 ms of which 1 ms to minimize.
[2022-05-17 19:11:26] [INFO ] Deduced a trap composed of 434 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:11:26] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:11:27] [INFO ] Deduced a trap composed of 440 places in 401 ms of which 1 ms to minimize.
[2022-05-17 19:11:27] [INFO ] Deduced a trap composed of 434 places in 403 ms of which 1 ms to minimize.
[2022-05-17 19:11:28] [INFO ] Deduced a trap composed of 444 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:11:28] [INFO ] Deduced a trap composed of 450 places in 400 ms of which 0 ms to minimize.
[2022-05-17 19:11:29] [INFO ] Deduced a trap composed of 436 places in 395 ms of which 1 ms to minimize.
[2022-05-17 19:11:29] [INFO ] Deduced a trap composed of 442 places in 391 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 430 places in 407 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 436 places in 412 ms of which 1 ms to minimize.
[2022-05-17 19:11:30] [INFO ] Deduced a trap composed of 454 places in 423 ms of which 1 ms to minimize.
[2022-05-17 19:11:31] [INFO ] Deduced a trap composed of 426 places in 421 ms of which 1 ms to minimize.
[2022-05-17 19:11:31] [INFO ] Deduced a trap composed of 442 places in 417 ms of which 1 ms to minimize.
[2022-05-17 19:11:32] [INFO ] Deduced a trap composed of 440 places in 410 ms of which 1 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 1 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 454 places in 400 ms of which 0 ms to minimize.
[2022-05-17 19:11:37] [INFO ] Deduced a trap composed of 436 places in 431 ms of which 1 ms to minimize.
[2022-05-17 19:11:38] [INFO ] Deduced a trap composed of 438 places in 405 ms of which 1 ms to minimize.
[2022-05-17 19:11:39] [INFO ] Deduced a trap composed of 440 places in 414 ms of which 0 ms to minimize.
[2022-05-17 19:11:39] [INFO ] Deduced a trap composed of 450 places in 421 ms of which 2 ms to minimize.
[2022-05-17 19:11:40] [INFO ] Deduced a trap composed of 446 places in 414 ms of which 1 ms to minimize.
[2022-05-17 19:11:50] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 43527 ms
[2022-05-17 19:11:50] [INFO ] After 44254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:11:50] [INFO ] After 44437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 19:11:50] [INFO ] Flatten gal took : 279 ms
[2022-05-17 19:11:51] [INFO ] Flatten gal took : 198 ms
[2022-05-17 19:11:51] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10864112305507695888.gal : 56 ms
[2022-05-17 19:11:51] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5729308359418462776.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10864112305507695888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5729308359418462776.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability5729308359418462776.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
Detected timeout of ITS tools.
[2022-05-17 19:11:54] [INFO ] Flatten gal took : 133 ms
[2022-05-17 19:11:54] [INFO ] Applying decomposition
[2022-05-17 19:11:54] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7449370727854195004.txt' '-o' '/tmp/graph7449370727854195004.bin' '-w' '/tmp/graph7449370727854195004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7449370727854195004.bin' '-l' '-1' '-v' '-w' '/tmp/graph7449370727854195004.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:11:54] [INFO ] Decomposing Gal with order
[2022-05-17 19:11:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:11:55] [INFO ] Removed a total of 4062 redundant transitions.
[2022-05-17 19:11:55] [INFO ] Flatten gal took : 655 ms
[2022-05-17 19:11:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 563 labels/synchronizations in 105 ms.
[2022-05-17 19:11:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10837817957988367127.gal : 35 ms
[2022-05-17 19:11:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12732732349499262296.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10837817957988367127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12732732349499262296.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability12732732349499262296.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7513991028453254430
[2022-05-17 19:11:59] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7513991028453254430
Running compilation step : cd /tmp/ltsmin7513991028453254430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7513991028453254430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7513991028453254430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 19:12:01] [INFO ] Flatten gal took : 108 ms
[2022-05-17 19:12:01] [INFO ] Flatten gal took : 101 ms
[2022-05-17 19:12:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17418118743770715230.gal : 15 ms
[2022-05-17 19:12:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5857698371973850380.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17418118743770715230.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5857698371973850380.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityFireability5857698371973850380.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
Detected timeout of ITS tools.
[2022-05-17 19:12:31] [INFO ] Flatten gal took : 82 ms
[2022-05-17 19:12:31] [INFO ] Applying decomposition
[2022-05-17 19:12:31] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18206920830365336018.txt' '-o' '/tmp/graph18206920830365336018.bin' '-w' '/tmp/graph18206920830365336018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18206920830365336018.bin' '-l' '-1' '-v' '-w' '/tmp/graph18206920830365336018.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:12:31] [INFO ] Decomposing Gal with order
[2022-05-17 19:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:12:32] [INFO ] Removed a total of 4060 redundant transitions.
[2022-05-17 19:12:32] [INFO ] Flatten gal took : 320 ms
[2022-05-17 19:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 550 labels/synchronizations in 79 ms.
[2022-05-17 19:12:32] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16789610119345332123.gal : 20 ms
[2022-05-17 19:12:32] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14598265995140131321.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16789610119345332123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14598265995140131321.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability14598265995140131321.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 30062
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :30062 after 30062
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :30062 after 30062
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :30062 after 30062
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30062 after 30064
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :30064 after 30101
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2067048693407130991
[2022-05-17 19:13:02] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2067048693407130991
Running compilation step : cd /tmp/ltsmin2067048693407130991;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4435 ms.
Running link step : cd /tmp/ltsmin2067048693407130991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin2067048693407130991;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 19:13:32] [INFO ] Flatten gal took : 83 ms
[2022-05-17 19:13:32] [INFO ] Flatten gal took : 80 ms
[2022-05-17 19:13:32] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3711891673069610166.gal : 9 ms
[2022-05-17 19:13:32] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5888818859462842930.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3711891673069610166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5888818859462842930.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityFireability5888818859462842930.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :256335 after 502724
Detected timeout of ITS tools.
[2022-05-17 19:18:33] [INFO ] Flatten gal took : 75 ms
[2022-05-17 19:18:33] [INFO ] Applying decomposition
[2022-05-17 19:18:33] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18148338953655770145.txt' '-o' '/tmp/graph18148338953655770145.bin' '-w' '/tmp/graph18148338953655770145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18148338953655770145.bin' '-l' '-1' '-v' '-w' '/tmp/graph18148338953655770145.weights' '-q' '0' '-e' '0.001'
[2022-05-17 19:18:33] [INFO ] Decomposing Gal with order
[2022-05-17 19:18:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 19:18:33] [INFO ] Removed a total of 4062 redundant transitions.
[2022-05-17 19:18:33] [INFO ] Flatten gal took : 210 ms
[2022-05-17 19:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 565 labels/synchronizations in 65 ms.
[2022-05-17 19:18:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4757515965938299028.gal : 41 ms
[2022-05-17 19:18:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10375799157642712969.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4757515965938299028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10375799157642712969.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability10375799157642712969.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14636
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14636 after 14638
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14638 after 14640
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14640 after 14642
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14642 after 14644
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :14644 after 14648
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14648 after 14658
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :14658 after 30581
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :30581 after 30797
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :30797 after 31261
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :31261 after 139617
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :139617 after 521737
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :521737 after 1.24342e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.24342e+06 after 4.87885e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.87885e+06 after 9.47389e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.47389e+06 after 1.74503e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.74503e+07 after 3.26686e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15047412274586222819
[2022-05-17 19:23:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15047412274586222819
Running compilation step : cd /tmp/ltsmin15047412274586222819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4349 ms.
Running link step : cd /tmp/ltsmin15047412274586222819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15047412274586222819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.058: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.059: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.061: There are 2062 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.061: State length is 1090, there are 2061 groups
pins2lts-mc-linux64( 0/ 8), 0.061: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.061: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.061: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.061: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.059: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.060: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.059: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.060: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.063: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.063: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.376: ~5 levels ~960 states ~7360 transitions
pins2lts-mc-linux64( 3/ 8), 0.493: ~4 levels ~1920 states ~13288 transitions
pins2lts-mc-linux64( 3/ 8), 0.719: ~5 levels ~3840 states ~24952 transitions
pins2lts-mc-linux64( 1/ 8), 1.214: ~7 levels ~7680 states ~58080 transitions
pins2lts-mc-linux64( 1/ 8), 1.925: ~7 levels ~15360 states ~121368 transitions
pins2lts-mc-linux64( 1/ 8), 3.205: ~8 levels ~30720 states ~246912 transitions
pins2lts-mc-linux64( 1/ 8), 5.501: ~8 levels ~61440 states ~474816 transitions
pins2lts-mc-linux64( 1/ 8), 9.835: ~9 levels ~122880 states ~906080 transitions
pins2lts-mc-linux64( 1/ 8), 18.399: ~10 levels ~245760 states ~1697200 transitions
pins2lts-mc-linux64( 1/ 8), 35.483: ~11 levels ~491520 states ~3057520 transitions
pins2lts-mc-linux64( 1/ 8), 70.324: ~21 levels ~983040 states ~6505768 transitions
pins2lts-mc-linux64( 5/ 8), 114.791: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 115.607:
pins2lts-mc-linux64( 0/ 8), 115.607: mean standard work distribution: 17.3% (states) 63.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 115.607:
pins2lts-mc-linux64( 0/ 8), 115.607: Explored 1230023 states 40202255 transitions, fanout: 32.684
pins2lts-mc-linux64( 0/ 8), 115.607: Total exploration time 115.530 sec (114.730 sec minimum, 114.980 sec on average)
pins2lts-mc-linux64( 0/ 8), 115.607: States per second: 10647, Transitions per second: 347981
pins2lts-mc-linux64( 0/ 8), 115.607:
pins2lts-mc-linux64( 0/ 8), 115.607: Queue width: 8B, total height: 15372166, memory: 117.28MB
pins2lts-mc-linux64( 0/ 8), 115.607: Tree memory: 382.7MB, 24.2 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 115.607: Tree fill ratio (roots/leafs): 12.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 115.607: Stored 2143 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 115.607: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 115.607: Est. total memory use: 500.0MB (~1141.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15047412274586222819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15047412274586222819;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 19:25:34] [INFO ] Flatten gal took : 91 ms
[2022-05-17 19:25:34] [INFO ] Flatten gal took : 89 ms
[2022-05-17 19:25:34] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15668266985818321782.gal : 11 ms
[2022-05-17 19:25:34] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14231284768208317494.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15668266985818321782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14231284768208317494.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityFireability14231284768208317494.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :256335 after 502724

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S10J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J60, 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 r175-tall-165277024500497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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