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.r151-smll-167819438100303.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 ltsminxred
Input is DoubleExponent-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-167819438100303
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678393451983

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 20:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 20:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:24:16] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2023-03-09 20:24:16] [INFO ] Transformed 1064 places.
[2023-03-09 20:24:16] [INFO ] Transformed 998 transitions.
[2023-03-09 20:24:16] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 429 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 20 ms.
Incomplete random walk after 10000 steps, including 346 resets, run finished after 1511 ms. (steps per millisecond=6 ) properties (out of 1053) seen :44
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 2068 ms. (steps per millisecond=14 ) properties seen :91
Running SMT prover for 918 properties.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-09 20:24:20] [INFO ] Invariants computation overflowed in 157 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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 20:24:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 20:24:46] [INFO ] After 25185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 918 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 918 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1064 transition count 968
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1034 transition count 968
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 1034 transition count 963
Deduced a syphon composed of 5 places in 30 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 1029 transition count 963
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 33 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 999 transition count 933
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 117 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 994 transition count 933
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 994 transition count 927
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 988 transition count 927
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 988 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 987 transition count 926
Applied a total of 164 rules in 767 ms. Remains 987 /1064 variables (removed 77) and now considering 926/998 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 987/1064 places, 926/998 transitions.
Interrupted random walk after 292116 steps, including 37592 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 91 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 118 ms. (steps per millisecond=8 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 77 ms. (steps per millisecond=12 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 918) seen :0
Probabilistic random walk after 1000000 steps, saw 500653 distinct states, run finished after 75608 ms. (steps per millisecond=13 ) properties seen :51
Running SMT prover for 867 properties.
// Phase 1: matrix 926 rows 987 cols
[2023-03-09 20:26:36] [INFO ] Invariants computation overflowed in 132 ms
[2023-03-09 20:27:03] [INFO ] After 27304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 20:29:20] [INFO ] After 101765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 20:29:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 20:30:44] [INFO ] After 83805ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2023-03-09 20:30:45] [INFO ] Deduced a trap composed of 59 places in 921 ms of which 12 ms to minimize.
[2023-03-09 20:30:46] [INFO ] Deduced a trap composed of 400 places in 958 ms of which 2 ms to minimize.
[2023-03-09 20:30:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2234 ms
[2023-03-09 20:30:49] [INFO ] Deduced a trap composed of 377 places in 787 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 20:30:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 20:30:49] [INFO ] After 225344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 829 different solutions.
Parikh walk visited 0 properties in 30023 ms.
Support contains 867 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 926/926 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 987 transition count 915
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 976 transition count 915
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 976 transition count 913
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 974 transition count 913
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 15 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 965 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 963 transition count 904
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 963 transition count 900
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 959 transition count 900
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 959 transition count 900
Applied a total of 60 rules in 185 ms. Remains 959 /987 variables (removed 28) and now considering 900/926 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 959/987 places, 900/926 transitions.
Interrupted random walk after 309450 steps, including 39974 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 65664 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:32:58] [INFO ] Invariants computation overflowed in 157 ms
[2023-03-09 20:33:23] [INFO ] After 24393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 20:35:28] [INFO ] After 94193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 20:35:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:36:42] [INFO ] After 74367ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 20:36:44] [INFO ] Deduced a trap composed of 394 places in 511 ms of which 4 ms to minimize.
[2023-03-09 20:36:45] [INFO ] Deduced a trap composed of 375 places in 610 ms of which 2 ms to minimize.
[2023-03-09 20:36:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1438 ms
[2023-03-09 20:36:46] [INFO ] Deduced a trap composed of 202 places in 174 ms of which 0 ms to minimize.
[2023-03-09 20:36:46] [INFO ] Deduced a trap composed of 208 places in 161 ms of which 1 ms to minimize.
[2023-03-09 20:36:46] [INFO ] Deduced a trap composed of 194 places in 186 ms of which 1 ms to minimize.
[2023-03-09 20:36:47] [INFO ] Deduced a trap composed of 196 places in 184 ms of which 0 ms to minimize.
[2023-03-09 20:36:47] [INFO ] Deduced a trap composed of 184 places in 191 ms of which 1 ms to minimize.
[2023-03-09 20:36:47] [INFO ] Deduced a trap composed of 182 places in 181 ms of which 1 ms to minimize.
[2023-03-09 20:36:48] [INFO ] Deduced a trap composed of 170 places in 294 ms of which 1 ms to minimize.
[2023-03-09 20:36:48] [INFO ] Deduced a trap composed of 202 places in 217 ms of which 0 ms to minimize.
[2023-03-09 20:36:48] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 1 ms to minimize.
[2023-03-09 20:36:49] [INFO ] Deduced a trap composed of 146 places in 219 ms of which 0 ms to minimize.
[2023-03-09 20:36:49] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-09 20:36:49] [INFO ] Deduced a trap composed of 134 places in 236 ms of which 1 ms to minimize.
[2023-03-09 20:36:50] [INFO ] Deduced a trap composed of 172 places in 343 ms of which 1 ms to minimize.
[2023-03-09 20:36:50] [INFO ] Deduced a trap composed of 137 places in 339 ms of which 0 ms to minimize.
[2023-03-09 20:36:50] [INFO ] Deduced a trap composed of 178 places in 292 ms of which 1 ms to minimize.
[2023-03-09 20:36:51] [INFO ] Deduced a trap composed of 124 places in 263 ms of which 1 ms to minimize.
[2023-03-09 20:36:51] [INFO ] Deduced a trap composed of 122 places in 235 ms of which 1 ms to minimize.
[2023-03-09 20:36:52] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 0 ms to minimize.
[2023-03-09 20:36:52] [INFO ] Deduced a trap composed of 112 places in 262 ms of which 0 ms to minimize.
[2023-03-09 20:36:52] [INFO ] Deduced a trap composed of 110 places in 247 ms of which 0 ms to minimize.
[2023-03-09 20:36:53] [INFO ] Deduced a trap composed of 100 places in 273 ms of which 5 ms to minimize.
[2023-03-09 20:36:53] [INFO ] Deduced a trap composed of 98 places in 266 ms of which 1 ms to minimize.
[2023-03-09 20:36:54] [INFO ] Deduced a trap composed of 195 places in 283 ms of which 1 ms to minimize.
[2023-03-09 20:36:54] [INFO ] Deduced a trap composed of 74 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:36:54] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 1 ms to minimize.
[2023-03-09 20:36:55] [INFO ] Deduced a trap composed of 88 places in 302 ms of which 0 ms to minimize.
[2023-03-09 20:36:55] [INFO ] Deduced a trap composed of 64 places in 335 ms of which 1 ms to minimize.
[2023-03-09 20:36:56] [INFO ] Deduced a trap composed of 62 places in 323 ms of which 1 ms to minimize.
[2023-03-09 20:36:56] [INFO ] Deduced a trap composed of 247 places in 358 ms of which 2 ms to minimize.
[2023-03-09 20:36:59] [INFO ] Deduced a trap composed of 38 places in 358 ms of which 8 ms to minimize.
[2023-03-09 20:36:59] [INFO ] Deduced a trap composed of 52 places in 354 ms of which 1 ms to minimize.
[2023-03-09 20:36:59] [INFO ] Deduced a trap composed of 50 places in 345 ms of which 1 ms to minimize.
[2023-03-09 20:37:00] [INFO ] Deduced a trap composed of 40 places in 395 ms of which 1 ms to minimize.
[2023-03-09 20:37:01] [INFO ] Deduced a trap composed of 272 places in 337 ms of which 1 ms to minimize.
[2023-03-09 20:37:01] [INFO ] Deduced a trap composed of 227 places in 368 ms of which 6 ms to minimize.
[2023-03-09 20:37:02] [INFO ] Deduced a trap composed of 18 places in 496 ms of which 1 ms to minimize.
[2023-03-09 20:37:02] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 1 ms to minimize.
[2023-03-09 20:37:03] [INFO ] Deduced a trap composed of 28 places in 370 ms of which 1 ms to minimize.
[2023-03-09 20:37:04] [INFO ] Deduced a trap composed of 27 places in 368 ms of which 1 ms to minimize.
[2023-03-09 20:37:04] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 0 ms to minimize.
[2023-03-09 20:37:05] [INFO ] Deduced a trap composed of 44 places in 352 ms of which 1 ms to minimize.
[2023-03-09 20:37:07] [INFO ] Deduced a trap composed of 57 places in 337 ms of which 1 ms to minimize.
[2023-03-09 20:37:07] [INFO ] Deduced a trap composed of 81 places in 330 ms of which 1 ms to minimize.
[2023-03-09 20:37:08] [INFO ] Deduced a trap composed of 158 places in 410 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 20:37:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 20:37:08] [INFO ] After 225075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 828 different solutions.
Parikh walk visited 0 properties in 30012 ms.
Support contains 867 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 31 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 959/959 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 29 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:37:38] [INFO ] Invariants computation overflowed in 180 ms
[2023-03-09 20:37:38] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:37:38] [INFO ] Invariants computation overflowed in 233 ms
[2023-03-09 20:37:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:37:39] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2023-03-09 20:37:39] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:37:39] [INFO ] Invariants computation overflowed in 225 ms
[2023-03-09 20:37:41] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2943 ms. Remains : 959/959 places, 900/900 transitions.
Incomplete random walk after 100000 steps, including 12831 resets, run finished after 10177 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:37:51] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-09 20:38:42] [INFO ] After 49505ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2023-03-09 20:38:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:38:57] [INFO ] After 14822ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
[2023-03-09 20:38:58] [INFO ] Deduced a trap composed of 11 places in 519 ms of which 2 ms to minimize.
[2023-03-09 20:38:59] [INFO ] Deduced a trap composed of 150 places in 587 ms of which 3 ms to minimize.
[2023-03-09 20:38:59] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 3 ms to minimize.
[2023-03-09 20:38:59] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 0 ms to minimize.
[2023-03-09 20:38:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2082 ms
[2023-03-09 20:39:02] [INFO ] Deduced a trap composed of 350 places in 848 ms of which 2 ms to minimize.
[2023-03-09 20:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1073 ms
[2023-03-09 20:39:03] [INFO ] Deduced a trap composed of 409 places in 819 ms of which 2 ms to minimize.
[2023-03-09 20:39:04] [INFO ] Deduced a trap composed of 352 places in 819 ms of which 2 ms to minimize.
[2023-03-09 20:39:05] [INFO ] Deduced a trap composed of 256 places in 821 ms of which 2 ms to minimize.
[2023-03-09 20:39:06] [INFO ] Deduced a trap composed of 312 places in 797 ms of which 2 ms to minimize.
[2023-03-09 20:39:07] [INFO ] Deduced a trap composed of 282 places in 869 ms of which 2 ms to minimize.
[2023-03-09 20:39:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4670 ms
[2023-03-09 20:39:08] [INFO ] Deduced a trap composed of 383 places in 800 ms of which 2 ms to minimize.
[2023-03-09 20:39:08] [INFO ] Deduced a trap composed of 376 places in 631 ms of which 2 ms to minimize.
[2023-03-09 20:39:09] [INFO ] Deduced a trap composed of 395 places in 791 ms of which 1 ms to minimize.
[2023-03-09 20:39:10] [INFO ] Deduced a trap composed of 383 places in 665 ms of which 2 ms to minimize.
[2023-03-09 20:39:11] [INFO ] Deduced a trap composed of 207 places in 727 ms of which 1 ms to minimize.
[2023-03-09 20:39:12] [INFO ] Deduced a trap composed of 395 places in 641 ms of which 2 ms to minimize.
[2023-03-09 20:39:12] [INFO ] Deduced a trap composed of 326 places in 690 ms of which 1 ms to minimize.
[2023-03-09 20:39:13] [INFO ] Deduced a trap composed of 276 places in 786 ms of which 3 ms to minimize.
[2023-03-09 20:39:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6500 ms
[2023-03-09 20:39:14] [INFO ] Deduced a trap composed of 208 places in 244 ms of which 1 ms to minimize.
[2023-03-09 20:39:15] [INFO ] Deduced a trap composed of 202 places in 210 ms of which 1 ms to minimize.
[2023-03-09 20:39:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 794 ms
[2023-03-09 20:39:23] [INFO ] Deduced a trap composed of 207 places in 217 ms of which 2 ms to minimize.
[2023-03-09 20:39:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2023-03-09 20:39:27] [INFO ] Deduced a trap composed of 28 places in 809 ms of which 1 ms to minimize.
[2023-03-09 20:39:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 970 ms
[2023-03-09 20:39:29] [INFO ] Deduced a trap composed of 341 places in 725 ms of which 2 ms to minimize.
[2023-03-09 20:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 867 ms
[2023-03-09 20:39:30] [INFO ] Deduced a trap composed of 27 places in 517 ms of which 1 ms to minimize.
[2023-03-09 20:39:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2023-03-09 20:39:31] [INFO ] After 48901ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :790 real:77
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 20:39:31] [INFO ] After 100025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :790 real:77
[2023-03-09 20:40:42] [INFO ] After 68527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 20:41:11] [INFO ] After 29773ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 20:41:11] [INFO ] After 29773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :865
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 20:41:11] [INFO ] After 100015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :865
Interrupted random walk after 308799 steps, including 39376 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 867) seen :0
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 73548 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:42:58] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-09 20:43:23] [INFO ] After 24532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-09 20:45:37] [INFO ] After 103495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 20:45:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:47:08] [INFO ] After 90859ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-09 20:47:08] [INFO ] After 90861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :865
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:47:08] [INFO ] After 225045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :865
Fused 867 Parikh solutions to 832 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 867 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 35 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 959/959 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Applied a total of 0 rules in 28 ms. Remains 959 /959 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:47:38] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-09 20:47:38] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:47:39] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-09 20:47:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:47:39] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2023-03-09 20:47:39] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:47:39] [INFO ] Invariants computation overflowed in 221 ms
[2023-03-09 20:47:40] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2482 ms. Remains : 959/959 places, 900/900 transitions.
Incomplete random walk after 100000 steps, including 12791 resets, run finished after 10153 ms. (steps per millisecond=9 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:47:51] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-09 20:48:44] [INFO ] After 51441ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2023-03-09 20:48:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:48:58] [INFO ] After 14351ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
[2023-03-09 20:48:59] [INFO ] Deduced a trap composed of 11 places in 573 ms of which 2 ms to minimize.
[2023-03-09 20:48:59] [INFO ] Deduced a trap composed of 150 places in 587 ms of which 2 ms to minimize.
[2023-03-09 20:49:00] [INFO ] Deduced a trap composed of 158 places in 282 ms of which 1 ms to minimize.
[2023-03-09 20:49:00] [INFO ] Deduced a trap composed of 170 places in 249 ms of which 0 ms to minimize.
[2023-03-09 20:49:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2110 ms
[2023-03-09 20:49:03] [INFO ] Deduced a trap composed of 350 places in 629 ms of which 2 ms to minimize.
[2023-03-09 20:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 825 ms
[2023-03-09 20:49:04] [INFO ] Deduced a trap composed of 409 places in 656 ms of which 1 ms to minimize.
[2023-03-09 20:49:04] [INFO ] Deduced a trap composed of 352 places in 627 ms of which 1 ms to minimize.
[2023-03-09 20:49:05] [INFO ] Deduced a trap composed of 256 places in 628 ms of which 3 ms to minimize.
[2023-03-09 20:49:06] [INFO ] Deduced a trap composed of 312 places in 611 ms of which 2 ms to minimize.
[2023-03-09 20:49:07] [INFO ] Deduced a trap composed of 282 places in 607 ms of which 1 ms to minimize.
[2023-03-09 20:49:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3628 ms
[2023-03-09 20:49:08] [INFO ] Deduced a trap composed of 383 places in 597 ms of which 1 ms to minimize.
[2023-03-09 20:49:08] [INFO ] Deduced a trap composed of 376 places in 590 ms of which 1 ms to minimize.
[2023-03-09 20:49:09] [INFO ] Deduced a trap composed of 395 places in 589 ms of which 2 ms to minimize.
[2023-03-09 20:49:10] [INFO ] Deduced a trap composed of 383 places in 625 ms of which 1 ms to minimize.
[2023-03-09 20:49:10] [INFO ] Deduced a trap composed of 207 places in 723 ms of which 2 ms to minimize.
[2023-03-09 20:49:11] [INFO ] Deduced a trap composed of 395 places in 510 ms of which 1 ms to minimize.
[2023-03-09 20:49:12] [INFO ] Deduced a trap composed of 326 places in 679 ms of which 2 ms to minimize.
[2023-03-09 20:49:12] [INFO ] Deduced a trap composed of 276 places in 491 ms of which 2 ms to minimize.
[2023-03-09 20:49:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5612 ms
[2023-03-09 20:49:13] [INFO ] Deduced a trap composed of 208 places in 215 ms of which 1 ms to minimize.
[2023-03-09 20:49:14] [INFO ] Deduced a trap composed of 202 places in 212 ms of which 2 ms to minimize.
[2023-03-09 20:49:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 715 ms
[2023-03-09 20:49:22] [INFO ] Deduced a trap composed of 207 places in 193 ms of which 1 ms to minimize.
[2023-03-09 20:49:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-09 20:49:25] [INFO ] Deduced a trap composed of 28 places in 571 ms of which 1 ms to minimize.
[2023-03-09 20:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 707 ms
[2023-03-09 20:49:27] [INFO ] Deduced a trap composed of 341 places in 673 ms of which 1 ms to minimize.
[2023-03-09 20:49:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 805 ms
[2023-03-09 20:49:28] [INFO ] Deduced a trap composed of 27 places in 655 ms of which 1 ms to minimize.
[2023-03-09 20:49:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 772 ms
[2023-03-09 20:49:31] [INFO ] Deduced a trap composed of 57 places in 608 ms of which 1 ms to minimize.
[2023-03-09 20:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2023-03-09 20:49:31] [INFO ] After 47224ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :780 real:86
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:49:31] [INFO ] After 100021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :780 real:86
[2023-03-09 20:50:41] [INFO ] After 69007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-09 20:51:11] [INFO ] After 29600ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :839
[2023-03-09 20:51:11] [INFO ] After 29601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :839
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:51:11] [INFO ] After 100024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :839
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245308 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245308 steps, saw 123339 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:51:14] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-09 20:51:14] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:51:23] [INFO ] After 8566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:51:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:51:25] [INFO ] After 1343ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:51:25] [INFO ] Deduced a trap composed of 207 places in 251 ms of which 1 ms to minimize.
[2023-03-09 20:51:25] [INFO ] Deduced a trap composed of 191 places in 284 ms of which 0 ms to minimize.
[2023-03-09 20:51:25] [INFO ] Deduced a trap composed of 184 places in 252 ms of which 1 ms to minimize.
[2023-03-09 20:51:26] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 1 ms to minimize.
[2023-03-09 20:51:26] [INFO ] Deduced a trap composed of 182 places in 254 ms of which 0 ms to minimize.
[2023-03-09 20:51:27] [INFO ] Deduced a trap composed of 172 places in 321 ms of which 1 ms to minimize.
[2023-03-09 20:51:27] [INFO ] Deduced a trap composed of 173 places in 285 ms of which 1 ms to minimize.
[2023-03-09 20:51:27] [INFO ] Deduced a trap composed of 158 places in 299 ms of which 1 ms to minimize.
[2023-03-09 20:51:28] [INFO ] Deduced a trap composed of 146 places in 353 ms of which 1 ms to minimize.
[2023-03-09 20:51:28] [INFO ] Deduced a trap composed of 181 places in 362 ms of which 1 ms to minimize.
[2023-03-09 20:51:29] [INFO ] Deduced a trap composed of 160 places in 330 ms of which 1 ms to minimize.
[2023-03-09 20:51:29] [INFO ] Deduced a trap composed of 136 places in 387 ms of which 1 ms to minimize.
[2023-03-09 20:51:30] [INFO ] Deduced a trap composed of 134 places in 387 ms of which 2 ms to minimize.
[2023-03-09 20:51:30] [INFO ] Deduced a trap composed of 152 places in 419 ms of which 1 ms to minimize.
[2023-03-09 20:51:31] [INFO ] Deduced a trap composed of 122 places in 385 ms of which 1 ms to minimize.
[2023-03-09 20:51:31] [INFO ] Deduced a trap composed of 117 places in 408 ms of which 1 ms to minimize.
[2023-03-09 20:51:32] [INFO ] Deduced a trap composed of 157 places in 440 ms of which 1 ms to minimize.
[2023-03-09 20:51:33] [INFO ] Deduced a trap composed of 190 places in 467 ms of which 1 ms to minimize.
[2023-03-09 20:51:34] [INFO ] Deduced a trap composed of 110 places in 376 ms of which 1 ms to minimize.
[2023-03-09 20:51:34] [INFO ] Deduced a trap composed of 158 places in 432 ms of which 1 ms to minimize.
[2023-03-09 20:51:35] [INFO ] Deduced a trap composed of 112 places in 447 ms of which 1 ms to minimize.
[2023-03-09 20:51:37] [INFO ] Deduced a trap composed of 86 places in 407 ms of which 1 ms to minimize.
[2023-03-09 20:51:38] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 1 ms to minimize.
[2023-03-09 20:51:39] [INFO ] Deduced a trap composed of 74 places in 534 ms of which 1 ms to minimize.
[2023-03-09 20:51:39] [INFO ] Deduced a trap composed of 76 places in 506 ms of which 2 ms to minimize.
[2023-03-09 20:51:40] [INFO ] Deduced a trap composed of 100 places in 467 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 20:51:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 20:51:40] [INFO ] After 25366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Graph (complete) has 1854 edges and 959 vertex of which 953 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 952 transition count 701
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 399 place count 755 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 754 transition count 700
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 400 place count 754 transition count 667
Deduced a syphon composed of 33 places in 10 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 466 place count 721 transition count 667
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 5 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 760 place count 574 transition count 520
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 822 place count 543 transition count 520
Free-agglomeration rule (complex) applied 68 times.
Iterating global reduction 3 with 68 rules applied. Total rules applied 890 place count 543 transition count 452
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 958 place count 475 transition count 452
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 1024 place count 475 transition count 452
Applied a total of 1024 rules in 285 ms. Remains 475 /959 variables (removed 484) and now considering 452/900 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 475/959 places, 452/900 transitions.
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 361211 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361211 steps, saw 181292 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2023-03-09 20:51:45] [INFO ] Computed 100 place invariants in 96 ms
[2023-03-09 20:51:45] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:51:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 20:51:46] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 76 ms returned sat
[2023-03-09 20:51:46] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:51:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:51:47] [INFO ] After 960ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:51:47] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2023-03-09 20:51:47] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2023-03-09 20:51:47] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2023-03-09 20:51:48] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2023-03-09 20:51:48] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 1 ms to minimize.
[2023-03-09 20:51:48] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 1 ms to minimize.
[2023-03-09 20:51:48] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 1 ms to minimize.
[2023-03-09 20:51:48] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 1 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 0 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 1 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 0 ms to minimize.
[2023-03-09 20:51:49] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2023-03-09 20:51:50] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 0 ms to minimize.
[2023-03-09 20:51:50] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 0 ms to minimize.
[2023-03-09 20:51:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2905 ms
[2023-03-09 20:51:50] [INFO ] After 3952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-09 20:51:50] [INFO ] After 4707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 14 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2023-03-09 20:51:52] [INFO ] Invariant cache hit.
[2023-03-09 20:51:55] [INFO ] Implicit Places using invariants in 3101 ms returned [14, 19, 44, 50, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 3107 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/475 places, 452/452 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 451
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 434 transition count 431
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 414 transition count 431
Applied a total of 42 rules in 84 ms. Remains 414 /435 variables (removed 21) and now considering 431/452 (removed 21) transitions.
// Phase 1: matrix 431 rows 414 cols
[2023-03-09 20:51:56] [INFO ] Computed 61 place invariants in 260 ms
[2023-03-09 20:51:57] [INFO ] Implicit Places using invariants in 1277 ms returned []
[2023-03-09 20:51:57] [INFO ] Invariant cache hit.
[2023-03-09 20:51:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:52:15] [INFO ] Implicit Places using invariants and state equation in 18460 ms returned []
Implicit Place search using SMT with State Equation took 19741 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 414/475 places, 431/452 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22948 ms. Remains : 414/475 places, 431/452 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 381698 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381698 steps, saw 190973 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:52:18] [INFO ] Invariant cache hit.
[2023-03-09 20:52:18] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:52:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 40 ms returned sat
[2023-03-09 20:52:18] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 18 ms returned sat
[2023-03-09 20:52:19] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:52:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:52:20] [INFO ] After 1552ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:52:20] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2023-03-09 20:52:21] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2023-03-09 20:52:22] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-09 20:52:22] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 0 ms to minimize.
[2023-03-09 20:52:22] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 1 ms to minimize.
[2023-03-09 20:52:22] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2023-03-09 20:52:22] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 1 ms to minimize.
[2023-03-09 20:52:22] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2023-03-09 20:52:23] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-09 20:52:23] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-09 20:52:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2400 ms
[2023-03-09 20:52:23] [INFO ] After 4053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-09 20:52:23] [INFO ] After 4843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 51 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 414/414 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 26 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2023-03-09 20:52:25] [INFO ] Invariant cache hit.
[2023-03-09 20:52:26] [INFO ] Implicit Places using invariants in 736 ms returned []
[2023-03-09 20:52:26] [INFO ] Invariant cache hit.
[2023-03-09 20:52:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:52:53] [INFO ] Implicit Places using invariants and state equation in 26933 ms returned []
Implicit Place search using SMT with State Equation took 27673 ms to find 0 implicit places.
[2023-03-09 20:52:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 20:52:53] [INFO ] Invariant cache hit.
[2023-03-09 20:52:53] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28134 ms. Remains : 414/414 places, 431/431 transitions.
Incomplete random walk after 10000 steps, including 1247 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217926 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217926 steps, saw 109564 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-09 20:52:56] [INFO ] Invariants computation overflowed in 226 ms
[2023-03-09 20:52:57] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:53:01] [INFO ] After 3983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:53:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 20:53:01] [INFO ] After 528ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:53:02] [INFO ] Deduced a trap composed of 7 places in 634 ms of which 2 ms to minimize.
[2023-03-09 20:53:03] [INFO ] Deduced a trap composed of 335 places in 741 ms of which 3 ms to minimize.
[2023-03-09 20:53:04] [INFO ] Deduced a trap composed of 347 places in 785 ms of which 2 ms to minimize.
[2023-03-09 20:53:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2385 ms
[2023-03-09 20:53:04] [INFO ] After 2953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 20:53:04] [INFO ] After 7192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 900/900 transitions.
Graph (complete) has 1854 edges and 959 vertex of which 953 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 952 transition count 700
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 400 place count 754 transition count 700
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 400 place count 754 transition count 667
Deduced a syphon composed of 33 places in 11 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 466 place count 721 transition count 667
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 5 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 760 place count 574 transition count 520
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 822 place count 543 transition count 520
Free-agglomeration rule (complex) applied 67 times.
Iterating global reduction 2 with 67 rules applied. Total rules applied 889 place count 543 transition count 453
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 956 place count 476 transition count 453
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 1023 place count 476 transition count 453
Applied a total of 1023 rules in 204 ms. Remains 476 /959 variables (removed 483) and now considering 453/900 (removed 447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 476/959 places, 453/900 transitions.
Incomplete random walk after 10000 steps, including 1287 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325758 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325758 steps, saw 163562 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-09 20:53:09] [INFO ] Computed 100 place invariants in 46 ms
[2023-03-09 20:53:09] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:53:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 20:53:09] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 93 ms returned sat
[2023-03-09 20:53:10] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:53:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:53:11] [INFO ] After 791ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:53:11] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-09 20:53:11] [INFO ] After 1646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 15 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 15 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-09 20:53:13] [INFO ] Invariant cache hit.
[2023-03-09 20:53:16] [INFO ] Implicit Places using invariants in 3034 ms returned [15, 20, 45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 3045 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/476 places, 453/453 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 452
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 435 transition count 432
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 415 transition count 432
Applied a total of 42 rules in 51 ms. Remains 415 /436 variables (removed 21) and now considering 432/453 (removed 21) transitions.
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 20:53:16] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 20:53:17] [INFO ] Implicit Places using invariants in 758 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 20:53:17] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 20:53:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:53:36] [INFO ] Implicit Places using invariants and state equation in 19327 ms returned []
Implicit Place search using SMT with State Equation took 20087 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 415/476 places, 432/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23199 ms. Remains : 415/476 places, 432/453 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 378352 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 378352 steps, saw 189304 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 20:53:39] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-09 20:53:39] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:53:41] [INFO ] After 1777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:53:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:53:41] [INFO ] After 226ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:53:42] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 20:53:42] [INFO ] After 2212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 20 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 415/415 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 22 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 20:53:44] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 20:53:44] [INFO ] Implicit Places using invariants in 746 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 20:53:44] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 20:53:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 20:54:09] [INFO ] Implicit Places using invariants and state equation in 24511 ms returned []
Implicit Place search using SMT with State Equation took 25259 ms to find 0 implicit places.
[2023-03-09 20:54:09] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2023-03-09 20:54:09] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 20:54:09] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25872 ms. Remains : 415/415 places, 432/432 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 415 transition count 394
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 377 transition count 394
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 96 place count 357 transition count 374
Iterating global reduction 0 with 20 rules applied. Total rules applied 116 place count 357 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 356 transition count 373
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 356 transition count 371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 354 transition count 371
Applied a total of 122 rules in 132 ms. Remains 354 /415 variables (removed 61) and now considering 371/432 (removed 61) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 371 rows 354 cols
[2023-03-09 20:54:10] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 20:54:10] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:54:11] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:54:11] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:54:11] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2023-03-09 20:54:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 20:54:11] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 20:54:11] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15187180 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16130740 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 StableMarking -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="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-smll-167819438100303"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;