Execution Chart

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

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 23:58:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 23:58:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:58:23] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-09 23:58:23] [INFO ] Transformed 1064 places.
[2023-03-09 23:58:23] [INFO ] Transformed 998 transitions.
[2023-03-09 23:58:23] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 312 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 22 ms.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 1195 ms. (steps per millisecond=8 ) properties (out of 1053) seen :44
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 2055 ms. (steps per millisecond=14 ) properties seen :91
Running SMT prover for 918 properties.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-09 23:58:27] [INFO ] Invariants computation overflowed in 182 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 23:58:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 23:58:53] [INFO ] After 25107ms 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 21 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 17 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 58 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 438 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 439 ms. Remains : 987/1064 places, 926/998 transitions.
Interrupted random walk after 345487 steps, including 44219 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 81 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 82 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 75 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 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 95 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 82 resets, run finished after 68 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 71 ms. (steps per millisecond=14 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 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 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 77 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 94 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 87 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 73 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 70 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 72 ms. (steps per millisecond=13 ) 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 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 79 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 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 84 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 82 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 90 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 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 82 resets, run finished after 68 ms. (steps per millisecond=14 ) 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 86 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 92 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 918) 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 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 1001 steps, including 85 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 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 84 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 918) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 918) 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 918) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 918) seen :0
Probabilistic random walk after 1000000 steps, saw 500653 distinct states, run finished after 63662 ms. (steps per millisecond=15 ) properties seen :51
Running SMT prover for 867 properties.
// Phase 1: matrix 926 rows 987 cols
[2023-03-10 00:00:30] [INFO ] Invariants computation overflowed in 127 ms
[2023-03-10 00:00:54] [INFO ] After 23414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-10 00:02:49] [INFO ] After 84491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-10 00:02:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 00:04:11] [INFO ] After 82063ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2023-03-10 00:04:12] [INFO ] Deduced a trap composed of 59 places in 1100 ms of which 13 ms to minimize.
[2023-03-10 00:04:13] [INFO ] Deduced a trap composed of 400 places in 984 ms of which 3 ms to minimize.
[2023-03-10 00:04:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2457 ms
[2023-03-10 00:04:16] [INFO ] Deduced a trap composed of 377 places in 809 ms of which 3 ms to minimize.
[2023-03-10 00:04:17] [INFO ] Deduced a trap composed of 299 places in 545 ms of which 3 ms to minimize.
[2023-03-10 00:04:17] [INFO ] Deduced a trap composed of 298 places in 751 ms of which 2 ms to minimize.
[2023-03-10 00:04:18] [INFO ] Deduced a trap composed of 169 places in 315 ms of which 1 ms to minimize.
[2023-03-10 00:04:19] [INFO ] Deduced a trap composed of 155 places in 701 ms of which 2 ms to minimize.
[2023-03-10 00:04:20] [INFO ] Deduced a trap composed of 157 places in 769 ms of which 2 ms to minimize.
[2023-03-10 00:04:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4593 ms
[2023-03-10 00:04:20] [INFO ] Deduced a trap composed of 217 places in 211 ms of which 1 ms to minimize.
[2023-03-10 00:04:21] [INFO ] Deduced a trap composed of 214 places in 269 ms of which 1 ms to minimize.
[2023-03-10 00:04:21] [INFO ] Deduced a trap composed of 203 places in 238 ms of which 1 ms to minimize.
[2023-03-10 00:04:21] [INFO ] Deduced a trap composed of 205 places in 233 ms of which 1 ms to minimize.
[2023-03-10 00:04:22] [INFO ] Deduced a trap composed of 193 places in 177 ms of which 1 ms to minimize.
[2023-03-10 00:04:22] [INFO ] Deduced a trap composed of 191 places in 169 ms of which 1 ms to minimize.
[2023-03-10 00:04:22] [INFO ] Deduced a trap composed of 215 places in 255 ms of which 1 ms to minimize.
[2023-03-10 00:04:23] [INFO ] Deduced a trap composed of 181 places in 221 ms of which 1 ms to minimize.
[2023-03-10 00:04:23] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 0 ms to minimize.
[2023-03-10 00:04:23] [INFO ] Deduced a trap composed of 199 places in 209 ms of which 2 ms to minimize.
[2023-03-10 00:04:24] [INFO ] Deduced a trap composed of 145 places in 240 ms of which 0 ms to minimize.
[2023-03-10 00:04:24] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 2 ms to minimize.
[2023-03-10 00:04:24] [INFO ] Deduced a trap composed of 119 places in 379 ms of which 1 ms to minimize.
[2023-03-10 00:04:25] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 1 ms to minimize.
[2023-03-10 00:04:25] [INFO ] Deduced a trap composed of 107 places in 339 ms of which 1 ms to minimize.
[2023-03-10 00:04:26] [INFO ] Deduced a trap composed of 109 places in 481 ms of which 1 ms to minimize.
[2023-03-10 00:04:26] [INFO ] Deduced a trap composed of 185 places in 370 ms of which 3 ms to minimize.
[2023-03-10 00:04:27] [INFO ] Deduced a trap composed of 133 places in 283 ms of which 0 ms to minimize.
[2023-03-10 00:04:27] [INFO ] Deduced a trap composed of 131 places in 222 ms of which 0 ms to minimize.
[2023-03-10 00:04:27] [INFO ] Deduced a trap composed of 97 places in 285 ms of which 0 ms to minimize.
[2023-03-10 00:04:28] [INFO ] Deduced a trap composed of 95 places in 437 ms of which 1 ms to minimize.
[2023-03-10 00:04:28] [INFO ] Deduced a trap composed of 83 places in 500 ms of which 1 ms to minimize.
[2023-03-10 00:04:29] [INFO ] Deduced a trap composed of 71 places in 534 ms of which 2 ms to minimize.
[2023-03-10 00:04:29] [INFO ] Deduced a trap composed of 73 places in 466 ms of which 1 ms to minimize.
[2023-03-10 00:04:30] [INFO ] Deduced a trap composed of 61 places in 361 ms of which 1 ms to minimize.
[2023-03-10 00:04:30] [INFO ] Deduced a trap composed of 85 places in 311 ms of which 2 ms to minimize.
[2023-03-10 00:04:31] [INFO ] Deduced a trap composed of 49 places in 486 ms of which 6 ms to minimize.
[2023-03-10 00:04:32] [INFO ] Deduced a trap composed of 47 places in 454 ms of which 1 ms to minimize.
[2023-03-10 00:04:32] [INFO ] Deduced a trap composed of 37 places in 478 ms of which 1 ms to minimize.
[2023-03-10 00:04:33] [INFO ] Deduced a trap composed of 35 places in 448 ms of which 1 ms to minimize.
[2023-03-10 00:04:33] [INFO ] Deduced a trap composed of 156 places in 420 ms of which 1 ms to minimize.
[2023-03-10 00:04:34] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 1 ms to minimize.
[2023-03-10 00:04:35] [INFO ] Deduced a trap composed of 218 places in 599 ms of which 2 ms to minimize.
[2023-03-10 00:04:36] [INFO ] Deduced a trap composed of 15 places in 624 ms of which 2 ms to minimize.
[2023-03-10 00:04:37] [INFO ] Deduced a trap composed of 32 places in 544 ms of which 9 ms to minimize.
[2023-03-10 00:04:39] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 18632 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 00:04:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 00:04:39] [INFO ] After 225020ms 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 30008 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 17 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 16 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 18 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 189 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 189 ms. Remains : 959/987 places, 900/926 transitions.
Interrupted random walk after 333815 steps, including 42915 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 56 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 56 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 867) seen :0
Probabilistic random walk after 1000000 steps, saw 500676 distinct states, run finished after 58402 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 900 rows 959 cols
[2023-03-10 00:06:40] [INFO ] Invariants computation overflowed in 169 ms
[2023-03-10 00:07:13] [INFO ] After 33006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-10 00:09:19] [INFO ] After 91421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :866
[2023-03-10 00:09:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:10:30] [INFO ] After 71075ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2023-03-10 00:10:31] [INFO ] Deduced a trap composed of 383 places in 777 ms of which 4 ms to minimize.
[2023-03-10 00:10:32] [INFO ] Deduced a trap composed of 406 places in 594 ms of which 1 ms to minimize.
[2023-03-10 00:10:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1607 ms
[2023-03-10 00:10:34] [INFO ] Deduced a trap composed of 378 places in 472 ms of which 1 ms to minimize.
[2023-03-10 00:10:34] [INFO ] Deduced a trap composed of 386 places in 428 ms of which 1 ms to minimize.
[2023-03-10 00:10:35] [INFO ] Deduced a trap composed of 351 places in 577 ms of which 1 ms to minimize.
[2023-03-10 00:10:36] [INFO ] Deduced a trap composed of 383 places in 728 ms of which 2 ms to minimize.
[2023-03-10 00:10:36] [INFO ] Deduced a trap composed of 27 places in 574 ms of which 2 ms to minimize.
[2023-03-10 00:10:37] [INFO ] Deduced a trap composed of 355 places in 722 ms of which 2 ms to minimize.
[2023-03-10 00:10:38] [INFO ] Deduced a trap composed of 371 places in 562 ms of which 1 ms to minimize.
[2023-03-10 00:10:38] [INFO ] Deduced a trap composed of 365 places in 595 ms of which 2 ms to minimize.
[2023-03-10 00:10:39] [INFO ] Deduced a trap composed of 396 places in 545 ms of which 1 ms to minimize.
[2023-03-10 00:10:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5760 ms
[2023-03-10 00:10:40] [INFO ] Deduced a trap composed of 382 places in 689 ms of which 1 ms to minimize.
[2023-03-10 00:10:40] [INFO ] Deduced a trap composed of 28 places in 559 ms of which 4 ms to minimize.
[2023-03-10 00:10:41] [INFO ] Deduced a trap composed of 62 places in 437 ms of which 0 ms to minimize.
[2023-03-10 00:10:41] [INFO ] Deduced a trap composed of 144 places in 204 ms of which 0 ms to minimize.
[2023-03-10 00:10:41] [INFO ] Deduced a trap composed of 255 places in 210 ms of which 1 ms to minimize.
[2023-03-10 00:10:42] [INFO ] Deduced a trap composed of 184 places in 218 ms of which 1 ms to minimize.
[2023-03-10 00:10:42] [INFO ] Deduced a trap composed of 112 places in 246 ms of which 0 ms to minimize.
[2023-03-10 00:10:43] [INFO ] Deduced a trap composed of 376 places in 543 ms of which 1 ms to minimize.
[2023-03-10 00:10:43] [INFO ] Deduced a trap composed of 110 places in 557 ms of which 2 ms to minimize.
[2023-03-10 00:10:44] [INFO ] Deduced a trap composed of 355 places in 543 ms of which 2 ms to minimize.
[2023-03-10 00:10:44] [INFO ] Deduced a trap composed of 373 places in 549 ms of which 1 ms to minimize.
[2023-03-10 00:10:45] [INFO ] Deduced a trap composed of 346 places in 543 ms of which 1 ms to minimize.
[2023-03-10 00:10:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6218 ms
[2023-03-10 00:10:46] [INFO ] Deduced a trap composed of 92 places in 344 ms of which 1 ms to minimize.
[2023-03-10 00:10:47] [INFO ] Deduced a trap composed of 74 places in 319 ms of which 2 ms to minimize.
[2023-03-10 00:10:47] [INFO ] Deduced a trap composed of 86 places in 346 ms of which 10 ms to minimize.
[2023-03-10 00:10:47] [INFO ] Deduced a trap composed of 88 places in 444 ms of which 2 ms to minimize.
[2023-03-10 00:10:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1742 ms
[2023-03-10 00:10:48] [INFO ] Deduced a trap composed of 208 places in 158 ms of which 1 ms to minimize.
[2023-03-10 00:10:48] [INFO ] Deduced a trap composed of 194 places in 157 ms of which 0 ms to minimize.
[2023-03-10 00:10:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-10 00:10:51] [INFO ] Deduced a trap composed of 283 places in 704 ms of which 1 ms to minimize.
[2023-03-10 00:10:52] [INFO ] Deduced a trap composed of 100 places in 565 ms of which 1 ms to minimize.
[2023-03-10 00:10:52] [INFO ] Deduced a trap composed of 398 places in 655 ms of which 2 ms to minimize.
[2023-03-10 00:10:53] [INFO ] Deduced a trap composed of 240 places in 563 ms of which 1 ms to minimize.
[2023-03-10 00:10:54] [INFO ] Deduced a trap composed of 38 places in 747 ms of which 2 ms to minimize.
[2023-03-10 00:10:54] [INFO ] Deduced a trap composed of 98 places in 589 ms of which 2 ms to minimize.
[2023-03-10 00:10:55] [INFO ] Deduced a trap composed of 342 places in 685 ms of which 2 ms to minimize.
[2023-03-10 00:10:56] [INFO ] Deduced a trap composed of 378 places in 573 ms of which 1 ms to minimize.
[2023-03-10 00:10:57] [INFO ] Deduced a trap composed of 412 places in 723 ms of which 5 ms to minimize.
[2023-03-10 00:10:57] [INFO ] Deduced a trap composed of 360 places in 643 ms of which 2 ms to minimize.
[2023-03-10 00:10:58] [INFO ] Deduced a trap composed of 406 places in 604 ms of which 2 ms to minimize.
[2023-03-10 00:10:59] [INFO ] Deduced a trap composed of 357 places in 758 ms of which 2 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-10 00:10:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 00:10:59] [INFO ] After 225502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 813 different solutions.
Parikh walk visited 0 properties in 30011 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 32 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 32 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-10 00:11:29] [INFO ] Invariants computation overflowed in 152 ms
[2023-03-10 00:11:29] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 900 rows 959 cols
[2023-03-10 00:11:29] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-10 00:11:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:11:37] [INFO ] Implicit Places using invariants and state equation in 7724 ms returned [91, 287, 412, 780, 906]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 8108 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 954/959 places, 900/900 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 954 transition count 898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 952 transition count 898
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 952 transition count 898
Applied a total of 5 rules in 94 ms. Remains 952 /954 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:11:37] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-10 00:11:37] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:11:38] [INFO ] Invariants computation overflowed in 132 ms
[2023-03-10 00:11:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:11:45] [INFO ] Implicit Places using invariants and state equation in 7834 ms returned []
Implicit Place search using SMT with State Equation took 8227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 952/959 places, 898/900 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16459 ms. Remains : 952/959 places, 898/900 transitions.
Interrupted random walk after 330020 steps, including 47616 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 92 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 97 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 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 100 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 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 84 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 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 89 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 85 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 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 88 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 60 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 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 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 95 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 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 91 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Probabilistic random walk after 1000001 steps, saw 500379 distinct states, run finished after 58451 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:13:17] [INFO ] Invariants computation overflowed in 220 ms
[2023-03-10 00:13:53] [INFO ] After 36087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-10 00:16:06] [INFO ] After 94013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2023-03-10 00:16:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:17:21] [INFO ] After 74653ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2023-03-10 00:17:21] [INFO ] Deduced a trap composed of 191 places in 188 ms of which 2 ms to minimize.
[2023-03-10 00:17:21] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 0 ms to minimize.
[2023-03-10 00:17:21] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-10 00:17:22] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 1 ms to minimize.
[2023-03-10 00:17:22] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 1 ms to minimize.
[2023-03-10 00:17:22] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 0 ms to minimize.
[2023-03-10 00:17:23] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 1 ms to minimize.
[2023-03-10 00:17:23] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 1 ms to minimize.
[2023-03-10 00:17:23] [INFO ] Deduced a trap composed of 148 places in 194 ms of which 0 ms to minimize.
[2023-03-10 00:17:24] [INFO ] Deduced a trap composed of 134 places in 276 ms of which 1 ms to minimize.
[2023-03-10 00:17:24] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 1 ms to minimize.
[2023-03-10 00:17:24] [INFO ] Deduced a trap composed of 122 places in 298 ms of which 1 ms to minimize.
[2023-03-10 00:17:25] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2023-03-10 00:17:25] [INFO ] Deduced a trap composed of 165 places in 285 ms of which 1 ms to minimize.
[2023-03-10 00:17:25] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 1 ms to minimize.
[2023-03-10 00:17:26] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 1 ms to minimize.
[2023-03-10 00:17:27] [INFO ] Deduced a trap composed of 98 places in 239 ms of which 1 ms to minimize.
[2023-03-10 00:17:27] [INFO ] Deduced a trap composed of 100 places in 397 ms of which 1 ms to minimize.
[2023-03-10 00:17:28] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 0 ms to minimize.
[2023-03-10 00:17:28] [INFO ] Deduced a trap composed of 88 places in 299 ms of which 2 ms to minimize.
[2023-03-10 00:17:28] [INFO ] Deduced a trap composed of 155 places in 387 ms of which 1 ms to minimize.
[2023-03-10 00:17:29] [INFO ] Deduced a trap composed of 110 places in 353 ms of which 1 ms to minimize.
[2023-03-10 00:17:31] [INFO ] Deduced a trap composed of 62 places in 391 ms of which 2 ms to minimize.
[2023-03-10 00:17:31] [INFO ] Deduced a trap composed of 64 places in 497 ms of which 2 ms to minimize.
[2023-03-10 00:17:32] [INFO ] Deduced a trap composed of 76 places in 469 ms of which 1 ms to minimize.
[2023-03-10 00:17:32] [INFO ] Deduced a trap composed of 74 places in 438 ms of which 1 ms to minimize.
[2023-03-10 00:17:36] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 1 ms to minimize.
[2023-03-10 00:17:36] [INFO ] Deduced a trap composed of 50 places in 462 ms of which 1 ms to minimize.
[2023-03-10 00:17:37] [INFO ] Deduced a trap composed of 259 places in 558 ms of which 2 ms to minimize.
[2023-03-10 00:17:37] [INFO ] Deduced a trap composed of 28 places in 526 ms of which 1 ms to minimize.
[2023-03-10 00:17:38] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 0 ms to minimize.
[2023-03-10 00:17:38] [INFO ] Deduced a trap composed of 38 places in 335 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-10 00:17:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 00:17:38] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 814 different solutions.
Parikh walk visited 0 properties in 30012 ms.
Support contains 867 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 898/898 transitions.
Applied a total of 0 rules in 27 ms. Remains 952 /952 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 952/952 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 898/898 transitions.
Applied a total of 0 rules in 25 ms. Remains 952 /952 variables (removed 0) and now considering 898/898 (removed 0) transitions.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:18:08] [INFO ] Invariants computation overflowed in 134 ms
[2023-03-10 00:18:09] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:18:09] [INFO ] Invariants computation overflowed in 127 ms
[2023-03-10 00:18:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:18:09] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2023-03-10 00:18:09] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:18:10] [INFO ] Invariants computation overflowed in 129 ms
[2023-03-10 00:18:10] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2091 ms. Remains : 952/952 places, 898/898 transitions.
Incomplete random walk after 100000 steps, including 14325 resets, run finished after 9247 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:18:20] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-10 00:18:41] [INFO ] After 20216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :867
[2023-03-10 00:18:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:18:55] [INFO ] After 13993ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :867
[2023-03-10 00:18:56] [INFO ] Deduced a trap composed of 62 places in 414 ms of which 1 ms to minimize.
[2023-03-10 00:18:56] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
[2023-03-10 00:18:57] [INFO ] Deduced a trap composed of 34 places in 382 ms of which 1 ms to minimize.
[2023-03-10 00:18:57] [INFO ] Deduced a trap composed of 100 places in 287 ms of which 1 ms to minimize.
[2023-03-10 00:18:57] [INFO ] Deduced a trap composed of 98 places in 299 ms of which 1 ms to minimize.
[2023-03-10 00:18:58] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 0 ms to minimize.
[2023-03-10 00:18:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2364 ms
[2023-03-10 00:19:00] [INFO ] Deduced a trap composed of 194 places in 169 ms of which 1 ms to minimize.
[2023-03-10 00:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-10 00:19:00] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 0 ms to minimize.
[2023-03-10 00:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-10 00:19:01] [INFO ] Deduced a trap composed of 202 places in 173 ms of which 0 ms to minimize.
[2023-03-10 00:19:01] [INFO ] Deduced a trap composed of 208 places in 174 ms of which 1 ms to minimize.
[2023-03-10 00:19:01] [INFO ] Deduced a trap composed of 205 places in 157 ms of which 0 ms to minimize.
[2023-03-10 00:19:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 745 ms
[2023-03-10 00:19:07] [INFO ] Deduced a trap composed of 207 places in 197 ms of which 1 ms to minimize.
[2023-03-10 00:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2023-03-10 00:19:12] [INFO ] Deduced a trap composed of 28 places in 683 ms of which 2 ms to minimize.
[2023-03-10 00:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 800 ms
[2023-03-10 00:19:15] [INFO ] Deduced a trap composed of 28 places in 553 ms of which 2 ms to minimize.
[2023-03-10 00:19:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 645 ms
[2023-03-10 00:19:18] [INFO ] Deduced a trap composed of 315 places in 573 ms of which 2 ms to minimize.
[2023-03-10 00:19:19] [INFO ] Deduced a trap composed of 333 places in 698 ms of which 2 ms to minimize.
[2023-03-10 00:19:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1533 ms
[2023-03-10 00:19:21] [INFO ] Deduced a trap composed of 325 places in 550 ms of which 1 ms to minimize.
[2023-03-10 00:19:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2023-03-10 00:19:23] [INFO ] Deduced a trap composed of 40 places in 590 ms of which 2 ms to minimize.
[2023-03-10 00:19:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 709 ms
[2023-03-10 00:19:28] [INFO ] Deduced a trap composed of 306 places in 490 ms of which 1 ms to minimize.
[2023-03-10 00:19:28] [INFO ] Deduced a trap composed of 302 places in 482 ms of which 1 ms to minimize.
[2023-03-10 00:19:29] [INFO ] Deduced a trap composed of 319 places in 455 ms of which 1 ms to minimize.
[2023-03-10 00:19:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1774 ms
[2023-03-10 00:19:31] [INFO ] Deduced a trap composed of 27 places in 530 ms of which 2 ms to minimize.
[2023-03-10 00:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2023-03-10 00:19:33] [INFO ] Deduced a trap composed of 38 places in 496 ms of which 1 ms to minimize.
[2023-03-10 00:19:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 635 ms
[2023-03-10 00:19:34] [INFO ] Deduced a trap composed of 52 places in 488 ms of which 1 ms to minimize.
[2023-03-10 00:19:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2023-03-10 00:19:36] [INFO ] Deduced a trap composed of 56 places in 483 ms of which 1 ms to minimize.
[2023-03-10 00:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 640 ms
[2023-03-10 00:19:38] [INFO ] Deduced a trap composed of 321 places in 438 ms of which 1 ms to minimize.
[2023-03-10 00:19:38] [INFO ] Deduced a trap composed of 334 places in 453 ms of which 2 ms to minimize.
[2023-03-10 00:19:39] [INFO ] Deduced a trap composed of 321 places in 592 ms of which 1 ms to minimize.
[2023-03-10 00:19:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1731 ms
[2023-03-10 00:19:43] [INFO ] Deduced a trap composed of 64 places in 429 ms of which 1 ms to minimize.
[2023-03-10 00:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2023-03-10 00:19:47] [INFO ] Deduced a trap composed of 70 places in 435 ms of which 1 ms to minimize.
[2023-03-10 00:19:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 563 ms
[2023-03-10 00:19:48] [INFO ] Deduced a trap composed of 288 places in 429 ms of which 1 ms to minimize.
[2023-03-10 00:19:48] [INFO ] Deduced a trap composed of 292 places in 496 ms of which 2 ms to minimize.
[2023-03-10 00:19:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1282 ms
[2023-03-10 00:19:52] [INFO ] Deduced a trap composed of 76 places in 421 ms of which 1 ms to minimize.
[2023-03-10 00:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2023-03-10 00:20:00] [INFO ] Deduced a trap composed of 88 places in 386 ms of which 1 ms to minimize.
[2023-03-10 00:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 551 ms
[2023-03-10 00:20:00] [INFO ] After 78627ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :633 real:234
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-10 00:20:00] [INFO ] After 100035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :633 real:234
[2023-03-10 00:20:27] [INFO ] After 25443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2023-03-10 00:21:19] [INFO ] After 52036ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :866
[2023-03-10 00:21:20] [INFO ] Deduced a trap composed of 3 places in 449 ms of which 1 ms to minimize.
[2023-03-10 00:21:20] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2023-03-10 00:21:21] [INFO ] Deduced a trap composed of 184 places in 202 ms of which 0 ms to minimize.
[2023-03-10 00:21:21] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 1 ms to minimize.
[2023-03-10 00:21:21] [INFO ] Deduced a trap composed of 191 places in 206 ms of which 1 ms to minimize.
[2023-03-10 00:21:21] [INFO ] Deduced a trap composed of 207 places in 183 ms of which 1 ms to minimize.
[2023-03-10 00:21:22] [INFO ] Deduced a trap composed of 184 places in 246 ms of which 1 ms to minimize.
[2023-03-10 00:21:22] [INFO ] Deduced a trap composed of 182 places in 242 ms of which 1 ms to minimize.
[2023-03-10 00:21:23] [INFO ] Deduced a trap composed of 172 places in 271 ms of which 1 ms to minimize.
[2023-03-10 00:21:23] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 1 ms to minimize.
[2023-03-10 00:21:23] [INFO ] Deduced a trap composed of 159 places in 288 ms of which 1 ms to minimize.
[2023-03-10 00:21:24] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 1 ms to minimize.
[2023-03-10 00:21:24] [INFO ] Deduced a trap composed of 134 places in 291 ms of which 0 ms to minimize.
[2023-03-10 00:21:25] [INFO ] Deduced a trap composed of 136 places in 334 ms of which 1 ms to minimize.
[2023-03-10 00:21:25] [INFO ] Deduced a trap composed of 148 places in 319 ms of which 0 ms to minimize.
[2023-03-10 00:21:26] [INFO ] Deduced a trap composed of 186 places in 359 ms of which 1 ms to minimize.
[2023-03-10 00:21:26] [INFO ] Deduced a trap composed of 124 places in 351 ms of which 0 ms to minimize.
[2023-03-10 00:21:26] [INFO ] Deduced a trap composed of 176 places in 390 ms of which 2 ms to minimize.
[2023-03-10 00:21:27] [INFO ] Deduced a trap composed of 110 places in 370 ms of which 1 ms to minimize.
[2023-03-10 00:21:28] [INFO ] Deduced a trap composed of 100 places in 418 ms of which 1 ms to minimize.
[2023-03-10 00:21:28] [INFO ] Deduced a trap composed of 98 places in 406 ms of which 1 ms to minimize.
[2023-03-10 00:21:29] [INFO ] Deduced a trap composed of 88 places in 456 ms of which 1 ms to minimize.
[2023-03-10 00:21:29] [INFO ] Deduced a trap composed of 86 places in 434 ms of which 1 ms to minimize.
[2023-03-10 00:21:30] [INFO ] Deduced a trap composed of 76 places in 464 ms of which 1 ms to minimize.
[2023-03-10 00:21:31] [INFO ] Deduced a trap composed of 74 places in 451 ms of which 1 ms to minimize.
[2023-03-10 00:21:31] [INFO ] Deduced a trap composed of 170 places in 434 ms of which 2 ms to minimize.
[2023-03-10 00:21:32] [INFO ] Deduced a trap composed of 62 places in 473 ms of which 1 ms to minimize.
[2023-03-10 00:21:32] [INFO ] Deduced a trap composed of 64 places in 468 ms of which 1 ms to minimize.
[2023-03-10 00:21:33] [INFO ] Deduced a trap composed of 234 places in 494 ms of which 1 ms to minimize.
[2023-03-10 00:21:34] [INFO ] Deduced a trap composed of 50 places in 502 ms of which 2 ms to minimize.
[2023-03-10 00:21:34] [INFO ] Deduced a trap composed of 162 places in 518 ms of which 1 ms to minimize.
[2023-03-10 00:21:35] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 1 ms to minimize.
[2023-03-10 00:21:35] [INFO ] Deduced a trap composed of 28 places in 563 ms of which 2 ms to minimize.
[2023-03-10 00:21:36] [INFO ] Deduced a trap composed of 27 places in 548 ms of which 2 ms to minimize.
[2023-03-10 00:21:37] [INFO ] Deduced a trap composed of 18 places in 584 ms of which 1 ms to minimize.
[2023-03-10 00:21:38] [INFO ] Deduced a trap composed of 213 places in 555 ms of which 1 ms to minimize.
[2023-03-10 00:21:39] [INFO ] Deduced a trap composed of 249 places in 556 ms of which 1 ms to minimize.
[2023-03-10 00:21:40] [INFO ] Deduced a trap composed of 35 places in 329 ms of which 1 ms to minimize.
[2023-03-10 00:21:40] [INFO ] Deduced a trap composed of 40 places in 328 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 00:21:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 00:21:40] [INFO ] After 100215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :633 real:234
Interrupted random walk after 332683 steps, including 48084 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 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 89 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 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 95 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 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 92 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 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 87 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 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 76 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 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 96 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 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 89 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 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 93 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 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 84 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 86 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 89 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 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 94 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 86 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 98 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 60 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 57 ms. (steps per millisecond=17 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 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 86 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 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 86 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 59 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 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 867) seen :0
Probabilistic random walk after 1000001 steps, saw 500379 distinct states, run finished after 58176 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:23:11] [INFO ] Invariants computation overflowed in 132 ms
[2023-03-10 00:23:48] [INFO ] After 36595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:867
[2023-03-10 00:25:53] [INFO ] After 78561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :867
[2023-03-10 00:25:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:27:20] [INFO ] After 86360ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :867
[2023-03-10 00:27:20] [INFO ] Deduced a trap composed of 191 places in 291 ms of which 2 ms to minimize.
[2023-03-10 00:27:20] [INFO ] Deduced a trap composed of 207 places in 263 ms of which 1 ms to minimize.
[2023-03-10 00:27:21] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 1 ms to minimize.
[2023-03-10 00:27:21] [INFO ] Deduced a trap composed of 184 places in 254 ms of which 0 ms to minimize.
[2023-03-10 00:27:21] [INFO ] Deduced a trap composed of 182 places in 235 ms of which 0 ms to minimize.
[2023-03-10 00:27:22] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 1 ms to minimize.
[2023-03-10 00:27:22] [INFO ] Deduced a trap composed of 172 places in 252 ms of which 1 ms to minimize.
[2023-03-10 00:27:23] [INFO ] Deduced a trap composed of 146 places in 284 ms of which 1 ms to minimize.
[2023-03-10 00:27:23] [INFO ] Deduced a trap composed of 148 places in 300 ms of which 1 ms to minimize.
[2023-03-10 00:27:23] [INFO ] Deduced a trap composed of 134 places in 237 ms of which 1 ms to minimize.
[2023-03-10 00:27:24] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 1 ms to minimize.
[2023-03-10 00:27:24] [INFO ] Deduced a trap composed of 122 places in 243 ms of which 1 ms to minimize.
[2023-03-10 00:27:24] [INFO ] Deduced a trap composed of 166 places in 330 ms of which 1 ms to minimize.
[2023-03-10 00:27:25] [INFO ] Deduced a trap composed of 165 places in 293 ms of which 1 ms to minimize.
[2023-03-10 00:27:25] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 0 ms to minimize.
[2023-03-10 00:27:26] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 1 ms to minimize.
[2023-03-10 00:27:27] [INFO ] Deduced a trap composed of 98 places in 229 ms of which 1 ms to minimize.
[2023-03-10 00:27:27] [INFO ] Deduced a trap composed of 100 places in 238 ms of which 1 ms to minimize.
[2023-03-10 00:27:27] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 1 ms to minimize.
[2023-03-10 00:27:27] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 0 ms to minimize.
[2023-03-10 00:27:28] [INFO ] Deduced a trap composed of 155 places in 211 ms of which 1 ms to minimize.
[2023-03-10 00:27:28] [INFO ] Deduced a trap composed of 110 places in 205 ms of which 0 ms to minimize.
[2023-03-10 00:27:29] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 1 ms to minimize.
[2023-03-10 00:27:30] [INFO ] Deduced a trap composed of 64 places in 488 ms of which 1 ms to minimize.
[2023-03-10 00:27:30] [INFO ] Deduced a trap composed of 76 places in 461 ms of which 1 ms to minimize.
[2023-03-10 00:27:31] [INFO ] Deduced a trap composed of 74 places in 451 ms of which 1 ms to minimize.
[2023-03-10 00:27:33] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 13514 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 00:27:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 00:27:33] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:867
Fused 867 Parikh solutions to 814 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 867 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 898/898 transitions.
Applied a total of 0 rules in 34 ms. Remains 952 /952 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 952/952 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 898/898 transitions.
Applied a total of 0 rules in 24 ms. Remains 952 /952 variables (removed 0) and now considering 898/898 (removed 0) transitions.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:28:03] [INFO ] Invariants computation overflowed in 129 ms
[2023-03-10 00:28:04] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:28:04] [INFO ] Invariants computation overflowed in 124 ms
[2023-03-10 00:28:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 00:28:04] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2023-03-10 00:28:04] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:28:05] [INFO ] Invariants computation overflowed in 208 ms
[2023-03-10 00:28:06] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2627 ms. Remains : 952/952 places, 898/898 transitions.
Incomplete random walk after 100000 steps, including 14553 resets, run finished after 9577 ms. (steps per millisecond=10 ) properties (out of 867) seen :0
Running SMT prover for 867 properties.
// Phase 1: matrix 898 rows 952 cols
[2023-03-10 00:28:16] [INFO ] Invariants computation overflowed in 134 ms
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15476520 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16168032 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="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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