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.r149-smll-167819435900302.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 DoubleExponent-PT-020, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r149-smll-167819435900302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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 1678375754928

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=DoubleExponent-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 15:29:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 15:29:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:29:18] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2023-03-09 15:29:18] [INFO ] Transformed 1064 places.
[2023-03-09 15:29:18] [INFO ] Transformed 998 transitions.
[2023-03-09 15:29:18] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 414 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1060 transition count 758
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 484 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 484 place count 820 transition count 718
Deduced a syphon composed of 40 places in 67 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 564 place count 780 transition count 718
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 19 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 932 place count 596 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 15 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1008 place count 558 transition count 534
Applied a total of 1008 rules in 298 ms. Remains 558 /1064 variables (removed 506) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 15:29:19] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 15:29:20] [INFO ] Implicit Places using invariants in 1218 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 15:29:20] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 15:29:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 15:29:51] [INFO ] Performed 305/558 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 15:30:18] [INFO ] Implicit Places using invariants and state equation in 58261 ms returned []
Implicit Place search using SMT with State Equation took 59551 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 15:30:18] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-09 15:30:19] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 558/1064 places, 534/998 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 60315 ms. Remains : 558/1064 places, 534/998 transitions.
Discarding 118 transitions out of 534. Remains 416
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1227 resets, run finished after 1072 ms. (steps per millisecond=9 ) properties (out of 415) seen :14
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 401) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 401) seen :0
Interrupted probabilistic random walk after 64602 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{0=1, 1=1, 4=1, 8=1, 9=1, 10=1, 11=1, 26=1, 89=1, 106=1, 127=1, 136=1, 140=1, 149=1, 173=1, 182=1, 206=1, 210=1, 216=1, 230=1, 239=1, 242=1, 255=1, 256=1, 307=1, 308=1, 317=1, 320=1, 327=1, 339=1, 348=1, 377=1, 378=1, 387=1, 388=1}
Probabilistic random walk after 64602 steps, saw 32311 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :35
Running SMT prover for 366 properties.
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 15:30:23] [INFO ] Invariants computation overflowed in 16 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.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-09 15:30:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:30:49] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 366 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1776 ms.
Support contains 494 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 534/534 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 558 transition count 529
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 553 transition count 529
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 553 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 552 transition count 528
Applied a total of 19 rules in 91 ms. Remains 552 /558 variables (removed 6) and now considering 528/534 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 552/558 places, 528/534 transitions.
Interrupted random walk after 490735 steps, including 63167 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 887 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 866 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 366) seen :0
Probably explored full state space saw : 657971 states, properties seen :7
Probabilistic random walk after 1315987 steps, saw 657971 distinct states, run finished after 50298 ms. (steps per millisecond=26 ) properties seen :7
Interrupted probabilistic random walk after 3668453 steps, run timeout after 150001 ms. (steps per millisecond=24 ) properties seen :{0=1, 1=1, 2=1, 3=1, 6=1, 10=1, 11=1, 12=1, 13=1, 229=1, 230=1, 293=1, 294=1, 295=1}
Exhaustive walk after 3668453 steps, saw 1834422 distinct states, run finished after 150001 ms. (steps per millisecond=24 ) properties seen :14
Running SMT prover for 345 properties.
// Phase 1: matrix 528 rows 552 cols
[2023-03-09 15:35:01] [INFO ] Computed 101 place invariants in 92 ms
[2023-03-09 15:35:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 15:35:07] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 78 ms returned sat
[2023-03-09 15:35:36] [INFO ] After 23159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :34 real:311
[2023-03-09 15:35:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 15:35:38] [INFO ] After 1879ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :31 real:314
[2023-03-09 15:35:39] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 13 ms to minimize.
[2023-03-09 15:35:39] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 1 ms to minimize.
[2023-03-09 15:35:39] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 2 ms to minimize.
[2023-03-09 15:35:39] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 3 ms to minimize.
[2023-03-09 15:35:40] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 5 ms to minimize.
[2023-03-09 15:35:40] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 0 ms to minimize.
[2023-03-09 15:35:40] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 1 ms to minimize.
[2023-03-09 15:35:40] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2023-03-09 15:35:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2026 ms
[2023-03-09 15:35:41] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:35:41] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 0 ms to minimize.
[2023-03-09 15:35:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2023-03-09 15:35:41] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2023-03-09 15:35:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-09 15:35:42] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 1 ms to minimize.
[2023-03-09 15:35:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-09 15:35:44] [INFO ] After 7847ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 15:35:44] [INFO ] After 43306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 15:35:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 15:35:50] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 76 ms returned sat
[2023-03-09 15:36:12] [INFO ] After 15477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-09 15:37:04] [INFO ] After 51981ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-09 15:37:04] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:37:04] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2023-03-09 15:37:05] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2023-03-09 15:37:05] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:37:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1077 ms
[2023-03-09 15:37:07] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 2 ms to minimize.
[2023-03-09 15:37:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2988 ms
[2023-03-09 15:37:12] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2023-03-09 15:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-09 15:37:15] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:37:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-09 15:37:15] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 1 ms to minimize.
[2023-03-09 15:37:16] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 1 ms to minimize.
[2023-03-09 15:37:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2023-03-09 15:37:19] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 1 ms to minimize.
[2023-03-09 15:37:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-09 15:37:22] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 0 ms to minimize.
[2023-03-09 15:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-09 15:37:22] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 1 ms to minimize.
[2023-03-09 15:37:22] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2023-03-09 15:37:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2023-03-09 15:37:24] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-09 15:37:25] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-09 15:37:25] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-09 15:37:26] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-09 15:37:27] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:37:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-09 15:37:28] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2023-03-09 15:37:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-09 15:37:29] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2023-03-09 15:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-09 15:37:30] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 1 ms to minimize.
[2023-03-09 15:37:30] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:37:31] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 2 ms to minimize.
[2023-03-09 15:37:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 646 ms
[2023-03-09 15:37:33] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 0 ms to minimize.
[2023-03-09 15:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-09 15:37:34] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 1 ms to minimize.
[2023-03-09 15:37:34] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 0 ms to minimize.
[2023-03-09 15:37:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-09 15:37:35] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2023-03-09 15:37:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-09 15:37:36] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2023-03-09 15:37:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-09 15:37:36] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:37:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-09 15:37:36] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2023-03-09 15:37:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-09 15:37:37] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-09 15:37:37] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2023-03-09 15:37:38] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 1 ms to minimize.
[2023-03-09 15:37:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 736 ms
[2023-03-09 15:37:39] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 0 ms to minimize.
[2023-03-09 15:37:39] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2023-03-09 15:37:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 508 ms
[2023-03-09 15:37:41] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2023-03-09 15:37:42] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:37:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-03-09 15:37:42] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2023-03-09 15:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-09 15:37:42] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
[2023-03-09 15:37:43] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2023-03-09 15:37:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-09 15:37:44] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 1 ms to minimize.
[2023-03-09 15:37:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 15:37:53] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 0 ms to minimize.
[2023-03-09 15:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-09 15:37:54] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 0 ms to minimize.
[2023-03-09 15:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-09 15:37:55] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2023-03-09 15:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-09 15:37:55] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 4 ms to minimize.
[2023-03-09 15:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-09 15:37:55] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 1 ms to minimize.
[2023-03-09 15:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-09 15:37:56] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2023-03-09 15:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-09 15:37:56] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2023-03-09 15:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-09 15:37:57] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:37:57] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:37:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2023-03-09 15:37:58] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 0 ms to minimize.
[2023-03-09 15:37:59] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2023-03-09 15:37:59] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2023-03-09 15:37:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2023-03-09 15:37:59] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 4 ms to minimize.
[2023-03-09 15:37:59] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2023-03-09 15:38:00] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 3 ms to minimize.
[2023-03-09 15:38:00] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2023-03-09 15:38:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 643 ms
[2023-03-09 15:38:01] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2023-03-09 15:38:01] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2023-03-09 15:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2023-03-09 15:38:01] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 0 ms to minimize.
[2023-03-09 15:38:01] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2023-03-09 15:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2023-03-09 15:38:01] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 0 ms to minimize.
[2023-03-09 15:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-09 15:38:02] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 0 ms to minimize.
[2023-03-09 15:38:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-09 15:38:03] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 0 ms to minimize.
[2023-03-09 15:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 15:38:03] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 0 ms to minimize.
[2023-03-09 15:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-09 15:38:04] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 0 ms to minimize.
[2023-03-09 15:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-09 15:38:04] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 1 ms to minimize.
[2023-03-09 15:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 15:38:05] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2023-03-09 15:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-09 15:39:02] [INFO ] After 170160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :345
Attempting to minimize the solution found.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
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.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-09 15:39:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:39:29] [INFO ] After 225030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:345
Parikh walk visited 0 properties in 30059 ms.
Support contains 466 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 528/528 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 552 transition count 524
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 548 transition count 524
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 548 transition count 524
Applied a total of 12 rules in 59 ms. Remains 548 /552 variables (removed 4) and now considering 524/528 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 548/552 places, 524/528 transitions.
Interrupted random walk after 525757 steps, including 67363 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Probably explored full state space saw : 590436 states, properties seen :0
Probabilistic random walk after 1180919 steps, saw 590436 distinct states, run finished after 42747 ms. (steps per millisecond=27 ) properties seen :0
Interrupted probabilistic random walk after 3817642 steps, run timeout after 147001 ms. (steps per millisecond=25 ) properties seen :{}
Exhaustive walk after 3817642 steps, saw 1909004 distinct states, run finished after 147006 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 345 properties.
// Phase 1: matrix 524 rows 548 cols
[2023-03-09 15:43:59] [INFO ] Computed 101 place invariants in 120 ms
[2023-03-09 15:44:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 15:44:03] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 60 ms returned sat
[2023-03-09 15:44:28] [INFO ] After 19879ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:343
[2023-03-09 15:44:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 15:44:28] [INFO ] After 777ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 15:44:28] [INFO ] After 29147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 15:44:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 15:44:33] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 74 ms returned sat
[2023-03-09 15:44:52] [INFO ] After 14626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-09 15:45:50] [INFO ] After 57453ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-09 15:45:50] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 1 ms to minimize.
[2023-03-09 15:45:51] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:45:51] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 1 ms to minimize.
[2023-03-09 15:45:51] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 1 ms to minimize.
[2023-03-09 15:45:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1564 ms
[2023-03-09 15:45:55] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:45:55] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2023-03-09 15:45:56] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 1 ms to minimize.
[2023-03-09 15:45:56] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:45:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1548 ms
[2023-03-09 15:45:57] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 1 ms to minimize.
[2023-03-09 15:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2023-03-09 15:45:58] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2023-03-09 15:45:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2023-03-09 15:46:01] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-09 15:46:02] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:46:03] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:46:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 807 ms
[2023-03-09 15:46:05] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:46:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-09 15:46:09] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:46:09] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:46:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2023-03-09 15:46:10] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-09 15:46:11] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2023-03-09 15:46:13] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 0 ms to minimize.
[2023-03-09 15:46:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-09 15:46:15] [INFO ] Deduced a trap composed of 34 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:46:16] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:46:16] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 1 ms to minimize.
[2023-03-09 15:46:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1067 ms
[2023-03-09 15:46:19] [INFO ] Deduced a trap composed of 28 places in 333 ms of which 1 ms to minimize.
[2023-03-09 15:46:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2023-03-09 15:46:26] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-09 15:46:27] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2023-03-09 15:46:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2215 ms
[2023-03-09 15:46:29] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 1 ms to minimize.
[2023-03-09 15:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-09 15:46:33] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:46:33] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 0 ms to minimize.
[2023-03-09 15:46:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2023-03-09 15:46:36] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 0 ms to minimize.
[2023-03-09 15:46:36] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 1 ms to minimize.
[2023-03-09 15:46:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 644 ms
[2023-03-09 15:46:37] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 1 ms to minimize.
[2023-03-09 15:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-09 15:46:39] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 0 ms to minimize.
[2023-03-09 15:46:39] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
[2023-03-09 15:46:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2023-03-09 15:46:39] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-09 15:46:40] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 1 ms to minimize.
[2023-03-09 15:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-09 15:46:42] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:46:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-09 15:46:43] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 3 ms to minimize.
[2023-03-09 15:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-09 15:46:44] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 1 ms to minimize.
[2023-03-09 15:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-09 15:46:45] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-09 15:46:46] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-09 15:46:47] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:46:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-09 15:46:49] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:46:49] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 1 ms to minimize.
[2023-03-09 15:46:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
[2023-03-09 15:46:50] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-09 15:46:52] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 1 ms to minimize.
[2023-03-09 15:46:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-09 15:46:53] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:46:53] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 0 ms to minimize.
[2023-03-09 15:46:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2023-03-09 15:46:54] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 1 ms to minimize.
[2023-03-09 15:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-09 15:46:55] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2023-03-09 15:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-09 15:46:56] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 1 ms to minimize.
[2023-03-09 15:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-09 15:46:56] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 0 ms to minimize.
[2023-03-09 15:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 15:46:57] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2023-03-09 15:46:57] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 0 ms to minimize.
[2023-03-09 15:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-09 15:46:58] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 0 ms to minimize.
[2023-03-09 15:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-09 15:46:59] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2023-03-09 15:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-09 15:46:59] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 0 ms to minimize.
[2023-03-09 15:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-09 15:47:00] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 1 ms to minimize.
[2023-03-09 15:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-09 15:47:01] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 1 ms to minimize.
[2023-03-09 15:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-09 15:47:01] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 1 ms to minimize.
[2023-03-09 15:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-09 15:47:02] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 0 ms to minimize.
[2023-03-09 15:47:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-09 15:47:02] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 1 ms to minimize.
[2023-03-09 15:47:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-09 15:47:08] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 3 ms to minimize.
[2023-03-09 15:47:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4432 ms
[2023-03-09 15:47:35] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 15:47:39] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2023-03-09 15:47:40] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 1 ms to minimize.
[2023-03-09 15:47:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 846 ms
[2023-03-09 15:47:52] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-09 15:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-09 15:48:10] [INFO ] After 198019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :345
Attempting to minimize the solution found.
Minimization took 3141 ms.
[2023-03-09 15:48:13] [INFO ] After 225012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :344
Parikh walk visited 0 properties in 30012 ms.
Support contains 466 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 524/524 transitions.
Applied a total of 0 rules in 19 ms. Remains 548 /548 variables (removed 0) and now considering 524/524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 548/548 places, 524/524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 524/524 transitions.
Applied a total of 0 rules in 15 ms. Remains 548 /548 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2023-03-09 15:48:44] [INFO ] Invariant cache hit.
[2023-03-09 15:48:44] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-09 15:48:44] [INFO ] Invariant cache hit.
[2023-03-09 15:48:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 15:48:45] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned [53, 177, 247, 449, 519]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1643 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 543/548 places, 524/524 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 543 transition count 522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 541 transition count 522
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 541 transition count 522
Applied a total of 5 rules in 40 ms. Remains 541 /543 variables (removed 2) and now considering 522/524 (removed 2) transitions.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:48:45] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 15:48:45] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:48:46] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-09 15:48:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 15:48:54] [INFO ] Implicit Places using invariants and state equation in 8490 ms returned []
Implicit Place search using SMT with State Equation took 8740 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 541/548 places, 522/524 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10441 ms. Remains : 541/548 places, 522/524 transitions.
Interrupted random walk after 549694 steps, including 79213 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 947 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 345) seen :0
Interrupted probabilistic random walk after 3745400 steps, run timeout after 138001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 3745400 steps, saw 1872551 distinct states, run finished after 138002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 345 properties.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:51:59] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 15:52:28] [INFO ] After 18345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:341
[2023-03-09 15:52:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 15:52:28] [INFO ] After 226ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 15:52:28] [INFO ] After 29679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-09 15:53:01] [INFO ] After 24975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-09 15:54:09] [INFO ] After 67455ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-09 15:54:10] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2023-03-09 15:54:10] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:54:10] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 0 ms to minimize.
[2023-03-09 15:54:11] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 2 ms to minimize.
[2023-03-09 15:54:11] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 1 ms to minimize.
[2023-03-09 15:54:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1710 ms
[2023-03-09 15:54:11] [INFO ] Deduced a trap composed of 18 places in 340 ms of which 1 ms to minimize.
[2023-03-09 15:54:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-09 15:54:14] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 0 ms to minimize.
[2023-03-09 15:54:15] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 1 ms to minimize.
[2023-03-09 15:54:15] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 1 ms to minimize.
[2023-03-09 15:54:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1041 ms
[2023-03-09 15:54:16] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 1 ms to minimize.
[2023-03-09 15:54:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-09 15:54:17] [INFO ] Deduced a trap composed of 16 places in 329 ms of which 1 ms to minimize.
[2023-03-09 15:54:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2023-03-09 15:54:19] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2023-03-09 15:54:19] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:54:19] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:54:20] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 1 ms to minimize.
[2023-03-09 15:54:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1221 ms
[2023-03-09 15:54:20] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2023-03-09 15:54:21] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 1 ms to minimize.
[2023-03-09 15:54:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 810 ms
[2023-03-09 15:54:22] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2023-03-09 15:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-09 15:54:24] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 0 ms to minimize.
[2023-03-09 15:54:24] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:54:24] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:54:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1050 ms
[2023-03-09 15:54:25] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-09 15:54:27] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 1 ms to minimize.
[2023-03-09 15:54:27] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 2 ms to minimize.
[2023-03-09 15:54:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 879 ms
[2023-03-09 15:54:28] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:54:28] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:54:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2023-03-09 15:54:29] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 2 ms to minimize.
[2023-03-09 15:54:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-09 15:54:31] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:54:31] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 1 ms to minimize.
[2023-03-09 15:54:31] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 1 ms to minimize.
[2023-03-09 15:54:32] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:54:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1339 ms
[2023-03-09 15:54:33] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-09 15:54:34] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 1 ms to minimize.
[2023-03-09 15:54:34] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 1 ms to minimize.
[2023-03-09 15:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 635 ms
[2023-03-09 15:54:35] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 1 ms to minimize.
[2023-03-09 15:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2023-03-09 15:54:37] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 1 ms to minimize.
[2023-03-09 15:54:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5986 ms
[2023-03-09 15:54:46] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 1 ms to minimize.
[2023-03-09 15:54:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-09 15:54:48] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 1 ms to minimize.
[2023-03-09 15:54:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-09 15:54:51] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 0 ms to minimize.
[2023-03-09 15:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-09 15:54:52] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2023-03-09 15:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-09 15:54:53] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 1 ms to minimize.
[2023-03-09 15:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-09 15:54:54] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 1 ms to minimize.
[2023-03-09 15:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-09 15:54:54] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 0 ms to minimize.
[2023-03-09 15:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-09 15:54:57] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-09 15:54:58] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 0 ms to minimize.
[2023-03-09 15:54:58] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 1 ms to minimize.
[2023-03-09 15:54:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2023-03-09 15:55:00] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:55:00] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 0 ms to minimize.
[2023-03-09 15:55:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2023-03-09 15:55:01] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:55:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-09 15:55:03] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 1 ms to minimize.
[2023-03-09 15:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-09 15:55:03] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 1 ms to minimize.
[2023-03-09 15:55:03] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 0 ms to minimize.
[2023-03-09 15:55:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2023-03-09 15:55:05] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 0 ms to minimize.
[2023-03-09 15:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-09 15:55:06] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 1 ms to minimize.
[2023-03-09 15:55:06] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 1 ms to minimize.
[2023-03-09 15:55:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 447 ms
[2023-03-09 15:55:07] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 0 ms to minimize.
[2023-03-09 15:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-09 15:55:08] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 0 ms to minimize.
[2023-03-09 15:55:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 15:55:08] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 0 ms to minimize.
[2023-03-09 15:55:08] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2023-03-09 15:55:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2023-03-09 15:55:08] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 0 ms to minimize.
[2023-03-09 15:55:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 15:55:09] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 0 ms to minimize.
[2023-03-09 15:55:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 15:55:10] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 0 ms to minimize.
[2023-03-09 15:55:10] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 0 ms to minimize.
[2023-03-09 15:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-09 15:55:10] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 0 ms to minimize.
[2023-03-09 15:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-09 15:55:11] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2023-03-09 15:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 15:56:13] [INFO ] After 192176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :344
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 15:56:13] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :344
Parikh walk visited 0 properties in 30016 ms.
Support contains 466 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 522/522 transitions.
Applied a total of 0 rules in 13 ms. Remains 541 /541 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 541/541 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 522/522 transitions.
Applied a total of 0 rules in 11 ms. Remains 541 /541 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:56:44] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 15:56:44] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:56:44] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 15:56:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 15:56:51] [INFO ] Implicit Places using invariants and state equation in 7200 ms returned []
Implicit Place search using SMT with State Equation took 7388 ms to find 0 implicit places.
[2023-03-09 15:56:51] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:56:51] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 15:56:51] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7823 ms. Remains : 541/541 places, 522/522 transitions.
Incomplete random walk after 100000 steps, including 14407 resets, run finished after 6184 ms. (steps per millisecond=16 ) properties (out of 466) seen :0
Running SMT prover for 466 properties.
// Phase 1: matrix 522 rows 541 cols
[2023-03-09 15:56:58] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 15:57:04] [INFO ] After 5430ms SMT Verify possible using state equation in real domain returned unsat :0 sat :466
[2023-03-09 15:57:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-09 15:57:18] [INFO ] After 13969ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :466
[2023-03-09 15:57:18] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:57:18] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:57:18] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 0 ms to minimize.
[2023-03-09 15:57:19] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2023-03-09 15:57:19] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:57:19] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 1 ms to minimize.
[2023-03-09 15:57:19] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:57:20] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 2 ms to minimize.
[2023-03-09 15:57:20] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 0 ms to minimize.
[2023-03-09 15:57:20] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 0 ms to minimize.
[2023-03-09 15:57:20] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 0 ms to minimize.
[2023-03-09 15:57:21] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 0 ms to minimize.
[2023-03-09 15:57:21] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 0 ms to minimize.
[2023-03-09 15:57:21] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:57:21] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3246 ms
[2023-03-09 15:57:23] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2023-03-09 15:57:25] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 0 ms to minimize.
[2023-03-09 15:57:25] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:57:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2023-03-09 15:57:26] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:57:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-09 15:57:32] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 3 ms to minimize.
[2023-03-09 15:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-09 15:57:36] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-09 15:57:37] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 1 ms to minimize.
[2023-03-09 15:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2023-03-09 15:57:38] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 1 ms to minimize.
[2023-03-09 15:57:38] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2023-03-09 15:57:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2023-03-09 15:57:39] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 1 ms to minimize.
[2023-03-09 15:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-09 15:57:40] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-09 15:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-09 15:57:41] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2023-03-09 15:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-09 15:57:42] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:57:43] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:57:43] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:57:43] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:57:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1090 ms
[2023-03-09 15:57:44] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 1 ms to minimize.
[2023-03-09 15:57:44] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:57:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-03-09 15:57:44] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-09 15:57:45] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-09 15:57:46] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2023-03-09 15:57:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-09 15:57:53] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 4 ms to minimize.
[2023-03-09 15:57:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-09 15:57:54] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-09 15:57:54] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 0 ms to minimize.
[2023-03-09 15:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-09 15:57:55] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 0 ms to minimize.
[2023-03-09 15:57:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-09 15:57:56] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 0 ms to minimize.
[2023-03-09 15:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-09 15:57:56] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 0 ms to minimize.
[2023-03-09 15:57:56] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 1 ms to minimize.
[2023-03-09 15:57:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-09 15:57:58] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 1 ms to minimize.
[2023-03-09 15:57:58] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 1 ms to minimize.
[2023-03-09 15:57:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2023-03-09 15:57:59] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 0 ms to minimize.
[2023-03-09 15:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-09 15:58:00] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 0 ms to minimize.
[2023-03-09 15:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-09 15:58:00] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 1 ms to minimize.
[2023-03-09 15:58:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-09 15:58:02] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-09 15:58:03] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2023-03-09 15:58:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-09 15:58:07] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2023-03-09 15:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-09 15:58:09] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2023-03-09 15:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-09 15:58:11] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2023-03-09 15:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-09 15:58:12] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-09 15:58:16] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2023-03-09 15:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-09 15:58:18] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:58:18] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:58:18] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:58:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-03-09 15:58:26] [INFO ] After 82316ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:466
[2023-03-09 15:58:26] [INFO ] After 88347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:466
[2023-03-09 15:58:33] [INFO ] After 6015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :466
[2023-03-09 15:58:55] [INFO ] After 22887ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :466
[2023-03-09 15:58:56] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:58:56] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:58:56] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:58:57] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-09 15:58:57] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:58:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1426 ms
[2023-03-09 15:58:57] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 0 ms to minimize.
[2023-03-09 15:58:57] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:58:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1237 ms
[2023-03-09 15:58:59] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-09 15:59:00] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-09 15:59:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-03-09 15:59:01] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-09 15:59:02] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:59:02] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:59:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
[2023-03-09 15:59:03] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2023-03-09 15:59:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-09 15:59:04] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-09 15:59:05] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 1 ms to minimize.
[2023-03-09 15:59:05] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2023-03-09 15:59:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-09 15:59:05] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 1 ms to minimize.
[2023-03-09 15:59:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-09 15:59:06] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2023-03-09 15:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-09 15:59:06] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 1 ms to minimize.
[2023-03-09 15:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-03-09 15:59:07] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 0 ms to minimize.
[2023-03-09 15:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-09 15:59:08] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-09 15:59:08] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2023-03-09 15:59:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-09 15:59:08] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-09 15:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 15:59:10] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-09 15:59:10] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2023-03-09 15:59:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-03-09 15:59:12] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 1 ms to minimize.
[2023-03-09 15:59:12] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 1 ms to minimize.
[2023-03-09 15:59:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2023-03-09 15:59:12] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2023-03-09 15:59:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-09 15:59:13] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2023-03-09 15:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-09 15:59:14] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 1 ms to minimize.
[2023-03-09 15:59:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13512716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16128404 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

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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r149-smll-167819435900302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 ;