Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 12K Feb 26 00:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 00:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679445374098

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J40
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:36:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 00:36:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:36:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 00:36:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 00:36:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 720 ms
[2023-03-22 00:36:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 21 ms.
[2023-03-22 00:36:16] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 209 ms.
[2023-03-22 00:36:16] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-22 00:36:16] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-22 00:36:16] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-22 00:36:16] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 40 places in 36 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1054 ms. (steps per millisecond=9 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-22 00:36:18] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-22 00:36:18] [INFO ] Computed 112 place invariants in 160 ms
[2023-03-22 00:36:20] [INFO ] [Real]Absence check using 105 positive place invariants in 82 ms returned sat
[2023-03-22 00:36:20] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 00:36:22] [INFO ] After 1743ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2023-03-22 00:36:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:36:22] [INFO ] After 216ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:9
[2023-03-22 00:36:22] [INFO ] After 478ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:9
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-22 00:36:23] [INFO ] After 3363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:9
[2023-03-22 00:36:23] [INFO ] [Nat]Absence check using 105 positive place invariants in 45 ms returned sat
[2023-03-22 00:36:23] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 00:36:28] [INFO ] After 4174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 00:36:30] [INFO ] After 2291ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 00:36:32] [INFO ] After 4499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1737 ms.
[2023-03-22 00:36:34] [INFO ] After 11293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1490 ms.
Support contains 147 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 799 transition count 2142
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 186 place count 756 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 755 transition count 2141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 755 transition count 2141
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 192 place count 753 transition count 2139
Applied a total of 192 rules in 321 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
[2023-03-22 00:36:36] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2023-03-22 00:36:36] [INFO ] Computed 102 place invariants in 69 ms
[2023-03-22 00:36:37] [INFO ] Dead Transitions using invariants and state equation in 988 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 REACHABILITY mode, iteration 1 : 753/854 places, 1524/2230 transitions.
Applied a total of 0 rules in 49 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1363 ms. Remains : 753/854 places, 1524/2230 transitions.
Incomplete random walk after 1000000 steps, including 65437 resets, run finished after 7572 ms. (steps per millisecond=132 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 1000001 steps, including 8167 resets, run finished after 1677 ms. (steps per millisecond=596 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:36:46] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2023-03-22 00:36:46] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-22 00:36:46] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-22 00:36:46] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:36:46] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:36:46] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-22 00:36:46] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:36:47] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:36:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:36:47] [INFO ] After 96ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:36:47] [INFO ] Deduced a trap composed of 304 places in 358 ms of which 2 ms to minimize.
[2023-03-22 00:36:48] [INFO ] Deduced a trap composed of 302 places in 376 ms of which 2 ms to minimize.
[2023-03-22 00:36:48] [INFO ] Deduced a trap composed of 308 places in 340 ms of which 1 ms to minimize.
[2023-03-22 00:36:49] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 0 ms to minimize.
[2023-03-22 00:36:49] [INFO ] Deduced a trap composed of 296 places in 324 ms of which 1 ms to minimize.
[2023-03-22 00:36:49] [INFO ] Deduced a trap composed of 292 places in 319 ms of which 2 ms to minimize.
[2023-03-22 00:36:50] [INFO ] Deduced a trap composed of 298 places in 339 ms of which 0 ms to minimize.
[2023-03-22 00:36:50] [INFO ] Deduced a trap composed of 292 places in 355 ms of which 0 ms to minimize.
[2023-03-22 00:36:51] [INFO ] Deduced a trap composed of 288 places in 365 ms of which 1 ms to minimize.
[2023-03-22 00:36:51] [INFO ] Deduced a trap composed of 298 places in 357 ms of which 0 ms to minimize.
[2023-03-22 00:36:52] [INFO ] Deduced a trap composed of 304 places in 382 ms of which 0 ms to minimize.
[2023-03-22 00:36:52] [INFO ] Deduced a trap composed of 306 places in 341 ms of which 0 ms to minimize.
[2023-03-22 00:36:52] [INFO ] Deduced a trap composed of 314 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:36:53] [INFO ] Deduced a trap composed of 310 places in 325 ms of which 0 ms to minimize.
[2023-03-22 00:36:53] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 0 ms to minimize.
[2023-03-22 00:36:54] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 1 ms to minimize.
[2023-03-22 00:36:54] [INFO ] Deduced a trap composed of 294 places in 339 ms of which 1 ms to minimize.
[2023-03-22 00:36:55] [INFO ] Deduced a trap composed of 304 places in 363 ms of which 3 ms to minimize.
[2023-03-22 00:36:55] [INFO ] Deduced a trap composed of 305 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:36:55] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:36:56] [INFO ] Deduced a trap composed of 292 places in 357 ms of which 0 ms to minimize.
[2023-03-22 00:36:56] [INFO ] Deduced a trap composed of 310 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:36:57] [INFO ] Deduced a trap composed of 286 places in 324 ms of which 0 ms to minimize.
[2023-03-22 00:36:57] [INFO ] Deduced a trap composed of 296 places in 335 ms of which 0 ms to minimize.
[2023-03-22 00:37:05] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:37:06] [INFO ] Deduced a trap composed of 310 places in 355 ms of which 1 ms to minimize.
[2023-03-22 00:37:06] [INFO ] Deduced a trap composed of 298 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:37:06] [INFO ] Deduced a trap composed of 290 places in 360 ms of which 1 ms to minimize.
[2023-03-22 00:37:07] [INFO ] Deduced a trap composed of 302 places in 376 ms of which 1 ms to minimize.
[2023-03-22 00:37:07] [INFO ] Deduced a trap composed of 290 places in 375 ms of which 1 ms to minimize.
[2023-03-22 00:37:08] [INFO ] Deduced a trap composed of 286 places in 369 ms of which 1 ms to minimize.
[2023-03-22 00:37:08] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 2 ms to minimize.
[2023-03-22 00:37:08] [INFO ] Deduced a trap composed of 312 places in 343 ms of which 1 ms to minimize.
[2023-03-22 00:37:09] [INFO ] Deduced a trap composed of 294 places in 350 ms of which 1 ms to minimize.
[2023-03-22 00:37:13] [INFO ] Deduced a trap composed of 306 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:37:14] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:37:14] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 0 ms to minimize.
[2023-03-22 00:37:15] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:37:15] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 0 ms to minimize.
[2023-03-22 00:37:16] [INFO ] Deduced a trap composed of 304 places in 338 ms of which 1 ms to minimize.
[2023-03-22 00:37:16] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:37:16] [INFO ] Deduced a trap composed of 300 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:37:17] [INFO ] Deduced a trap composed of 304 places in 353 ms of which 1 ms to minimize.
[2023-03-22 00:37:17] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:37:18] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 0 ms to minimize.
[2023-03-22 00:37:18] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:37:18] [INFO ] Deduced a trap composed of 304 places in 343 ms of which 1 ms to minimize.
[2023-03-22 00:37:19] [INFO ] Deduced a trap composed of 298 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:37:20] [INFO ] Deduced a trap composed of 300 places in 323 ms of which 2 ms to minimize.
[2023-03-22 00:37:20] [INFO ] Deduced a trap composed of 312 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:37:20] [INFO ] Deduced a trap composed of 304 places in 338 ms of which 1 ms to minimize.
[2023-03-22 00:37:21] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 1 ms to minimize.
[2023-03-22 00:37:21] [INFO ] Deduced a trap composed of 308 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:37:22] [INFO ] Deduced a trap composed of 308 places in 345 ms of which 1 ms to minimize.
[2023-03-22 00:37:22] [INFO ] Deduced a trap composed of 306 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:37:22] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:37:23] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:37:24] [INFO ] Deduced a trap composed of 310 places in 345 ms of which 1 ms to minimize.
[2023-03-22 00:37:24] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:37:25] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:37:25] [INFO ] Deduced a trap composed of 304 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:37:26] [INFO ] Deduced a trap composed of 290 places in 338 ms of which 1 ms to minimize.
[2023-03-22 00:37:26] [INFO ] Deduced a trap composed of 294 places in 332 ms of which 2 ms to minimize.
[2023-03-22 00:37:27] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:37:28] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:37:28] [INFO ] Deduced a trap composed of 300 places in 320 ms of which 8 ms to minimize.
[2023-03-22 00:37:29] [INFO ] Deduced a trap composed of 294 places in 338 ms of which 2 ms to minimize.
[2023-03-22 00:37:29] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:37:30] [INFO ] Deduced a trap composed of 310 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:37:30] [INFO ] Deduced a trap composed of 294 places in 366 ms of which 0 ms to minimize.
[2023-03-22 00:37:31] [INFO ] Deduced a trap composed of 310 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:37:31] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:37:32] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 5 ms to minimize.
[2023-03-22 00:37:32] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:37:33] [INFO ] Deduced a trap composed of 308 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:37:33] [INFO ] Deduced a trap composed of 304 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:37:34] [INFO ] Deduced a trap composed of 308 places in 331 ms of which 2 ms to minimize.
[2023-03-22 00:37:43] [INFO ] Trap strengthening (SAT) tested/added 77/77 trap constraints in 56327 ms
[2023-03-22 00:37:43] [INFO ] After 56566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:37:43] [INFO ] After 57221ms 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 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1524/1524 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 753 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 752 transition count 1523
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 752 transition count 1521
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 6 place count 750 transition count 1521
Applied a total of 6 rules in 114 ms. Remains 750 /753 variables (removed 3) and now considering 1521/1524 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 750/753 places, 1521/1524 transitions.
Incomplete random walk after 1000000 steps, including 72390 resets, run finished after 9726 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8155 resets, run finished after 1858 ms. (steps per millisecond=538 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4428414 steps, run timeout after 33001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 4428414 steps, saw 755221 distinct states, run finished after 33016 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:38:28] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-22 00:38:28] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-22 00:38:28] [INFO ] [Real]Absence check using 95 positive place invariants in 47 ms returned sat
[2023-03-22 00:38:28] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-22 00:38:28] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:38:29] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-22 00:38:29] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-22 00:38:29] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:38:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:38:29] [INFO ] After 200ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:38:30] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:38:30] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:38:30] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:38:31] [INFO ] Deduced a trap composed of 306 places in 322 ms of which 1 ms to minimize.
[2023-03-22 00:38:31] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:38:32] [INFO ] Deduced a trap composed of 310 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:38:32] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:38:32] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:38:33] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:38:33] [INFO ] Deduced a trap composed of 304 places in 367 ms of which 0 ms to minimize.
[2023-03-22 00:38:34] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:38:34] [INFO ] Deduced a trap composed of 300 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:38:34] [INFO ] Deduced a trap composed of 298 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:38:36] [INFO ] Deduced a trap composed of 304 places in 322 ms of which 1 ms to minimize.
[2023-03-22 00:38:36] [INFO ] Deduced a trap composed of 298 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:38:37] [INFO ] Deduced a trap composed of 308 places in 445 ms of which 0 ms to minimize.
[2023-03-22 00:38:37] [INFO ] Deduced a trap composed of 308 places in 350 ms of which 1 ms to minimize.
[2023-03-22 00:38:37] [INFO ] Deduced a trap composed of 306 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:38:38] [INFO ] Deduced a trap composed of 304 places in 361 ms of which 0 ms to minimize.
[2023-03-22 00:38:38] [INFO ] Deduced a trap composed of 310 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:38:39] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:38:39] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:38:40] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 1 ms to minimize.
[2023-03-22 00:38:40] [INFO ] Deduced a trap composed of 308 places in 311 ms of which 0 ms to minimize.
[2023-03-22 00:38:41] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:38:41] [INFO ] Deduced a trap composed of 296 places in 359 ms of which 0 ms to minimize.
[2023-03-22 00:38:42] [INFO ] Deduced a trap composed of 290 places in 345 ms of which 0 ms to minimize.
[2023-03-22 00:38:43] [INFO ] Deduced a trap composed of 288 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:38:43] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:38:44] [INFO ] Deduced a trap composed of 300 places in 354 ms of which 1 ms to minimize.
[2023-03-22 00:38:44] [INFO ] Deduced a trap composed of 299 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:38:45] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:38:45] [INFO ] Deduced a trap composed of 309 places in 329 ms of which 0 ms to minimize.
[2023-03-22 00:38:45] [INFO ] Deduced a trap composed of 296 places in 343 ms of which 1 ms to minimize.
[2023-03-22 00:38:46] [INFO ] Deduced a trap composed of 301 places in 345 ms of which 0 ms to minimize.
[2023-03-22 00:38:46] [INFO ] Deduced a trap composed of 296 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:38:47] [INFO ] Deduced a trap composed of 290 places in 351 ms of which 1 ms to minimize.
[2023-03-22 00:38:47] [INFO ] Deduced a trap composed of 294 places in 343 ms of which 0 ms to minimize.
[2023-03-22 00:38:47] [INFO ] Deduced a trap composed of 313 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:38:48] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:38:49] [INFO ] Deduced a trap composed of 292 places in 360 ms of which 1 ms to minimize.
[2023-03-22 00:38:49] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 0 ms to minimize.
[2023-03-22 00:38:50] [INFO ] Deduced a trap composed of 296 places in 343 ms of which 1 ms to minimize.
[2023-03-22 00:38:50] [INFO ] Deduced a trap composed of 299 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:38:51] [INFO ] Deduced a trap composed of 294 places in 349 ms of which 0 ms to minimize.
[2023-03-22 00:38:52] [INFO ] Deduced a trap composed of 306 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:38:54] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:38:54] [INFO ] Deduced a trap composed of 290 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:38:55] [INFO ] Deduced a trap composed of 292 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:38:55] [INFO ] Deduced a trap composed of 304 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:38:55] [INFO ] Deduced a trap composed of 294 places in 328 ms of which 1 ms to minimize.
[2023-03-22 00:38:56] [INFO ] Deduced a trap composed of 310 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:38:56] [INFO ] Deduced a trap composed of 296 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:38:56] [INFO ] Deduced a trap composed of 298 places in 346 ms of which 0 ms to minimize.
[2023-03-22 00:38:57] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:38:57] [INFO ] Deduced a trap composed of 300 places in 335 ms of which 0 ms to minimize.
[2023-03-22 00:38:58] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:39:01] [INFO ] Deduced a trap composed of 304 places in 317 ms of which 0 ms to minimize.
[2023-03-22 00:39:02] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 1 ms to minimize.
[2023-03-22 00:39:03] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:39:03] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:39:04] [INFO ] Deduced a trap composed of 307 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:39:04] [INFO ] Deduced a trap composed of 310 places in 340 ms of which 3 ms to minimize.
[2023-03-22 00:39:04] [INFO ] Deduced a trap composed of 288 places in 345 ms of which 1 ms to minimize.
[2023-03-22 00:39:05] [INFO ] Deduced a trap composed of 292 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:39:05] [INFO ] Deduced a trap composed of 288 places in 344 ms of which 1 ms to minimize.
[2023-03-22 00:39:06] [INFO ] Deduced a trap composed of 300 places in 345 ms of which 0 ms to minimize.
[2023-03-22 00:39:06] [INFO ] Deduced a trap composed of 304 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:39:07] [INFO ] Deduced a trap composed of 304 places in 341 ms of which 1 ms to minimize.
[2023-03-22 00:39:08] [INFO ] Deduced a trap composed of 290 places in 345 ms of which 1 ms to minimize.
[2023-03-22 00:39:08] [INFO ] Deduced a trap composed of 301 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:39:09] [INFO ] Deduced a trap composed of 308 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:39:09] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 1 ms to minimize.
[2023-03-22 00:39:10] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:39:10] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:39:11] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:39:11] [INFO ] Deduced a trap composed of 292 places in 314 ms of which 0 ms to minimize.
[2023-03-22 00:39:12] [INFO ] Deduced a trap composed of 296 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:39:13] [INFO ] Deduced a trap composed of 309 places in 335 ms of which 0 ms to minimize.
[2023-03-22 00:39:14] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 0 ms to minimize.
[2023-03-22 00:39:14] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:39:15] [INFO ] Deduced a trap composed of 309 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:39:17] [INFO ] Deduced a trap composed of 307 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:39:18] [INFO ] Deduced a trap composed of 311 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:39:18] [INFO ] Deduced a trap composed of 296 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:39:18] [INFO ] Deduced a trap composed of 292 places in 339 ms of which 0 ms to minimize.
[2023-03-22 00:39:19] [INFO ] Deduced a trap composed of 290 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:39:19] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:39:20] [INFO ] Deduced a trap composed of 294 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:39:20] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:39:20] [INFO ] Deduced a trap composed of 300 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:39:24] [INFO ] Deduced a trap composed of 296 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:39:24] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:39:26] [INFO ] Deduced a trap composed of 292 places in 348 ms of which 1 ms to minimize.
[2023-03-22 00:39:26] [INFO ] Deduced a trap composed of 292 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:39:27] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:39:27] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 0 ms to minimize.
[2023-03-22 00:39:30] [INFO ] Deduced a trap composed of 298 places in 339 ms of which 1 ms to minimize.
[2023-03-22 00:39:38] [INFO ] Deduced a trap composed of 288 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:39:38] [INFO ] Deduced a trap composed of 292 places in 339 ms of which 0 ms to minimize.
[2023-03-22 00:39:42] [INFO ] Deduced a trap composed of 300 places in 367 ms of which 1 ms to minimize.
[2023-03-22 00:39:46] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 0 ms to minimize.
[2023-03-22 00:39:55] [INFO ] Trap strengthening (SAT) tested/added 102/102 trap constraints in 85940 ms
[2023-03-22 00:39:55] [INFO ] After 86239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:39:55] [INFO ] After 86835ms 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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 36 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 43 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-22 00:39:55] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:39:55] [INFO ] Invariant cache hit.
[2023-03-22 00:39:56] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-22 00:39:56] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:39:56] [INFO ] Invariant cache hit.
[2023-03-22 00:39:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:40:00] [INFO ] Implicit Places using invariants and state equation in 3893 ms returned []
Implicit Place search using SMT with State Equation took 4788 ms to find 0 implicit places.
[2023-03-22 00:40:00] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-22 00:40:00] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:40:00] [INFO ] Invariant cache hit.
[2023-03-22 00:40:01] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5797 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7320 resets, run finished after 1109 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:40:02] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:40:02] [INFO ] Invariant cache hit.
[2023-03-22 00:40:02] [INFO ] [Real]Absence check using 95 positive place invariants in 63 ms returned sat
[2023-03-22 00:40:02] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-22 00:40:03] [INFO ] After 383ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:40:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:40:03] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:40:03] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:40:03] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:40:03] [INFO ] [Nat]Absence check using 95 positive place invariants in 19 ms returned sat
[2023-03-22 00:40:03] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:40:04] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:40:04] [INFO ] After 161ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:40:04] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:40:04] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:40:05] [INFO ] Deduced a trap composed of 298 places in 505 ms of which 1 ms to minimize.
[2023-03-22 00:40:05] [INFO ] Deduced a trap composed of 296 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:40:06] [INFO ] Deduced a trap composed of 294 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:40:06] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:40:06] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:40:07] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 1 ms to minimize.
[2023-03-22 00:40:07] [INFO ] Deduced a trap composed of 302 places in 335 ms of which 0 ms to minimize.
[2023-03-22 00:40:08] [INFO ] Deduced a trap composed of 310 places in 359 ms of which 0 ms to minimize.
[2023-03-22 00:40:08] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:40:08] [INFO ] Deduced a trap composed of 302 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:40:09] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:40:09] [INFO ] Deduced a trap composed of 296 places in 343 ms of which 1 ms to minimize.
[2023-03-22 00:40:10] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:40:10] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 1 ms to minimize.
[2023-03-22 00:40:10] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:40:11] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 0 ms to minimize.
[2023-03-22 00:40:11] [INFO ] Deduced a trap composed of 296 places in 359 ms of which 1 ms to minimize.
[2023-03-22 00:40:12] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 0 ms to minimize.
[2023-03-22 00:40:12] [INFO ] Deduced a trap composed of 296 places in 346 ms of which 0 ms to minimize.
[2023-03-22 00:40:13] [INFO ] Deduced a trap composed of 298 places in 354 ms of which 1 ms to minimize.
[2023-03-22 00:40:13] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:40:14] [INFO ] Deduced a trap composed of 298 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:40:14] [INFO ] Deduced a trap composed of 290 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:40:15] [INFO ] Deduced a trap composed of 302 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:40:15] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 0 ms to minimize.
[2023-03-22 00:40:15] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:40:16] [INFO ] Deduced a trap composed of 306 places in 338 ms of which 1 ms to minimize.
[2023-03-22 00:40:16] [INFO ] Deduced a trap composed of 296 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:40:17] [INFO ] Deduced a trap composed of 298 places in 356 ms of which 1 ms to minimize.
[2023-03-22 00:40:17] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:40:17] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:40:18] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 0 ms to minimize.
[2023-03-22 00:40:18] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:40:18] [INFO ] Deduced a trap composed of 296 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:40:19] [INFO ] Deduced a trap composed of 302 places in 355 ms of which 0 ms to minimize.
[2023-03-22 00:40:19] [INFO ] Deduced a trap composed of 308 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:40:20] [INFO ] Deduced a trap composed of 298 places in 344 ms of which 1 ms to minimize.
[2023-03-22 00:40:20] [INFO ] Deduced a trap composed of 294 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:40:20] [INFO ] Deduced a trap composed of 298 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:40:21] [INFO ] Deduced a trap composed of 308 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:40:24] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 0 ms to minimize.
[2023-03-22 00:40:24] [INFO ] Deduced a trap composed of 306 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:40:25] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:40:25] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 0 ms to minimize.
[2023-03-22 00:40:26] [INFO ] Deduced a trap composed of 304 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:40:27] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:40:28] [INFO ] Deduced a trap composed of 304 places in 318 ms of which 0 ms to minimize.
[2023-03-22 00:40:28] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:40:30] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 2 ms to minimize.
[2023-03-22 00:40:31] [INFO ] Deduced a trap composed of 308 places in 315 ms of which 1 ms to minimize.
[2023-03-22 00:40:36] [INFO ] Deduced a trap composed of 302 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:40:45] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 40967 ms
[2023-03-22 00:40:45] [INFO ] After 41227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:40:45] [INFO ] After 41740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72664 resets, run finished after 10195 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8340 resets, run finished after 1911 ms. (steps per millisecond=523 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4885034 steps, run timeout after 36001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 4885034 steps, saw 835986 distinct states, run finished after 36001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:41:33] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:41:33] [INFO ] Invariant cache hit.
[2023-03-22 00:41:33] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-22 00:41:33] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-22 00:41:33] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:41:33] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-22 00:41:33] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:41:34] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:41:34] [INFO ] After 300ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:41:34] [INFO ] Deduced a trap composed of 129 places in 357 ms of which 1 ms to minimize.
[2023-03-22 00:41:35] [INFO ] Deduced a trap composed of 311 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:41:35] [INFO ] Deduced a trap composed of 305 places in 338 ms of which 1 ms to minimize.
[2023-03-22 00:41:36] [INFO ] Deduced a trap composed of 290 places in 339 ms of which 0 ms to minimize.
[2023-03-22 00:41:36] [INFO ] Deduced a trap composed of 305 places in 339 ms of which 0 ms to minimize.
[2023-03-22 00:41:36] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:41:37] [INFO ] Deduced a trap composed of 307 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:41:37] [INFO ] Deduced a trap composed of 292 places in 353 ms of which 0 ms to minimize.
[2023-03-22 00:41:37] [INFO ] Deduced a trap composed of 307 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:41:38] [INFO ] Deduced a trap composed of 303 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:41:38] [INFO ] Deduced a trap composed of 294 places in 336 ms of which 1 ms to minimize.
[2023-03-22 00:41:39] [INFO ] Deduced a trap composed of 319 places in 332 ms of which 0 ms to minimize.
[2023-03-22 00:41:39] [INFO ] Deduced a trap composed of 309 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:41:39] [INFO ] Deduced a trap composed of 302 places in 351 ms of which 1 ms to minimize.
[2023-03-22 00:41:40] [INFO ] Deduced a trap composed of 316 places in 351 ms of which 2 ms to minimize.
[2023-03-22 00:41:40] [INFO ] Deduced a trap composed of 300 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:41:41] [INFO ] Deduced a trap composed of 305 places in 357 ms of which 1 ms to minimize.
[2023-03-22 00:41:41] [INFO ] Deduced a trap composed of 304 places in 326 ms of which 0 ms to minimize.
[2023-03-22 00:41:41] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 0 ms to minimize.
[2023-03-22 00:41:42] [INFO ] Deduced a trap composed of 309 places in 323 ms of which 0 ms to minimize.
[2023-03-22 00:41:44] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 5 ms to minimize.
[2023-03-22 00:41:44] [INFO ] Deduced a trap composed of 294 places in 321 ms of which 3 ms to minimize.
[2023-03-22 00:41:45] [INFO ] Deduced a trap composed of 300 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:41:45] [INFO ] Deduced a trap composed of 317 places in 345 ms of which 1 ms to minimize.
[2023-03-22 00:41:45] [INFO ] Deduced a trap composed of 296 places in 347 ms of which 1 ms to minimize.
[2023-03-22 00:41:46] [INFO ] Deduced a trap composed of 294 places in 345 ms of which 0 ms to minimize.
[2023-03-22 00:41:46] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 0 ms to minimize.
[2023-03-22 00:41:47] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:41:47] [INFO ] Deduced a trap composed of 292 places in 339 ms of which 1 ms to minimize.
[2023-03-22 00:41:48] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 0 ms to minimize.
[2023-03-22 00:41:48] [INFO ] Deduced a trap composed of 294 places in 355 ms of which 0 ms to minimize.
[2023-03-22 00:41:48] [INFO ] Deduced a trap composed of 302 places in 349 ms of which 1 ms to minimize.
[2023-03-22 00:41:49] [INFO ] Deduced a trap composed of 300 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:41:49] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:41:50] [INFO ] Deduced a trap composed of 304 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:41:50] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 0 ms to minimize.
[2023-03-22 00:41:51] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:41:51] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:41:51] [INFO ] Deduced a trap composed of 296 places in 317 ms of which 0 ms to minimize.
[2023-03-22 00:41:52] [INFO ] Deduced a trap composed of 306 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:41:53] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:41:53] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:41:53] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:41:54] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:41:54] [INFO ] Deduced a trap composed of 300 places in 320 ms of which 0 ms to minimize.
[2023-03-22 00:41:55] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:41:56] [INFO ] Deduced a trap composed of 304 places in 323 ms of which 0 ms to minimize.
[2023-03-22 00:41:56] [INFO ] Deduced a trap composed of 294 places in 339 ms of which 1 ms to minimize.
[2023-03-22 00:41:56] [INFO ] Deduced a trap composed of 298 places in 341 ms of which 1 ms to minimize.
[2023-03-22 00:41:57] [INFO ] Deduced a trap composed of 306 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:41:57] [INFO ] Deduced a trap composed of 296 places in 344 ms of which 1 ms to minimize.
[2023-03-22 00:41:58] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:41:58] [INFO ] Deduced a trap composed of 294 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:41:58] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 0 ms to minimize.
[2023-03-22 00:42:01] [INFO ] Deduced a trap composed of 300 places in 338 ms of which 1 ms to minimize.
[2023-03-22 00:42:02] [INFO ] Deduced a trap composed of 290 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:42:02] [INFO ] Deduced a trap composed of 298 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:42:03] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 0 ms to minimize.
[2023-03-22 00:42:03] [INFO ] Deduced a trap composed of 294 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:42:04] [INFO ] Deduced a trap composed of 292 places in 349 ms of which 0 ms to minimize.
[2023-03-22 00:42:04] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:42:04] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:42:05] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 0 ms to minimize.
[2023-03-22 00:42:06] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:42:07] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:42:07] [INFO ] Deduced a trap composed of 298 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:42:07] [INFO ] Deduced a trap composed of 304 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:42:08] [INFO ] Deduced a trap composed of 302 places in 360 ms of which 1 ms to minimize.
[2023-03-22 00:42:08] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 0 ms to minimize.
[2023-03-22 00:42:10] [INFO ] Deduced a trap composed of 304 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:42:12] [INFO ] Deduced a trap composed of 292 places in 405 ms of which 1 ms to minimize.
[2023-03-22 00:42:12] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:42:13] [INFO ] Deduced a trap composed of 306 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:42:13] [INFO ] Deduced a trap composed of 298 places in 339 ms of which 1 ms to minimize.
[2023-03-22 00:42:14] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:42:14] [INFO ] Deduced a trap composed of 298 places in 323 ms of which 0 ms to minimize.
[2023-03-22 00:42:15] [INFO ] Deduced a trap composed of 304 places in 330 ms of which 0 ms to minimize.
[2023-03-22 00:42:15] [INFO ] Deduced a trap composed of 304 places in 313 ms of which 5 ms to minimize.
[2023-03-22 00:42:15] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 0 ms to minimize.
[2023-03-22 00:42:17] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 1 ms to minimize.
[2023-03-22 00:42:18] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-22 00:42:27] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 52895 ms
[2023-03-22 00:42:27] [INFO ] After 53276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:42:27] [INFO ] After 53860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 37 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 37 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-22 00:42:27] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:42:27] [INFO ] Invariant cache hit.
[2023-03-22 00:42:28] [INFO ] Implicit Places using invariants in 965 ms returned []
[2023-03-22 00:42:28] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:42:28] [INFO ] Invariant cache hit.
[2023-03-22 00:42:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:42:32] [INFO ] Implicit Places using invariants and state equation in 3606 ms returned []
Implicit Place search using SMT with State Equation took 4586 ms to find 0 implicit places.
[2023-03-22 00:42:32] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 00:42:32] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:42:32] [INFO ] Invariant cache hit.
[2023-03-22 00:42:32] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5335 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7234 resets, run finished after 1021 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:42:33] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:42:33] [INFO ] Invariant cache hit.
[2023-03-22 00:42:33] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-22 00:42:33] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-22 00:42:34] [INFO ] After 483ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:42:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:42:34] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 00:42:34] [INFO ] After 156ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:42:34] [INFO ] After 764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:42:34] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2023-03-22 00:42:34] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:42:35] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:35] [INFO ] After 151ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:42:35] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:42:36] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:42:36] [INFO ] Deduced a trap composed of 298 places in 324 ms of which 0 ms to minimize.
[2023-03-22 00:42:36] [INFO ] Deduced a trap composed of 296 places in 324 ms of which 0 ms to minimize.
[2023-03-22 00:42:37] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 0 ms to minimize.
[2023-03-22 00:42:37] [INFO ] Deduced a trap composed of 302 places in 324 ms of which 0 ms to minimize.
[2023-03-22 00:42:37] [INFO ] Deduced a trap composed of 304 places in 341 ms of which 0 ms to minimize.
[2023-03-22 00:42:38] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:42:38] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:42:39] [INFO ] Deduced a trap composed of 310 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:42:39] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:42:39] [INFO ] Deduced a trap composed of 302 places in 314 ms of which 0 ms to minimize.
[2023-03-22 00:42:40] [INFO ] Deduced a trap composed of 298 places in 357 ms of which 1 ms to minimize.
[2023-03-22 00:42:40] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 0 ms to minimize.
[2023-03-22 00:42:41] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 0 ms to minimize.
[2023-03-22 00:42:41] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:42:41] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:42:42] [INFO ] Deduced a trap composed of 298 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:42:42] [INFO ] Deduced a trap composed of 296 places in 321 ms of which 0 ms to minimize.
[2023-03-22 00:42:43] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:42:43] [INFO ] Deduced a trap composed of 296 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:42:44] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 0 ms to minimize.
[2023-03-22 00:42:44] [INFO ] Deduced a trap composed of 298 places in 330 ms of which 0 ms to minimize.
[2023-03-22 00:42:44] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:42:45] [INFO ] Deduced a trap composed of 290 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:42:45] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:42:46] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:42:46] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:42:46] [INFO ] Deduced a trap composed of 306 places in 311 ms of which 0 ms to minimize.
[2023-03-22 00:42:47] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2023-03-22 00:42:47] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:42:48] [INFO ] Deduced a trap composed of 296 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:42:48] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:42:48] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-22 00:42:49] [INFO ] Deduced a trap composed of 298 places in 341 ms of which 0 ms to minimize.
[2023-03-22 00:42:49] [INFO ] Deduced a trap composed of 296 places in 352 ms of which 1 ms to minimize.
[2023-03-22 00:42:50] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:42:50] [INFO ] Deduced a trap composed of 308 places in 325 ms of which 0 ms to minimize.
[2023-03-22 00:42:50] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:42:51] [INFO ] Deduced a trap composed of 294 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:42:51] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:42:52] [INFO ] Deduced a trap composed of 308 places in 340 ms of which 1 ms to minimize.
[2023-03-22 00:42:55] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 0 ms to minimize.
[2023-03-22 00:42:55] [INFO ] Deduced a trap composed of 306 places in 332 ms of which 0 ms to minimize.
[2023-03-22 00:42:55] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:42:56] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:42:56] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 0 ms to minimize.
[2023-03-22 00:42:57] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:42:58] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 0 ms to minimize.
[2023-03-22 00:42:58] [INFO ] Deduced a trap composed of 296 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:43:00] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:43:01] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 0 ms to minimize.
[2023-03-22 00:43:06] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 0 ms to minimize.
[2023-03-22 00:43:15] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 40268 ms
[2023-03-22 00:43:15] [INFO ] After 40484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:43:15] [INFO ] After 41155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 738 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 398426 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398426 steps, saw 64123 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:43:18] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:43:18] [INFO ] Invariant cache hit.
[2023-03-22 00:43:19] [INFO ] [Real]Absence check using 95 positive place invariants in 19 ms returned sat
[2023-03-22 00:43:19] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-22 00:43:19] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:43:19] [INFO ] [Nat]Absence check using 95 positive place invariants in 19 ms returned sat
[2023-03-22 00:43:19] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-22 00:43:19] [INFO ] After 616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:43:20] [INFO ] After 288ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:20] [INFO ] Deduced a trap composed of 129 places in 368 ms of which 1 ms to minimize.
[2023-03-22 00:43:20] [INFO ] Deduced a trap composed of 299 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:43:21] [INFO ] Deduced a trap composed of 311 places in 373 ms of which 1 ms to minimize.
[2023-03-22 00:43:21] [INFO ] Deduced a trap composed of 309 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:43:22] [INFO ] Deduced a trap composed of 292 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:43:22] [INFO ] Deduced a trap composed of 306 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:43:23] [INFO ] Deduced a trap composed of 288 places in 340 ms of which 0 ms to minimize.
[2023-03-22 00:43:23] [INFO ] Deduced a trap composed of 292 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:43:24] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:43:24] [INFO ] Deduced a trap composed of 290 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:43:24] [INFO ] Deduced a trap composed of 302 places in 336 ms of which 0 ms to minimize.
[2023-03-22 00:43:25] [INFO ] Deduced a trap composed of 302 places in 321 ms of which 0 ms to minimize.
[2023-03-22 00:43:25] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 0 ms to minimize.
[2023-03-22 00:43:25] [INFO ] Deduced a trap composed of 298 places in 352 ms of which 1 ms to minimize.
[2023-03-22 00:43:26] [INFO ] Deduced a trap composed of 304 places in 336 ms of which 1 ms to minimize.
[2023-03-22 00:43:26] [INFO ] Deduced a trap composed of 290 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:43:27] [INFO ] Deduced a trap composed of 304 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:43:27] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 1 ms to minimize.
[2023-03-22 00:43:27] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:43:28] [INFO ] Deduced a trap composed of 300 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:43:28] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:43:29] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:43:29] [INFO ] Deduced a trap composed of 302 places in 324 ms of which 1 ms to minimize.
[2023-03-22 00:43:29] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:43:30] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 0 ms to minimize.
[2023-03-22 00:43:30] [INFO ] Deduced a trap composed of 296 places in 321 ms of which 0 ms to minimize.
[2023-03-22 00:43:31] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:43:31] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 0 ms to minimize.
[2023-03-22 00:43:31] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:43:32] [INFO ] Deduced a trap composed of 296 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:43:32] [INFO ] Deduced a trap composed of 302 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:43:33] [INFO ] Deduced a trap composed of 304 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:43:33] [INFO ] Deduced a trap composed of 300 places in 340 ms of which 1 ms to minimize.
[2023-03-22 00:43:34] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:43:34] [INFO ] Deduced a trap composed of 306 places in 312 ms of which 0 ms to minimize.
[2023-03-22 00:43:34] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:43:35] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 1 ms to minimize.
[2023-03-22 00:43:35] [INFO ] Deduced a trap composed of 302 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:43:36] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2023-03-22 00:43:36] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:43:36] [INFO ] Deduced a trap composed of 300 places in 348 ms of which 0 ms to minimize.
[2023-03-22 00:43:37] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:43:37] [INFO ] Deduced a trap composed of 294 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:43:38] [INFO ] Deduced a trap composed of 306 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:43:38] [INFO ] Deduced a trap composed of 307 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:43:40] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 1 ms to minimize.
[2023-03-22 00:43:44] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 23963 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:43:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:43:44] [INFO ] After 25020ms 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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 45 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-22 00:43:44] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:43:44] [INFO ] Invariant cache hit.
[2023-03-22 00:43:44] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 10000 steps, including 712 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 401460 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401460 steps, saw 64536 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:43:48] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:43:48] [INFO ] Invariant cache hit.
[2023-03-22 00:43:48] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-22 00:43:48] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-22 00:43:48] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:43:48] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2023-03-22 00:43:48] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 00:43:48] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:43:49] [INFO ] After 305ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:43:49] [INFO ] Deduced a trap composed of 129 places in 346 ms of which 1 ms to minimize.
[2023-03-22 00:43:49] [INFO ] Deduced a trap composed of 299 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:43:50] [INFO ] Deduced a trap composed of 311 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:43:50] [INFO ] Deduced a trap composed of 309 places in 328 ms of which 1 ms to minimize.
[2023-03-22 00:43:51] [INFO ] Deduced a trap composed of 292 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:43:51] [INFO ] Deduced a trap composed of 306 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:43:52] [INFO ] Deduced a trap composed of 288 places in 328 ms of which 0 ms to minimize.
[2023-03-22 00:43:52] [INFO ] Deduced a trap composed of 292 places in 311 ms of which 1 ms to minimize.
[2023-03-22 00:43:52] [INFO ] Deduced a trap composed of 298 places in 323 ms of which 0 ms to minimize.
[2023-03-22 00:43:53] [INFO ] Deduced a trap composed of 290 places in 330 ms of which 0 ms to minimize.
[2023-03-22 00:43:53] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 1 ms to minimize.
[2023-03-22 00:43:54] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 0 ms to minimize.
[2023-03-22 00:43:54] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 0 ms to minimize.
[2023-03-22 00:43:54] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 0 ms to minimize.
[2023-03-22 00:43:55] [INFO ] Deduced a trap composed of 304 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:43:55] [INFO ] Deduced a trap composed of 290 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:43:56] [INFO ] Deduced a trap composed of 304 places in 313 ms of which 0 ms to minimize.
[2023-03-22 00:43:56] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 0 ms to minimize.
[2023-03-22 00:43:56] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:43:57] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:43:57] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:43:57] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:43:58] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2023-03-22 00:43:58] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 0 ms to minimize.
[2023-03-22 00:43:59] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 0 ms to minimize.
[2023-03-22 00:43:59] [INFO ] Deduced a trap composed of 296 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:43:59] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:44:00] [INFO ] Deduced a trap composed of 298 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:44:00] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2023-03-22 00:44:01] [INFO ] Deduced a trap composed of 296 places in 333 ms of which 0 ms to minimize.
[2023-03-22 00:44:01] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 0 ms to minimize.
[2023-03-22 00:44:01] [INFO ] Deduced a trap composed of 304 places in 325 ms of which 0 ms to minimize.
[2023-03-22 00:44:02] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:44:02] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 1 ms to minimize.
[2023-03-22 00:44:03] [INFO ] Deduced a trap composed of 306 places in 331 ms of which 1 ms to minimize.
[2023-03-22 00:44:03] [INFO ] Deduced a trap composed of 296 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:44:03] [INFO ] Deduced a trap composed of 300 places in 336 ms of which 0 ms to minimize.
[2023-03-22 00:44:04] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:44:04] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:44:05] [INFO ] Deduced a trap composed of 296 places in 334 ms of which 1 ms to minimize.
[2023-03-22 00:44:05] [INFO ] Deduced a trap composed of 300 places in 330 ms of which 0 ms to minimize.
[2023-03-22 00:44:05] [INFO ] Deduced a trap composed of 300 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:44:06] [INFO ] Deduced a trap composed of 294 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:44:06] [INFO ] Deduced a trap composed of 306 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:44:07] [INFO ] Deduced a trap composed of 307 places in 341 ms of which 1 ms to minimize.
[2023-03-22 00:44:09] [INFO ] Deduced a trap composed of 302 places in 348 ms of which 0 ms to minimize.
[2023-03-22 00:44:13] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 24081 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:44:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:44:13] [INFO ] After 25012ms 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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 41 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 53 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-22 00:44:13] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:44:13] [INFO ] Invariant cache hit.
[2023-03-22 00:44:14] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-22 00:44:14] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:44:14] [INFO ] Invariant cache hit.
[2023-03-22 00:44:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:44:17] [INFO ] Implicit Places using invariants and state equation in 3783 ms returned []
Implicit Place search using SMT with State Equation took 4519 ms to find 0 implicit places.
[2023-03-22 00:44:17] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-22 00:44:17] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-22 00:44:17] [INFO ] Invariant cache hit.
[2023-03-22 00:44:18] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5408 ms. Remains : 750/750 places, 1521/1521 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 750 transition count 1512
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 750 transition count 1511
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 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 188 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-22 00:44:18] [INFO ] Computed 102 place invariants in 24 ms
[2023-03-22 00:44:19] [INFO ] [Real]Absence check using 95 positive place invariants in 30 ms returned sat
[2023-03-22 00:44:19] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-22 00:44:19] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:44:19] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2023-03-22 00:44:19] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:44:19] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:44:20] [INFO ] Deduced a trap composed of 292 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:44:20] [INFO ] Deduced a trap composed of 302 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:44:20] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:44:21] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:44:21] [INFO ] Deduced a trap composed of 288 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:44:21] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:44:22] [INFO ] Deduced a trap composed of 292 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:44:22] [INFO ] Deduced a trap composed of 300 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:44:22] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:44:23] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:44:23] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 0 ms to minimize.
[2023-03-22 00:44:23] [INFO ] Deduced a trap composed of 288 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:44:24] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 0 ms to minimize.
[2023-03-22 00:44:24] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:44:24] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:44:25] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:44:25] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:44:25] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:44:26] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:44:26] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:44:27] [INFO ] Deduced a trap composed of 294 places in 326 ms of which 1 ms to minimize.
[2023-03-22 00:44:27] [INFO ] Deduced a trap composed of 290 places in 310 ms of which 0 ms to minimize.
[2023-03-22 00:44:27] [INFO ] Deduced a trap composed of 288 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:44:28] [INFO ] Deduced a trap composed of 290 places in 329 ms of which 1 ms to minimize.
[2023-03-22 00:44:28] [INFO ] Deduced a trap composed of 306 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:44:28] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:44:29] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:44:29] [INFO ] Deduced a trap composed of 296 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:44:29] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:44:30] [INFO ] Deduced a trap composed of 300 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:44:30] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:44:30] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 306 places in 276 ms of which 0 ms to minimize.
[2023-03-22 00:44:31] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:44:32] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:44:32] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:44:32] [INFO ] Deduced a trap composed of 306 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:44:33] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:44:33] [INFO ] Deduced a trap composed of 296 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:44:34] [INFO ] Deduced a trap composed of 298 places in 317 ms of which 0 ms to minimize.
[2023-03-22 00:44:34] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:44:34] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:44:35] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:44:35] [INFO ] Deduced a trap composed of 292 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:44:35] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 0 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 296 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:44:36] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:44:37] [INFO ] Deduced a trap composed of 296 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:44:37] [INFO ] Deduced a trap composed of 298 places in 314 ms of which 0 ms to minimize.
[2023-03-22 00:44:37] [INFO ] Deduced a trap composed of 298 places in 318 ms of which 31 ms to minimize.
[2023-03-22 00:44:38] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:44:38] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:44:39] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:44:39] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:44:39] [INFO ] Deduced a trap composed of 292 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:44:40] [INFO ] Deduced a trap composed of 288 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:44:40] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 1 ms to minimize.
[2023-03-22 00:44:40] [INFO ] Deduced a trap composed of 304 places in 343 ms of which 0 ms to minimize.
[2023-03-22 00:44:41] [INFO ] Deduced a trap composed of 304 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:44:41] [INFO ] Deduced a trap composed of 302 places in 286 ms of which 0 ms to minimize.
[2023-03-22 00:44:41] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 0 ms to minimize.
[2023-03-22 00:44:42] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-22 00:44:42] [INFO ] Deduced a trap composed of 294 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:44:42] [INFO ] Deduced a trap composed of 300 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:44:43] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:44:45] [INFO ] Deduced a trap composed of 292 places in 284 ms of which 1 ms to minimize.
[2023-03-22 00:44:45] [INFO ] Deduced a trap composed of 292 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:44:46] [INFO ] Deduced a trap composed of 290 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:44:46] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 1 ms to minimize.
[2023-03-22 00:44:46] [INFO ] Deduced a trap composed of 298 places in 311 ms of which 1 ms to minimize.
[2023-03-22 00:44:47] [INFO ] Deduced a trap composed of 300 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:44:49] [INFO ] Deduced a trap composed of 304 places in 335 ms of which 1 ms to minimize.
[2023-03-22 00:44:49] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:44:50] [INFO ] Deduced a trap composed of 302 places in 323 ms of which 0 ms to minimize.
[2023-03-22 00:44:50] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:44:50] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:44:51] [INFO ] Deduced a trap composed of 300 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:44:51] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:44:51] [INFO ] Deduced a trap composed of 294 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:44:52] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:44:52] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:44:52] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:44:53] [INFO ] Deduced a trap composed of 298 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:44:53] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2023-03-22 00:44:54] [INFO ] Deduced a trap composed of 298 places in 283 ms of which 0 ms to minimize.
[2023-03-22 00:44:54] [INFO ] Deduced a trap composed of 312 places in 351 ms of which 0 ms to minimize.
[2023-03-22 00:44:54] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 0 ms to minimize.
[2023-03-22 00:44:56] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:44:56] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:44:56] [INFO ] Deduced a trap composed of 298 places in 323 ms of which 1 ms to minimize.
[2023-03-22 00:44:57] [INFO ] Deduced a trap composed of 296 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:44:58] [INFO ] Deduced a trap composed of 300 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:44:59] [INFO ] Deduced a trap composed of 294 places in 315 ms of which 1 ms to minimize.
[2023-03-22 00:44:59] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:45:00] [INFO ] Deduced a trap composed of 296 places in 277 ms of which 1 ms to minimize.
[2023-03-22 00:45:05] [INFO ] Deduced a trap composed of 290 places in 336 ms of which 0 ms to minimize.
[2023-03-22 00:45:05] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:45:06] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:45:06] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:45:07] [INFO ] Deduced a trap composed of 296 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:45:07] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:45:07] [INFO ] Deduced a trap composed of 304 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:45:08] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:45:08] [INFO ] Deduced a trap composed of 296 places in 325 ms of which 0 ms to minimize.
[2023-03-22 00:45:08] [INFO ] Deduced a trap composed of 286 places in 305 ms of which 0 ms to minimize.
[2023-03-22 00:45:09] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:45:11] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:45:12] [INFO ] Deduced a trap composed of 300 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:45:12] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:45:12] [INFO ] Deduced a trap composed of 292 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:45:13] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:45:14] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:45:15] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 0 ms to minimize.
[2023-03-22 00:45:15] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 0 ms to minimize.
[2023-03-22 00:45:16] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:45:16] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:45:16] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:45:17] [INFO ] Deduced a trap composed of 292 places in 346 ms of which 0 ms to minimize.
[2023-03-22 00:45:17] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:45:17] [INFO ] Deduced a trap composed of 304 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:45:18] [INFO ] Deduced a trap composed of 296 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:45:18] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:45:18] [INFO ] Deduced a trap composed of 294 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:45:19] [INFO ] Deduced a trap composed of 296 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:45:19] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 0 ms to minimize.
[2023-03-22 00:45:19] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:45:20] [INFO ] Deduced a trap composed of 292 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:45:20] [INFO ] Deduced a trap composed of 294 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:45:21] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:45:21] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:45:21] [INFO ] Deduced a trap composed of 288 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:45:22] [INFO ] Deduced a trap composed of 282 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:45:22] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:45:22] [INFO ] Deduced a trap composed of 304 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:45:23] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:45:23] [INFO ] Deduced a trap composed of 300 places in 282 ms of which 0 ms to minimize.
[2023-03-22 00:45:23] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:45:24] [INFO ] Deduced a trap composed of 294 places in 282 ms of which 1 ms to minimize.
[2023-03-22 00:48:04] [INFO ] Trap strengthening (SAT) tested/added 140/140 trap constraints in 224434 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 00:48:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:48:04] [INFO ] After 225015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
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 750 transition count 1512
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 750 transition count 1511
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 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 152 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:48:04] [INFO ] Invariant cache hit.
[2023-03-22 00:48:04] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-22 00:48:04] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-22 00:48:04] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:48:04] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2023-03-22 00:48:04] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-22 00:48:05] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:48:05] [INFO ] Deduced a trap composed of 294 places in 379 ms of which 0 ms to minimize.
[2023-03-22 00:48:06] [INFO ] Deduced a trap composed of 300 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:48:06] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 0 ms to minimize.
[2023-03-22 00:48:07] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:48:07] [INFO ] Deduced a trap composed of 300 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:48:07] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 1 ms to minimize.
[2023-03-22 00:48:08] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 1 ms to minimize.
[2023-03-22 00:48:08] [INFO ] Deduced a trap composed of 298 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:48:08] [INFO ] Deduced a trap composed of 306 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:48:09] [INFO ] Deduced a trap composed of 294 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:48:09] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 1 ms to minimize.
[2023-03-22 00:48:09] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:48:10] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:10] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:48:10] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:11] [INFO ] Deduced a trap composed of 306 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:48:11] [INFO ] Deduced a trap composed of 300 places in 317 ms of which 1 ms to minimize.
[2023-03-22 00:48:12] [INFO ] Deduced a trap composed of 292 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:48:12] [INFO ] Deduced a trap composed of 296 places in 291 ms of which 0 ms to minimize.
[2023-03-22 00:48:12] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 1 ms to minimize.
[2023-03-22 00:48:13] [INFO ] Deduced a trap composed of 288 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:13] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:48:13] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:14] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 0 ms to minimize.
[2023-03-22 00:48:14] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:48:14] [INFO ] Deduced a trap composed of 304 places in 342 ms of which 1 ms to minimize.
[2023-03-22 00:48:15] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:48:15] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:48:15] [INFO ] Deduced a trap composed of 298 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:48:16] [INFO ] Deduced a trap composed of 298 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:48:16] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 0 ms to minimize.
[2023-03-22 00:48:17] [INFO ] Deduced a trap composed of 296 places in 340 ms of which 0 ms to minimize.
[2023-03-22 00:48:17] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:48:17] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:48:18] [INFO ] Deduced a trap composed of 306 places in 281 ms of which 1 ms to minimize.
[2023-03-22 00:48:18] [INFO ] Deduced a trap composed of 304 places in 330 ms of which 1 ms to minimize.
[2023-03-22 00:48:18] [INFO ] Deduced a trap composed of 302 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:48:19] [INFO ] Deduced a trap composed of 296 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:48:19] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:48:19] [INFO ] Deduced a trap composed of 288 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:48:20] [INFO ] Deduced a trap composed of 292 places in 324 ms of which 0 ms to minimize.
[2023-03-22 00:48:20] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:48:20] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:48:21] [INFO ] Deduced a trap composed of 300 places in 283 ms of which 1 ms to minimize.
[2023-03-22 00:48:21] [INFO ] Deduced a trap composed of 300 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:48:21] [INFO ] Deduced a trap composed of 308 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:48:22] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:48:22] [INFO ] Deduced a trap composed of 302 places in 337 ms of which 1 ms to minimize.
[2023-03-22 00:48:23] [INFO ] Deduced a trap composed of 294 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:48:23] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:48:23] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:48:24] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:48:24] [INFO ] Deduced a trap composed of 290 places in 301 ms of which 0 ms to minimize.
[2023-03-22 00:48:24] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:48:25] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:48:25] [INFO ] Deduced a trap composed of 296 places in 289 ms of which 1 ms to minimize.
[2023-03-22 00:48:25] [INFO ] Deduced a trap composed of 306 places in 313 ms of which 1 ms to minimize.
[2023-03-22 00:48:26] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:48:28] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:48:28] [INFO ] Deduced a trap composed of 306 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:48:28] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:48:29] [INFO ] Deduced a trap composed of 294 places in 290 ms of which 1 ms to minimize.
[2023-03-22 00:48:29] [INFO ] Deduced a trap composed of 290 places in 306 ms of which 1 ms to minimize.
[2023-03-22 00:48:29] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:48:30] [INFO ] Deduced a trap composed of 306 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:48:30] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 0 ms to minimize.
[2023-03-22 00:48:30] [INFO ] Deduced a trap composed of 294 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:48:31] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:48:31] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 0 ms to minimize.
[2023-03-22 00:48:31] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:48:32] [INFO ] Deduced a trap composed of 302 places in 278 ms of which 1 ms to minimize.
[2023-03-22 00:48:32] [INFO ] Deduced a trap composed of 302 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:48:32] [INFO ] Deduced a trap composed of 298 places in 288 ms of which 1 ms to minimize.
[2023-03-22 00:48:33] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:34] [INFO ] Deduced a trap composed of 306 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:48:34] [INFO ] Deduced a trap composed of 306 places in 294 ms of which 0 ms to minimize.
[2023-03-22 00:48:39] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:39] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:48:40] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:48:40] [INFO ] Deduced a trap composed of 294 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:48:41] [INFO ] Deduced a trap composed of 298 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:48:41] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:48:41] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 0 ms to minimize.
[2023-03-22 00:48:42] [INFO ] Deduced a trap composed of 290 places in 307 ms of which 0 ms to minimize.
[2023-03-22 00:48:42] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:48:42] [INFO ] Deduced a trap composed of 298 places in 299 ms of which 0 ms to minimize.
[2023-03-22 00:48:43] [INFO ] Deduced a trap composed of 296 places in 295 ms of which 1 ms to minimize.
[2023-03-22 00:48:43] [INFO ] Deduced a trap composed of 306 places in 307 ms of which 1 ms to minimize.
[2023-03-22 00:48:43] [INFO ] Deduced a trap composed of 298 places in 285 ms of which 0 ms to minimize.
[2023-03-22 00:48:44] [INFO ] Deduced a trap composed of 294 places in 282 ms of which 1 ms to minimize.
[2023-03-22 00:48:46] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:48:47] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:48:48] [INFO ] Deduced a trap composed of 296 places in 270 ms of which 0 ms to minimize.
[2023-03-22 00:48:48] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:48:49] [INFO ] Deduced a trap composed of 288 places in 285 ms of which 1 ms to minimize.
[2023-03-22 00:48:49] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:48:49] [INFO ] Deduced a trap composed of 290 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:48:50] [INFO ] Deduced a trap composed of 296 places in 285 ms of which 1 ms to minimize.
[2023-03-22 00:48:50] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 0 ms to minimize.
[2023-03-22 00:48:50] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 1 ms to minimize.
[2023-03-22 00:48:51] [INFO ] Deduced a trap composed of 304 places in 284 ms of which 0 ms to minimize.
[2023-03-22 00:48:51] [INFO ] Deduced a trap composed of 294 places in 305 ms of which 1 ms to minimize.
[2023-03-22 00:48:52] [INFO ] Deduced a trap composed of 294 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:48:52] [INFO ] Deduced a trap composed of 288 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:48:52] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:48:53] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 1 ms to minimize.
[2023-03-22 00:48:53] [INFO ] Deduced a trap composed of 296 places in 314 ms of which 1 ms to minimize.
[2023-03-22 00:48:53] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 1 ms to minimize.
[2023-03-22 00:48:54] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:48:54] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 1 ms to minimize.
[2023-03-22 00:48:54] [INFO ] Deduced a trap composed of 302 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:48:55] [INFO ] Deduced a trap composed of 304 places in 302 ms of which 1 ms to minimize.
[2023-03-22 00:48:55] [INFO ] Deduced a trap composed of 312 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:55] [INFO ] Deduced a trap composed of 298 places in 306 ms of which 0 ms to minimize.
[2023-03-22 00:48:56] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:48:56] [INFO ] Deduced a trap composed of 306 places in 284 ms of which 1 ms to minimize.
[2023-03-22 00:48:56] [INFO ] Deduced a trap composed of 294 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:48:57] [INFO ] Deduced a trap composed of 300 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:48:57] [INFO ] Deduced a trap composed of 290 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:48:58] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:48:58] [INFO ] Deduced a trap composed of 296 places in 316 ms of which 1 ms to minimize.
[2023-03-22 00:48:58] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 0 ms to minimize.
[2023-03-22 00:48:59] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:48:59] [INFO ] Deduced a trap composed of 300 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:48:59] [INFO ] Deduced a trap composed of 306 places in 300 ms of which 0 ms to minimize.
[2023-03-22 00:49:00] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 0 ms to minimize.
[2023-03-22 00:49:00] [INFO ] Deduced a trap composed of 298 places in 304 ms of which 0 ms to minimize.
[2023-03-22 00:49:00] [INFO ] Deduced a trap composed of 298 places in 309 ms of which 0 ms to minimize.
[2023-03-22 00:49:01] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:49:01] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:49:01] [INFO ] Deduced a trap composed of 294 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:49:02] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-22 00:49:02] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:49:02] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:49:03] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 0 ms to minimize.
[2023-03-22 00:49:03] [INFO ] Deduced a trap composed of 292 places in 290 ms of which 0 ms to minimize.
[2023-03-22 00:49:04] [INFO ] Deduced a trap composed of 288 places in 301 ms of which 0 ms to minimize.
[2023-03-22 00:49:04] [INFO ] Deduced a trap composed of 296 places in 303 ms of which 1 ms to minimize.
[2023-03-22 00:49:04] [INFO ] Deduced a trap composed of 296 places in 299 ms of which 1 ms to minimize.
[2023-03-22 00:49:05] [INFO ] Deduced a trap composed of 300 places in 304 ms of which 1 ms to minimize.
[2023-03-22 00:49:05] [INFO ] Deduced a trap composed of 296 places in 308 ms of which 1 ms to minimize.
[2023-03-22 00:49:05] [INFO ] Deduced a trap composed of 298 places in 298 ms of which 1 ms to minimize.
[2023-03-22 00:49:06] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 1 ms to minimize.
[2023-03-22 00:49:06] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:49:06] [INFO ] Deduced a trap composed of 304 places in 293 ms of which 0 ms to minimize.
[2023-03-22 00:49:07] [INFO ] Deduced a trap composed of 292 places in 301 ms of which 0 ms to minimize.
[2023-03-22 00:49:07] [INFO ] Deduced a trap composed of 292 places in 294 ms of which 1 ms to minimize.
[2023-03-22 00:49:07] [INFO ] Deduced a trap composed of 300 places in 320 ms of which 1 ms to minimize.
[2023-03-22 00:49:08] [INFO ] Deduced a trap composed of 298 places in 289 ms of which 0 ms to minimize.
[2023-03-22 00:49:08] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 0 ms to minimize.
[2023-03-22 00:49:09] [INFO ] Deduced a trap composed of 302 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:49:09] [INFO ] Deduced a trap composed of 300 places in 310 ms of which 0 ms to minimize.
[2023-03-22 00:49:09] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 1 ms to minimize.
[2023-03-22 00:49:10] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:49:10] [INFO ] Deduced a trap composed of 296 places in 297 ms of which 1 ms to minimize.
[2023-03-22 00:49:12] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 0 ms to minimize.
[2023-03-22 00:49:12] [INFO ] Deduced a trap composed of 300 places in 293 ms of which 1 ms to minimize.
[2023-03-22 00:49:13] [INFO ] Deduced a trap composed of 296 places in 287 ms of which 1 ms to minimize.
[2023-03-22 00:49:13] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 0 ms to minimize.
[2023-03-22 00:49:22] [INFO ] Trap strengthening (SAT) tested/added 159/159 trap constraints in 77040 ms
[2023-03-22 00:49:22] [INFO ] After 78282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-22 00:49:22] [INFO ] After 78417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 787329 ms.
starting LoLA
BK_INPUT PolyORBNT-COL-S10J40
BK_EXAMINATION: QuasiLiveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: QuasiLiveness
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15154376 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16115752 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: TR BINDINGS
lola: TR BINDINGS DONE
lola: Places: 894, Transitions: 12380
lola: @ trans NoJob
lola: @ trans fi1
lola: @ trans fi3
lola: @ trans trans_689
lola: @ trans DummyOR1
lola: @ trans fo3
lola: @ trans fi2
lola: @ trans trans_457
lola: @ trans WillPerformWork
lola: @ trans trans_461
lola: @ trans MustCheck
lola: @ trans trans_508
lola: @ trans trans_509
lola: @ trans trans_534
lola: @ trans fo2
lola: @ trans LeaveCSTCS
lola: @ trans trans_478
lola: @ trans trans_459
lola: @ trans trans_533
lola: @ trans trans_510
lola: @ trans GoPerformWork
lola: @ trans Run
lola: @ trans trans_685
lola: @ trans GoCheckSource
lola: @ trans fo1
lola: @ trans trans_486
lola: @ trans trans_511
lola: @ trans JobExist
lola: @ trans NotifyEventEndOfCheckSources
lola: @ trans EnterCSTCS
lola: @ trans trans_489
lola: @ trans IsEvt
lola: @ trans trans_463
lola: @ trans trans_776
lola: @ trans trans_488
lola: @ trans trans_487
lola: @ trans DummyOR2
lola: @ trans trans_376
lola: STATE EQUATION TRIES TRANSITION t9685
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-QuasiLiveness-10522.sara.
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1187
lola: find path: 220
lola: goal oriented search: 13
lola: high level: 10960
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: reporting
lola: not produced: 1044
lola: find path: 220
lola: goal oriented search: 18
lola: high level: 11098
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1010 secs. Pages in use: 21

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-COL-S10J40, 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 r309-tall-167873963000432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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