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.r153-smll-167819440300302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DoubleExponent-PT-020, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-smll-167819440300302
=====================================================================

--------------------
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 1678406282094

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 23:58:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 23:58:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:58:06] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-09 23:58:06] [INFO ] Transformed 1064 places.
[2023-03-09 23:58:06] [INFO ] Transformed 998 transitions.
[2023-03-09 23:58:06] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 436 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 80 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 14 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 331 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 23:58:06] [INFO ] Invariants computation overflowed in 92 ms
[2023-03-09 23:58:07] [INFO ] Implicit Places using invariants in 1430 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2023-03-09 23:58:08] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 23:58:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 23:58:38] [INFO ] Performed 322/558 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-09 23:59:05] [INFO ] Implicit Places using invariants and state equation in 57605 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 59111 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 557/1064 places, 534/998 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 555 transition count 532
Applied a total of 4 rules in 23 ms. Remains 555 /557 variables (removed 2) and now considering 532/534 (removed 2) transitions.
// Phase 1: matrix 532 rows 555 cols
[2023-03-09 23:59:05] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 23:59:06] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 532 rows 555 cols
[2023-03-09 23:59:06] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-09 23:59:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 23:59:24] [INFO ] Implicit Places using invariants and state equation in 18520 ms returned []
Implicit Place search using SMT with State Equation took 18966 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 555/1064 places, 532/998 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 78434 ms. Remains : 555/1064 places, 532/998 transitions.
Discarding 118 transitions out of 532. Remains 414
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1209 resets, run finished after 983 ms. (steps per millisecond=10 ) properties (out of 413) seen :14
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) 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 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 399) 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 399) 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 399) 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 399) 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 399) 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 399) 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 399) 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 399) 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 399) 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 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 399) 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 399) seen :0
Interrupted probabilistic random walk after 60298 steps, run timeout after 3001 ms. (steps per millisecond=20 ) 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, 237=1, 239=1, 251=1, 252=1, 303=1, 304=1, 313=1, 316=1, 323=1, 335=1, 344=1, 373=1, 374=1, 383=1, 384=1}
Probabilistic random walk after 60298 steps, saw 30155 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :35
Running SMT prover for 364 properties.
// Phase 1: matrix 532 rows 555 cols
[2023-03-09 23:59:28] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-09 23:59:54] [INFO ] After 16124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :123 real:240
[2023-03-09 23:59:54] [INFO ] State equation strengthened by 40 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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 23:59:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 23:59:54] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 364 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1255 ms.
Support contains 491 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 532/532 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 555 transition count 527
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 550 transition count 527
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 550 transition count 527
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 549 transition count 526
Applied a total of 19 rules in 107 ms. Remains 549 /555 variables (removed 6) and now considering 526/532 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 549/555 places, 526/532 transitions.
Interrupted random walk after 464735 steps, including 59554 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Interrupted probabilistic random walk after 3602225 steps, run timeout after 150001 ms. (steps per millisecond=24 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 10=1, 14=1, 15=1, 16=1, 17=1, 229=1, 230=1, 231=1, 232=1, 295=1, 296=1, 297=1, 298=1}
Probabilistic random walk after 3602225 steps, saw 1801114 distinct states, run finished after 150002 ms. (steps per millisecond=24 ) properties seen :21
Running SMT prover for 343 properties.
// Phase 1: matrix 526 rows 549 cols
[2023-03-10 00:03:16] [INFO ] Computed 100 place invariants in 85 ms
[2023-03-10 00:03:22] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 00:03:22] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 86 ms returned sat
[2023-03-10 00:03:53] [INFO ] After 24879ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:340
[2023-03-10 00:03:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 00:03:54] [INFO ] After 196ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 00:03:54] [INFO ] After 37562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 00:03:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 00:03:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 98 ms returned sat
[2023-03-10 00:04:27] [INFO ] After 21728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :343
[2023-03-10 00:05:19] [INFO ] After 51320ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :343
[2023-03-10 00:05:19] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 9 ms to minimize.
[2023-03-10 00:05:19] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 2 ms to minimize.
[2023-03-10 00:05:20] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-10 00:05:20] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2023-03-10 00:05:20] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2023-03-10 00:05:20] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-10 00:05:21] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2023-03-10 00:05:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1904 ms
[2023-03-10 00:05:22] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2023-03-10 00:05:22] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2023-03-10 00:05:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2023-03-10 00:05:23] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-10 00:05:23] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
[2023-03-10 00:05:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 501 ms
[2023-03-10 00:05:24] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2023-03-10 00:05:25] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2023-03-10 00:05:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1470 ms
[2023-03-10 00:05:27] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2023-03-10 00:05:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 709 ms
[2023-03-10 00:05:30] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 1 ms to minimize.
[2023-03-10 00:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-10 00:05:32] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-10 00:05:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-10 00:05:33] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-10 00:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-10 00:05:33] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-10 00:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-10 00:05:34] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2023-03-10 00:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-10 00:05:34] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 1 ms to minimize.
[2023-03-10 00:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-10 00:05:36] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2023-03-10 00:05:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-10 00:05:40] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 2 ms to minimize.
[2023-03-10 00:05:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2023-03-10 00:05:41] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 1 ms to minimize.
[2023-03-10 00:05:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2023-03-10 00:05:42] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 1 ms to minimize.
[2023-03-10 00:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-10 00:05:42] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-10 00:05:43] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-10 00:05:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 539 ms
[2023-03-10 00:05:46] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 1 ms to minimize.
[2023-03-10 00:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-10 00:05:46] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2023-03-10 00:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-10 00:05:48] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2023-03-10 00:05:48] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 0 ms to minimize.
[2023-03-10 00:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-03-10 00:05:49] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2023-03-10 00:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-10 00:05:50] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 0 ms to minimize.
[2023-03-10 00:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-10 00:05:50] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2023-03-10 00:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-10 00:05:50] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 1 ms to minimize.
[2023-03-10 00:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-10 00:05:51] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2023-03-10 00:05:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-10 00:05:52] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2023-03-10 00:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-10 00:05:54] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 1 ms to minimize.
[2023-03-10 00:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-10 00:05:54] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2023-03-10 00:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-10 00:05:55] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 0 ms to minimize.
[2023-03-10 00:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-10 00:05:55] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2023-03-10 00:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-10 00:05:55] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 1 ms to minimize.
[2023-03-10 00:05:56] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 1 ms to minimize.
[2023-03-10 00:05:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2023-03-10 00:06:10] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2023-03-10 00:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-10 00:06:10] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 1 ms to minimize.
[2023-03-10 00:06:11] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 0 ms to minimize.
[2023-03-10 00:06:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-10 00:06:11] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2023-03-10 00:06:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-10 00:06:12] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 0 ms to minimize.
[2023-03-10 00:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-10 00:06:13] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 0 ms to minimize.
[2023-03-10 00:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-10 00:06:13] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2023-03-10 00:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-10 00:06:14] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 0 ms to minimize.
[2023-03-10 00:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-10 00:06:14] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2023-03-10 00:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-10 00:06:15] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 0 ms to minimize.
[2023-03-10 00:06:15] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 0 ms to minimize.
[2023-03-10 00:06:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-03-10 00:06:15] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 1 ms to minimize.
[2023-03-10 00:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-10 00:06:16] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2023-03-10 00:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-10 00:06:16] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 0 ms to minimize.
[2023-03-10 00:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-10 00:06:17] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2023-03-10 00:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-10 00:06:17] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2023-03-10 00:06:17] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 0 ms to minimize.
[2023-03-10 00:06:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-10 00:06:18] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2023-03-10 00:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-10 00:06:34] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-10 00:06:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-10 00:06:37] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 1 ms to minimize.
[2023-03-10 00:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-10 00:06:38] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2023-03-10 00:06:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-10 00:07:21] [INFO ] After 173596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :342
Attempting to minimize the solution found.
Minimization took 17691 ms.
[2023-03-10 00:07:39] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :341
Parikh walk visited 0 properties in 30002 ms.
Support contains 463 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 526/526 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 549 transition count 522
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 545 transition count 522
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 545 transition count 522
Applied a total of 12 rules in 61 ms. Remains 545 /549 variables (removed 4) and now considering 522/526 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 545/549 places, 522/526 transitions.
Interrupted random walk after 474078 steps, including 60956 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) 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 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Probably explored full state space saw : 912221 states, properties seen :0
Probabilistic random walk after 1824538 steps, saw 912221 distinct states, run finished after 73016 ms. (steps per millisecond=24 ) properties seen :0
Interrupted probabilistic random walk after 3583100 steps, run timeout after 150001 ms. (steps per millisecond=23 ) properties seen :{}
Exhaustive walk after 3583100 steps, saw 1791730 distinct states, run finished after 150004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 343 properties.
// Phase 1: matrix 522 rows 545 cols
[2023-03-10 00:12:43] [INFO ] Computed 100 place invariants in 122 ms
[2023-03-10 00:12:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 00:12:47] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 67 ms returned sat
[2023-03-10 00:13:08] [INFO ] After 16875ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:330
[2023-03-10 00:13:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 00:13:08] [INFO ] After 457ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :13 real:330
[2023-03-10 00:13:08] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 2 ms to minimize.
[2023-03-10 00:13:09] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2023-03-10 00:13:09] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2023-03-10 00:13:09] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2023-03-10 00:13:09] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2023-03-10 00:13:09] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2023-03-10 00:13:09] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 0 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1498 ms
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 0 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 0 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 0 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 0 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2023-03-10 00:13:10] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2023-03-10 00:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-10 00:13:11] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 0 ms to minimize.
[2023-03-10 00:13:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-10 00:13:11] [INFO ] After 3541ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 00:13:11] [INFO ] After 28335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 00:13:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 00:13:15] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 70 ms returned sat
[2023-03-10 00:13:48] [INFO ] After 26079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :343
[2023-03-10 00:14:51] [INFO ] After 63458ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :343
[2023-03-10 00:14:51] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 2 ms to minimize.
[2023-03-10 00:14:52] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2023-03-10 00:14:52] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 1 ms to minimize.
[2023-03-10 00:14:52] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 0 ms to minimize.
[2023-03-10 00:14:53] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 2 ms to minimize.
[2023-03-10 00:14:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1550 ms
[2023-03-10 00:14:56] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2023-03-10 00:14:56] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 1 ms to minimize.
[2023-03-10 00:14:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 570 ms
[2023-03-10 00:14:57] [INFO ] Deduced a trap composed of 20 places in 341 ms of which 1 ms to minimize.
[2023-03-10 00:14:58] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2023-03-10 00:14:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 851 ms
[2023-03-10 00:14:58] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 1 ms to minimize.
[2023-03-10 00:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-10 00:15:00] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2023-03-10 00:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-10 00:15:01] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-10 00:15:01] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 0 ms to minimize.
[2023-03-10 00:15:02] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2023-03-10 00:15:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 816 ms
[2023-03-10 00:15:06] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 1 ms to minimize.
[2023-03-10 00:15:09] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2023-03-10 00:15:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3038 ms
[2023-03-10 00:15:15] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 2 ms to minimize.
[2023-03-10 00:15:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-10 00:15:16] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 1 ms to minimize.
[2023-03-10 00:15:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2023-03-10 00:15:18] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 2 ms to minimize.
[2023-03-10 00:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-10 00:15:18] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 1 ms to minimize.
[2023-03-10 00:15:19] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 0 ms to minimize.
[2023-03-10 00:15:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2023-03-10 00:15:20] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 1 ms to minimize.
[2023-03-10 00:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-10 00:15:22] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 1 ms to minimize.
[2023-03-10 00:15:23] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 0 ms to minimize.
[2023-03-10 00:15:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 658 ms
[2023-03-10 00:15:23] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 1 ms to minimize.
[2023-03-10 00:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2023-03-10 00:15:25] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2023-03-10 00:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2023-03-10 00:15:28] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-10 00:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2023-03-10 00:15:28] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2023-03-10 00:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-10 00:15:29] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 1 ms to minimize.
[2023-03-10 00:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-10 00:15:31] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 1 ms to minimize.
[2023-03-10 00:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-10 00:15:32] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 1 ms to minimize.
[2023-03-10 00:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-10 00:15:33] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 1 ms to minimize.
[2023-03-10 00:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-10 00:15:34] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2023-03-10 00:15:35] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 1 ms to minimize.
[2023-03-10 00:15:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 594 ms
[2023-03-10 00:15:35] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
[2023-03-10 00:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-10 00:15:36] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 0 ms to minimize.
[2023-03-10 00:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-10 00:15:38] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 1 ms to minimize.
[2023-03-10 00:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-10 00:15:38] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 1 ms to minimize.
[2023-03-10 00:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-10 00:15:39] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 1 ms to minimize.
[2023-03-10 00:15:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-10 00:15:41] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 1 ms to minimize.
[2023-03-10 00:15:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-10 00:15:41] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 1 ms to minimize.
[2023-03-10 00:15:42] [INFO ] Deduced a trap composed of 60 places in 162 ms of which 1 ms to minimize.
[2023-03-10 00:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2023-03-10 00:15:42] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 1 ms to minimize.
[2023-03-10 00:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-10 00:15:44] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 2 ms to minimize.
[2023-03-10 00:15:44] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-10 00:15:45] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 0 ms to minimize.
[2023-03-10 00:15:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1079 ms
[2023-03-10 00:15:45] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 1 ms to minimize.
[2023-03-10 00:15:45] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 1 ms to minimize.
[2023-03-10 00:15:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2023-03-10 00:15:47] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 1 ms to minimize.
[2023-03-10 00:15:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-10 00:15:52] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2023-03-10 00:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-10 00:15:53] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2023-03-10 00:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-10 00:15:54] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2023-03-10 00:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-10 00:15:55] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 0 ms to minimize.
[2023-03-10 00:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-10 00:15:55] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 0 ms to minimize.
[2023-03-10 00:15:56] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 0 ms to minimize.
[2023-03-10 00:15:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 808 ms
[2023-03-10 00:15:56] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 1 ms to minimize.
[2023-03-10 00:15:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-10 00:15:57] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 1 ms to minimize.
[2023-03-10 00:15:57] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 0 ms to minimize.
[2023-03-10 00:15:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2023-03-10 00:15:58] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 0 ms to minimize.
[2023-03-10 00:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-10 00:15:59] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 0 ms to minimize.
[2023-03-10 00:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-10 00:16:48] [INFO ] After 180448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :343
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-10 00:16:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 00:16:56] [INFO ] After 225041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:343
Parikh walk visited 0 properties in 30015 ms.
Support contains 463 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 522/522 transitions.
Applied a total of 0 rules in 16 ms. Remains 545 /545 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 545/545 places, 522/522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 522/522 transitions.
Applied a total of 0 rules in 15 ms. Remains 545 /545 variables (removed 0) and now considering 522/522 (removed 0) transitions.
[2023-03-10 00:17:26] [INFO ] Invariant cache hit.
[2023-03-10 00:17:27] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-10 00:17:27] [INFO ] Invariant cache hit.
[2023-03-10 00:17:27] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 00:17:28] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned [50, 174, 244, 446, 516]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 2016 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 540/545 places, 522/522 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 540 transition count 520
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 538 transition count 520
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 538 transition count 520
Applied a total of 5 rules in 44 ms. Remains 538 /540 variables (removed 2) and now considering 520/522 (removed 2) transitions.
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:17:29] [INFO ] Invariants computation overflowed in 84 ms
[2023-03-10 00:17:29] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:17:29] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-10 00:17:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 00:17:35] [INFO ] Implicit Places using invariants and state equation in 6043 ms returned []
Implicit Place search using SMT with State Equation took 6319 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 538/545 places, 520/522 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8399 ms. Remains : 538/545 places, 520/522 transitions.
Interrupted random walk after 466037 steps, including 66974 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 938 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) 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 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 874 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 890 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 950 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 343) seen :0
Interrupted probabilistic random walk after 3613901 steps, run timeout after 144001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 3613901 steps, saw 1806807 distinct states, run finished after 144001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 343 properties.
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:20:47] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-10 00:21:19] [INFO ] After 22467ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:340
[2023-03-10 00:21:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 00:21:19] [INFO ] After 158ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 00:21:19] [INFO ] After 32123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 00:21:54] [INFO ] After 24448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :343
[2023-03-10 00:22:49] [INFO ] After 54635ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :343
[2023-03-10 00:22:49] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
[2023-03-10 00:22:50] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 0 ms to minimize.
[2023-03-10 00:22:50] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 3 ms to minimize.
[2023-03-10 00:22:51] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2023-03-10 00:22:51] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2023-03-10 00:22:51] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2023-03-10 00:22:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2254 ms
[2023-03-10 00:22:54] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2023-03-10 00:22:55] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 1 ms to minimize.
[2023-03-10 00:22:55] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2023-03-10 00:22:55] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-10 00:22:55] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 0 ms to minimize.
[2023-03-10 00:22:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1370 ms
[2023-03-10 00:22:58] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-10 00:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-10 00:23:00] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2023-03-10 00:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-10 00:23:01] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2023-03-10 00:23:01] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-10 00:23:01] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 1 ms to minimize.
[2023-03-10 00:23:01] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2023-03-10 00:23:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 966 ms
[2023-03-10 00:23:03] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2023-03-10 00:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-10 00:23:05] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-10 00:23:05] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 0 ms to minimize.
[2023-03-10 00:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2023-03-10 00:23:06] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2023-03-10 00:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-10 00:23:08] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 2 ms to minimize.
[2023-03-10 00:23:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-10 00:23:09] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2023-03-10 00:23:09] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 1 ms to minimize.
[2023-03-10 00:23:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2023-03-10 00:23:11] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 0 ms to minimize.
[2023-03-10 00:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 630 ms
[2023-03-10 00:23:14] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 0 ms to minimize.
[2023-03-10 00:23:14] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
[2023-03-10 00:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 639 ms
[2023-03-10 00:23:16] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 2 ms to minimize.
[2023-03-10 00:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-10 00:23:19] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 1 ms to minimize.
[2023-03-10 00:23:19] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 1 ms to minimize.
[2023-03-10 00:23:19] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 1 ms to minimize.
[2023-03-10 00:23:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 966 ms
[2023-03-10 00:23:23] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 1 ms to minimize.
[2023-03-10 00:23:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2023-03-10 00:23:27] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 1 ms to minimize.
[2023-03-10 00:23:27] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2023-03-10 00:23:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 659 ms
[2023-03-10 00:23:28] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2023-03-10 00:23:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-10 00:23:29] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 1 ms to minimize.
[2023-03-10 00:23:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-10 00:23:30] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2023-03-10 00:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-10 00:23:33] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 1 ms to minimize.
[2023-03-10 00:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-10 00:23:34] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2023-03-10 00:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-10 00:23:37] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 1 ms to minimize.
[2023-03-10 00:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-10 00:23:38] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 1 ms to minimize.
[2023-03-10 00:23:38] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 1 ms to minimize.
[2023-03-10 00:23:38] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 1 ms to minimize.
[2023-03-10 00:23:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 774 ms
[2023-03-10 00:23:39] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 1 ms to minimize.
[2023-03-10 00:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-10 00:23:40] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 1 ms to minimize.
[2023-03-10 00:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-10 00:23:41] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 0 ms to minimize.
[2023-03-10 00:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-10 00:23:42] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 1 ms to minimize.
[2023-03-10 00:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-10 00:23:43] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 0 ms to minimize.
[2023-03-10 00:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-10 00:23:44] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2023-03-10 00:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-10 00:23:44] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 1 ms to minimize.
[2023-03-10 00:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-10 00:23:45] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 0 ms to minimize.
[2023-03-10 00:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-10 00:23:47] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 1 ms to minimize.
[2023-03-10 00:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-10 00:23:47] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2023-03-10 00:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-10 00:23:48] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 0 ms to minimize.
[2023-03-10 00:23:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-10 00:23:48] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 0 ms to minimize.
[2023-03-10 00:23:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-10 00:23:49] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
[2023-03-10 00:23:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-10 00:23:49] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2023-03-10 00:23:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-10 00:23:50] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 0 ms to minimize.
[2023-03-10 00:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-10 00:23:51] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 0 ms to minimize.
[2023-03-10 00:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-10 00:23:51] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 0 ms to minimize.
[2023-03-10 00:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-10 00:23:52] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 0 ms to minimize.
[2023-03-10 00:23:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-10 00:23:53] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 0 ms to minimize.
[2023-03-10 00:23:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-10 00:25:04] [INFO ] After 190128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-10 00:25:04] [INFO ] After 225013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :341
Parikh walk visited 0 properties in 30000 ms.
Support contains 463 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 520/520 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 538/538 places, 520/520 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 520/520 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 520/520 (removed 0) transitions.
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:25:34] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-10 00:25:35] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:25:35] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-10 00:25:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 00:25:39] [INFO ] Implicit Places using invariants and state equation in 4696 ms returned []
Implicit Place search using SMT with State Equation took 4896 ms to find 0 implicit places.
[2023-03-10 00:25:39] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:25:39] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-10 00:25:40] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5521 ms. Remains : 538/538 places, 520/520 transitions.
Incomplete random walk after 100000 steps, including 14522 resets, run finished after 6910 ms. (steps per millisecond=14 ) properties (out of 463) seen :0
Running SMT prover for 463 properties.
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 00:25:47] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-10 00:25:52] [INFO ] After 4538ms SMT Verify possible using state equation in real domain returned unsat :0 sat :463
[2023-03-10 00:25:52] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 00:26:07] [INFO ] After 14754ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :463
[2023-03-10 00:26:07] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
[2023-03-10 00:26:08] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 0 ms to minimize.
[2023-03-10 00:26:08] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 1 ms to minimize.
[2023-03-10 00:26:08] [INFO ] Deduced a trap composed of 72 places in 241 ms of which 1 ms to minimize.
[2023-03-10 00:26:08] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 0 ms to minimize.
[2023-03-10 00:26:09] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 1 ms to minimize.
[2023-03-10 00:26:09] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2023-03-10 00:26:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1795 ms
[2023-03-10 00:26:10] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 1 ms to minimize.
[2023-03-10 00:26:10] [INFO ] Deduced a trap composed of 16 places in 317 ms of which 1 ms to minimize.
[2023-03-10 00:26:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 800 ms
[2023-03-10 00:26:11] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2023-03-10 00:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-10 00:26:11] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 1 ms to minimize.
[2023-03-10 00:26:11] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-10 00:26:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2023-03-10 00:26:13] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2023-03-10 00:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-10 00:26:14] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 1 ms to minimize.
[2023-03-10 00:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-10 00:26:15] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2023-03-10 00:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2023-03-10 00:26:16] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 1 ms to minimize.
[2023-03-10 00:26:16] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 1 ms to minimize.
[2023-03-10 00:26:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 715 ms
[2023-03-10 00:26:19] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 1 ms to minimize.
[2023-03-10 00:26:19] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 0 ms to minimize.
[2023-03-10 00:26:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 738 ms
[2023-03-10 00:26:22] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 1 ms to minimize.
[2023-03-10 00:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-10 00:26:23] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 1 ms to minimize.
[2023-03-10 00:26:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-10 00:26:24] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 1 ms to minimize.
[2023-03-10 00:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-10 00:26:24] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2023-03-10 00:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-10 00:26:25] [INFO ] Deduced a trap composed of 16 places in 310 ms of which 1 ms to minimize.
[2023-03-10 00:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2023-03-10 00:26:27] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 1 ms to minimize.
[2023-03-10 00:26:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2023-03-10 00:26:28] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 1 ms to minimize.
[2023-03-10 00:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-10 00:26:31] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 1 ms to minimize.
[2023-03-10 00:26:31] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2023-03-10 00:26:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 623 ms
[2023-03-10 00:26:31] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2023-03-10 00:26:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-10 00:26:32] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 17 ms to minimize.
[2023-03-10 00:26:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-10 00:26:33] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 1 ms to minimize.
[2023-03-10 00:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-10 00:26:34] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 1 ms to minimize.
[2023-03-10 00:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-10 00:26:38] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 1 ms to minimize.
[2023-03-10 00:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-10 00:26:39] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 1 ms to minimize.
[2023-03-10 00:26:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-10 00:26:43] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 1 ms to minimize.
[2023-03-10 00:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-10 00:26:44] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 1 ms to minimize.
[2023-03-10 00:26:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-10 00:26:46] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 0 ms to minimize.
[2023-03-10 00:26:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-10 00:26:50] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 0 ms to minimize.
[2023-03-10 00:26:50] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 1 ms to minimize.
[2023-03-10 00:26:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-03-10 00:26:51] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 0 ms to minimize.
[2023-03-10 00:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-10 00:26:52] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 0 ms to minimize.
[2023-03-10 00:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-10 00:26:53] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2023-03-10 00:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-10 00:26:59] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 1 ms to minimize.
[2023-03-10 00:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2023-03-10 00:27:03] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2023-03-10 00:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2023-03-10 00:27:06] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 1 ms to minimize.
[2023-03-10 00:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2023-03-10 00:27:07] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 1 ms to minimize.
[2023-03-10 00:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-10 00:27:09] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2023-03-10 00:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-10 00:27:12] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 1 ms to minimize.
[2023-03-10 00:27:13] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 0 ms to minimize.
[2023-03-10 00:27:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2023-03-10 00:27:13] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 0 ms to minimize.
[2023-03-10 00:27:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-10 00:27:20] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 0 ms to minimize.
[2023-03-10 00:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-10 00:27:21] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 0 ms to minimize.
[2023-03-10 00:27:21] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2023-03-10 00:27:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2023-03-10 00:27:21] [INFO ] After 89324ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:463
[2023-03-10 00:27:21] [INFO ] After 94326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:463
[2023-03-10 00:27:30] [INFO ] After 7349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :463
[2023-03-10 00:27:50] [INFO ] After 19825ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :463
[2023-03-10 00:27:50] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2023-03-10 00:27:50] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2023-03-10 00:27:50] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-10 00:27:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 753 ms
[2023-03-10 00:27:51] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2023-03-10 00:27:51] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2023-03-10 00:27:51] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2023-03-10 00:27:51] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 1 ms to minimize.
[2023-03-10 00:27:51] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 0 ms to minimize.
[2023-03-10 00:27:51] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 0 ms to minimize.
[2023-03-10 00:27:52] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2023-03-10 00:27:52] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 1 ms to minimize.
[2023-03-10 00:27:52] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2023-03-10 00:27:52] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-10 00:27:52] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2023-03-10 00:27:52] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-10 00:27:53] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2023-03-10 00:27:53] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 0 ms to minimize.
[2023-03-10 00:27:53] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 1 ms to minimize.
[2023-03-10 00:27:53] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2023-03-10 00:27:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2541 ms
[2023-03-10 00:27:55] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 0 ms to minimize.
[2023-03-10 00:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-10 00:27:56] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 0 ms to minimize.
[2023-03-10 00:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-10 00:27:57] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 1 ms to minimize.
[2023-03-10 00:27:57] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2023-03-10 00:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2023-03-10 00:27:57] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 0 ms to minimize.
[2023-03-10 00:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-10 00:27:58] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 0 ms to minimize.
[2023-03-10 00:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-10 00:27:58] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2023-03-10 00:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-10 00:27:59] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2023-03-10 00:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-10 00:27:59] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 0 ms to minimize.
[2023-03-10 00:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-10 00:27:59] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2023-03-10 00:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-10 00:28:00] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2023-03-10 00:28:00] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2023-03-10 00:28:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2023-03-10 00:28:02] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-03-10 00:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14485232 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16166432 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="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is 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 r153-smll-167819440300302"
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 ;