About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S24C11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9566.191 | 3600000.00 | 3714994.00 | 8001.70 | ??????????T??T?? | normal |
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.r234-tall-167856420900874.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 marciexred
Input is MultiCrashLeafsetExtension-PT-S24C11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420900874
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 14K Feb 26 02:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 02:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 02:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 19M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679631104652
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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 04:11:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 04:11:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 04:11:47] [INFO ] Load time of PNML (sax parser for PT used): 611 ms
[2023-03-24 04:11:47] [INFO ] Transformed 19254 places.
[2023-03-24 04:11:47] [INFO ] Transformed 27973 transitions.
[2023-03-24 04:11:47] [INFO ] Parsed PT model containing 19254 places and 27973 transitions and 103022 arcs in 826 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 333 out of 19254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19254/19254 places, 27973/27973 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 19204 transition count 27973
Applied a total of 50 rules in 864 ms. Remains 19204 /19254 variables (removed 50) and now considering 27973/27973 (removed 0) transitions.
[2023-03-24 04:11:48] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-24 04:11:51] [INFO ] Computed 1249 place invariants in 2653 ms
[2023-03-24 04:11:52] [INFO ] Implicit Places using invariants in 4458 ms returned []
Implicit Place search using SMT only with invariants took 4485 ms to find 0 implicit places.
[2023-03-24 04:11:52] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-24 04:11:52] [INFO ] Invariant cache hit.
[2023-03-24 04:11:54] [INFO ] Dead Transitions using invariants and state equation in 1638 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19204/19254 places, 27973/27973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6997 ms. Remains : 19204/19254 places, 27973/27973 transitions.
Support contains 333 out of 19204 places after structural reductions.
[2023-03-24 04:11:56] [INFO ] Flatten gal took : 1054 ms
[2023-03-24 04:11:56] [INFO ] Flatten gal took : 829 ms
[2023-03-24 04:11:58] [INFO ] Input system was already deterministic with 27973 transitions.
Support contains 331 out of 19204 places (down from 333) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 976 ms. (steps per millisecond=10 ) properties (out of 144) seen :22
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 122) seen :0
Running SMT prover for 122 properties.
[2023-03-24 04:11:59] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-24 04:11:59] [INFO ] Invariant cache hit.
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
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.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-24 04:12:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 04:12:25] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 122 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 288 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 5750 transitions
Trivial Post-agglo rules discarded 5750 transitions
Performed 5750 trivial Post agglomeration. Transition count delta: 5750
Iterating post reduction 0 with 5750 rules applied. Total rules applied 5750 place count 19204 transition count 22223
Reduce places removed 5750 places and 0 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 500
Iterating post reduction 1 with 6250 rules applied. Total rules applied 12000 place count 13454 transition count 21723
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 2 with 500 rules applied. Total rules applied 12500 place count 12954 transition count 21723
Performed 507 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 507 Pre rules applied. Total rules applied 12500 place count 12954 transition count 21216
Deduced a syphon composed of 507 places in 39 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 13514 place count 12447 transition count 21216
Discarding 5978 places :
Symmetric choice reduction at 3 with 5978 rule applications. Total rules 19492 place count 6469 transition count 15238
Iterating global reduction 3 with 5978 rules applied. Total rules applied 25470 place count 6469 transition count 15238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25470 place count 6469 transition count 15237
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25472 place count 6468 transition count 15237
Discarding 491 places :
Symmetric choice reduction at 3 with 491 rule applications. Total rules 25963 place count 5977 transition count 12566
Iterating global reduction 3 with 491 rules applied. Total rules applied 26454 place count 5977 transition count 12566
Discarding 215 places :
Symmetric choice reduction at 3 with 215 rule applications. Total rules 26669 place count 5762 transition count 10201
Iterating global reduction 3 with 215 rules applied. Total rules applied 26884 place count 5762 transition count 10201
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 13 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 26920 place count 5744 transition count 10183
Free-agglomeration rule (complex) applied 223 times.
Iterating global reduction 3 with 223 rules applied. Total rules applied 27143 place count 5744 transition count 9960
Reduce places removed 223 places and 0 transitions.
Iterating post reduction 3 with 223 rules applied. Total rules applied 27366 place count 5521 transition count 9960
Partial Free-agglomeration rule applied 482 times.
Drop transitions removed 482 transitions
Iterating global reduction 4 with 482 rules applied. Total rules applied 27848 place count 5521 transition count 9960
Applied a total of 27848 rules in 7162 ms. Remains 5521 /19204 variables (removed 13683) and now considering 9960/27973 (removed 18013) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7163 ms. Remains : 5521/19204 places, 9960/27973 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 122) seen :10
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 112) seen :0
Interrupted probabilistic random walk after 17456 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{15=1, 16=1, 24=1, 26=1, 51=1, 58=1, 97=1}
Probabilistic random walk after 17456 steps, saw 8425 distinct states, run finished after 3002 ms. (steps per millisecond=5 ) properties seen :7
Running SMT prover for 105 properties.
[2023-03-24 04:12:35] [INFO ] Flow matrix only has 9137 transitions (discarded 823 similar events)
// Phase 1: matrix 9137 rows 5521 cols
[2023-03-24 04:12:36] [INFO ] Computed 1249 place invariants in 312 ms
[2023-03-24 04:12:44] [INFO ] [Real]Absence check using 49 positive place invariants in 132 ms returned sat
[2023-03-24 04:12:44] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 368 ms returned sat
[2023-03-24 04:12:52] [INFO ] After 15786ms SMT Verify possible using all constraints in real domain returned unsat :20 sat :0 real:85
[2023-03-24 04:12:58] [INFO ] [Nat]Absence check using 49 positive place invariants in 114 ms returned sat
[2023-03-24 04:12:58] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 342 ms returned sat
[2023-03-24 04:13:17] [INFO ] After 11564ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :84
[2023-03-24 04:13:17] [INFO ] State equation strengthened by 4272 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-24 04:13:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 04:13:17] [INFO ] After 25123ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0 real:85
Fused 105 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 176 out of 5521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5521/5521 places, 9960/9960 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 5521 transition count 9934
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 5495 transition count 9934
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 52 place count 5495 transition count 9916
Deduced a syphon composed of 18 places in 9 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 88 place count 5477 transition count 9916
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 124 place count 5441 transition count 9760
Iterating global reduction 2 with 36 rules applied. Total rules applied 160 place count 5441 transition count 9760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 160 place count 5441 transition count 9759
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 5440 transition count 9759
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 179 place count 5423 transition count 9572
Iterating global reduction 2 with 17 rules applied. Total rules applied 196 place count 5423 transition count 9572
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 200 place count 5421 transition count 9570
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 225 place count 5421 transition count 9545
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 250 place count 5396 transition count 9545
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 255 place count 5391 transition count 9540
Iterating global reduction 3 with 5 rules applied. Total rules applied 260 place count 5391 transition count 9540
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 263 place count 5388 transition count 9507
Iterating global reduction 3 with 3 rules applied. Total rules applied 266 place count 5388 transition count 9507
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 300 place count 5388 transition count 9507
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 317 place count 5371 transition count 9490
Iterating global reduction 3 with 17 rules applied. Total rules applied 334 place count 5371 transition count 9490
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 349 place count 5356 transition count 9325
Iterating global reduction 3 with 15 rules applied. Total rules applied 364 place count 5356 transition count 9325
Applied a total of 364 rules in 4645 ms. Remains 5356 /5521 variables (removed 165) and now considering 9325/9960 (removed 635) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4645 ms. Remains : 5356/5521 places, 9325/9960 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 85) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 79) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 79) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 78) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 78) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 76) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 75) seen :0
Running SMT prover for 75 properties.
[2023-03-24 04:13:23] [INFO ] Flow matrix only has 8480 transitions (discarded 845 similar events)
// Phase 1: matrix 8480 rows 5356 cols
[2023-03-24 04:13:23] [INFO ] Computed 1249 place invariants in 260 ms
[2023-03-24 04:13:29] [INFO ] [Real]Absence check using 47 positive place invariants in 70 ms returned sat
[2023-03-24 04:13:29] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 356 ms returned sat
[2023-03-24 04:13:36] [INFO ] After 12302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:75
[2023-03-24 04:13:41] [INFO ] [Nat]Absence check using 47 positive place invariants in 68 ms returned sat
[2023-03-24 04:13:41] [INFO ] [Nat]Absence check using 47 positive and 1202 generalized place invariants in 361 ms returned sat
[2023-03-24 04:14:01] [INFO ] After 13561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :75
[2023-03-24 04:14:01] [INFO ] State equation strengthened by 3802 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-24 04:14:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 04:14:01] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:75
Fused 75 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 150 out of 5356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5356/5356 places, 9325/9325 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5356 transition count 9320
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5351 transition count 9320
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 5351 transition count 9314
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 5345 transition count 9314
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 5335 transition count 9264
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 5335 transition count 9264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 42 place count 5335 transition count 9261
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 5332 transition count 9261
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 5326 transition count 9195
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 5326 transition count 9195
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 5326 transition count 9195
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 5321 transition count 9190
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 5321 transition count 9190
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 5316 transition count 9135
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 5316 transition count 9135
Applied a total of 88 rules in 2658 ms. Remains 5316 /5356 variables (removed 40) and now considering 9135/9325 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2658 ms. Remains : 5316/5356 places, 9135/9325 transitions.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 04:14:04] [INFO ] Flatten gal took : 691 ms
[2023-03-24 04:14:05] [INFO ] Flatten gal took : 728 ms
[2023-03-24 04:14:06] [INFO ] Input system was already deterministic with 27973 transitions.
Support contains 201 out of 19204 places (down from 206) after GAL structural reductions.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16580 stabilizing places and 22772 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6599 transitions
Trivial Post-agglo rules discarded 6599 transitions
Performed 6599 trivial Post agglomeration. Transition count delta: 6599
Iterating post reduction 0 with 6599 rules applied. Total rules applied 6599 place count 19204 transition count 21374
Reduce places removed 6599 places and 0 transitions.
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20824
Deduced a syphon composed of 550 places in 33 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 2 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 2 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 26986 place count 5437 transition count 8726
Iterating global reduction 2 with 548 rules applied. Total rules applied 27534 place count 5437 transition count 8726
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 10 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27584 place count 5412 transition count 8701
Applied a total of 27584 rules in 3690 ms. Remains 5412 /19204 variables (removed 13792) and now considering 8701/27973 (removed 19272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3696 ms. Remains : 5412/19204 places, 8701/27973 transitions.
[2023-03-24 04:14:10] [INFO ] Flatten gal took : 221 ms
[2023-03-24 04:14:11] [INFO ] Flatten gal took : 249 ms
[2023-03-24 04:14:11] [INFO ] Input system was already deterministic with 8701 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 508 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:14:12] [INFO ] Flatten gal took : 621 ms
[2023-03-24 04:14:13] [INFO ] Flatten gal took : 679 ms
[2023-03-24 04:14:14] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 562 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:14:16] [INFO ] Flatten gal took : 672 ms
[2023-03-24 04:14:16] [INFO ] Flatten gal took : 709 ms
[2023-03-24 04:14:18] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6588 transitions
Trivial Post-agglo rules discarded 6588 transitions
Performed 6588 trivial Post agglomeration. Transition count delta: 6588
Iterating post reduction 0 with 6588 rules applied. Total rules applied 6588 place count 19204 transition count 21385
Reduce places removed 6588 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13188 place count 12616 transition count 21373
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20824
Deduced a syphon composed of 549 places in 32 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20347 place count 6006 transition count 14775
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14754
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26438 place count 5985 transition count 14754
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26987 place count 5436 transition count 8715
Iterating global reduction 3 with 549 rules applied. Total rules applied 27536 place count 5436 transition count 8715
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 10 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27586 place count 5411 transition count 8690
Applied a total of 27586 rules in 3428 ms. Remains 5411 /19204 variables (removed 13793) and now considering 8690/27973 (removed 19283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3429 ms. Remains : 5411/19204 places, 8690/27973 transitions.
[2023-03-24 04:14:21] [INFO ] Flatten gal took : 199 ms
[2023-03-24 04:14:22] [INFO ] Flatten gal took : 243 ms
[2023-03-24 04:14:22] [INFO ] Input system was already deterministic with 8690 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23117 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23117 steps, saw 10997 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:14:25] [INFO ] Flow matrix only has 8090 transitions (discarded 600 similar events)
// Phase 1: matrix 8090 rows 5411 cols
[2023-03-24 04:14:26] [INFO ] Computed 1249 place invariants in 256 ms
[2023-03-24 04:14:26] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2023-03-24 04:14:27] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 361 ms returned sat
[2023-03-24 04:14:32] [INFO ] After 6040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:14:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2023-03-24 04:14:33] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 361 ms returned sat
[2023-03-24 04:14:38] [INFO ] After 4903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:14:38] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2023-03-24 04:14:39] [INFO ] After 1115ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:14:45] [INFO ] Deduced a trap composed of 593 places in 5564 ms of which 6 ms to minimize.
[2023-03-24 04:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6628 ms
[2023-03-24 04:14:46] [INFO ] After 8000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-24 04:14:46] [INFO ] After 14345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5411/5411 places, 8690/8690 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5411 transition count 13843
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5074 transition count 13843
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 698 place count 5074 transition count 13843
Applied a total of 698 rules in 2591 ms. Remains 5074 /5411 variables (removed 337) and now considering 13843/8690 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2592 ms. Remains : 5074/5411 places, 13843/8690 transitions.
Interrupted random walk after 484117 steps, including 7146 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 538381 steps, including 1083 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
Interrupted probabilistic random walk after 653365 steps, run timeout after 105001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 653365 steps, saw 284721 distinct states, run finished after 105004 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:17:09] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2023-03-24 04:17:09] [INFO ] Computed 1249 place invariants in 360 ms
[2023-03-24 04:17:10] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2023-03-24 04:17:10] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 332 ms returned sat
[2023-03-24 04:17:10] [INFO ] After 1052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:17:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2023-03-24 04:17:11] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 374 ms returned sat
[2023-03-24 04:17:18] [INFO ] After 6795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:17:18] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:17:22] [INFO ] After 3561ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:17:22] [INFO ] After 4413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 530 ms.
[2023-03-24 04:17:23] [INFO ] After 12897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 279 ms.
Support contains 2 out of 5074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 906 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 914 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
[2023-03-24 04:17:25] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:17:25] [INFO ] Invariant cache hit.
[2023-03-24 04:17:32] [INFO ] Implicit Places using invariants in 6422 ms returned []
Implicit Place search using SMT only with invariants took 6426 ms to find 0 implicit places.
[2023-03-24 04:17:32] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:17:32] [INFO ] Invariant cache hit.
[2023-03-24 04:17:39] [INFO ] Dead Transitions using invariants and state equation in 7659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15013 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Incomplete random walk after 100000 steps, including 1475 resets, run finished after 7585 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 04:17:47] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:17:47] [INFO ] Invariant cache hit.
[2023-03-24 04:17:47] [INFO ] [Real]Absence check using 49 positive place invariants in 86 ms returned sat
[2023-03-24 04:17:48] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 356 ms returned sat
[2023-03-24 04:17:56] [INFO ] After 7960ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-24 04:17:56] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:17:58] [INFO ] After 1656ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-24 04:17:59] [INFO ] After 3042ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:17:59] [INFO ] After 12078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:17:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-24 04:18:00] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 349 ms returned sat
[2023-03-24 04:18:06] [INFO ] After 5966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 04:18:07] [INFO ] After 1257ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 04:18:08] [INFO ] After 2680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-24 04:18:09] [INFO ] After 9744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Interrupted random walk after 480766 steps, including 7097 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Interrupted Best-First random walk after 518871 steps, including 1044 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted probabilistic random walk after 657361 steps, run timeout after 105001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 657361 steps, saw 286402 distinct states, run finished after 105004 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:20:29] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:20:29] [INFO ] Invariant cache hit.
[2023-03-24 04:20:29] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 04:20:30] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 346 ms returned sat
[2023-03-24 04:20:37] [INFO ] After 7326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 04:20:37] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:20:40] [INFO ] After 3160ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:20:40] [INFO ] After 11611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:20:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-24 04:20:41] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 360 ms returned sat
[2023-03-24 04:20:48] [INFO ] After 6396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:20:51] [INFO ] After 2868ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:20:51] [INFO ] After 3569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 462 ms.
[2023-03-24 04:20:52] [INFO ] After 11462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 266 ms.
Support contains 2 out of 5074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 842 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 844 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Applied a total of 0 rules in 844 ms. Remains 5074 /5074 variables (removed 0) and now considering 13843/13843 (removed 0) transitions.
[2023-03-24 04:20:54] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:20:54] [INFO ] Invariant cache hit.
[2023-03-24 04:21:00] [INFO ] Implicit Places using invariants in 6701 ms returned []
Implicit Place search using SMT only with invariants took 6702 ms to find 0 implicit places.
[2023-03-24 04:21:00] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:21:00] [INFO ] Invariant cache hit.
[2023-03-24 04:21:08] [INFO ] Dead Transitions using invariants and state equation in 7962 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15515 ms. Remains : 5074/5074 places, 13843/13843 transitions.
Incomplete random walk after 100000 steps, including 1475 resets, run finished after 7287 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 04:21:16] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:21:16] [INFO ] Invariant cache hit.
[2023-03-24 04:21:16] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2023-03-24 04:21:17] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 342 ms returned sat
[2023-03-24 04:21:25] [INFO ] After 7979ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-24 04:21:25] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:21:26] [INFO ] After 1596ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-24 04:21:27] [INFO ] After 2886ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:21:27] [INFO ] After 11797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 04:21:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-24 04:21:28] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 371 ms returned sat
[2023-03-24 04:21:35] [INFO ] After 6271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 04:21:36] [INFO ] After 1273ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 04:21:37] [INFO ] After 2580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-24 04:21:37] [INFO ] After 9913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 147 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19296 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19296 steps, saw 9077 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:21:41] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
[2023-03-24 04:21:41] [INFO ] Invariant cache hit.
[2023-03-24 04:21:42] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-24 04:21:42] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 346 ms returned sat
[2023-03-24 04:21:42] [INFO ] After 1013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:21:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 04:21:43] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 350 ms returned sat
[2023-03-24 04:21:50] [INFO ] After 7146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:21:50] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:21:52] [INFO ] After 1784ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:21:53] [INFO ] After 2384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-24 04:21:53] [INFO ] After 11073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 5074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 5074 transition count 13842
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5073 transition count 13842
Applied a total of 3 rules in 1733 ms. Remains 5073 /5074 variables (removed 1) and now considering 13842/13843 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1734 ms. Remains : 5073/5074 places, 13842/13843 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19398 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19398 steps, saw 9124 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:21:59] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2023-03-24 04:21:59] [INFO ] Computed 1249 place invariants in 348 ms
[2023-03-24 04:22:00] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2023-03-24 04:22:00] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 328 ms returned sat
[2023-03-24 04:22:09] [INFO ] After 9117ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 04:22:09] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:22:11] [INFO ] After 1895ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:22:11] [INFO ] After 12073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:22:12] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2023-03-24 04:22:12] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 350 ms returned sat
[2023-03-24 04:22:21] [INFO ] After 8605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:22:24] [INFO ] After 3032ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:22:25] [INFO ] After 3662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-24 04:22:25] [INFO ] After 13742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 931 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 936 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2023-03-24 04:22:27] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-24 04:22:27] [INFO ] Invariant cache hit.
[2023-03-24 04:22:34] [INFO ] Implicit Places using invariants in 7087 ms returned [3807]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 7101 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 5072/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 931 ms. Remains 5072 /5072 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8971 ms. Remains : 5072/5073 places, 13842/13842 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19726 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19726 steps, saw 9274 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:22:39] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5072 cols
[2023-03-24 04:22:39] [INFO ] Computed 1248 place invariants in 350 ms
[2023-03-24 04:22:40] [INFO ] [Real]Absence check using 49 positive place invariants in 87 ms returned sat
[2023-03-24 04:22:40] [INFO ] [Real]Absence check using 49 positive and 1199 generalized place invariants in 341 ms returned sat
[2023-03-24 04:22:48] [INFO ] After 7824ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 04:22:48] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:22:50] [INFO ] After 2098ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:22:50] [INFO ] After 11059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:22:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 98 ms returned sat
[2023-03-24 04:22:51] [INFO ] [Nat]Absence check using 49 positive and 1199 generalized place invariants in 345 ms returned sat
[2023-03-24 04:23:00] [INFO ] After 8359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:23:03] [INFO ] After 3893ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:23:04] [INFO ] After 4544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-24 04:23:04] [INFO ] After 14378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5072 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5072/5072 places, 13842/13842 transitions.
Applied a total of 0 rules in 955 ms. Remains 5072 /5072 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 5072/5072 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5072/5072 places, 13842/13842 transitions.
Applied a total of 0 rules in 947 ms. Remains 5072 /5072 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2023-03-24 04:23:06] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-24 04:23:06] [INFO ] Invariant cache hit.
[2023-03-24 04:23:13] [INFO ] Implicit Places using invariants in 6319 ms returned []
Implicit Place search using SMT only with invariants took 6319 ms to find 0 implicit places.
[2023-03-24 04:23:13] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-24 04:23:13] [INFO ] Invariant cache hit.
[2023-03-24 04:23:21] [INFO ] Dead Transitions using invariants and state equation in 8202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15474 ms. Remains : 5072/5072 places, 13842/13842 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19846 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19846 steps, saw 9328 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:23:25] [INFO ] Flow matrix only has 12957 transitions (discarded 886 similar events)
// Phase 1: matrix 12957 rows 5074 cols
[2023-03-24 04:23:25] [INFO ] Computed 1249 place invariants in 404 ms
[2023-03-24 04:23:26] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2023-03-24 04:23:26] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 326 ms returned sat
[2023-03-24 04:23:33] [INFO ] After 7367ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 04:23:34] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:23:35] [INFO ] After 1244ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:23:35] [INFO ] After 9675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:23:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-24 04:23:36] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 345 ms returned sat
[2023-03-24 04:23:45] [INFO ] After 8737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:23:48] [INFO ] After 3310ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:23:49] [INFO ] After 3973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 428 ms.
[2023-03-24 04:23:49] [INFO ] After 14158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 5074 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5074/5074 places, 13843/13843 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5073 transition count 13842
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5073 transition count 13842
Applied a total of 2 rules in 1199 ms. Remains 5073 /5074 variables (removed 1) and now considering 13842/13843 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 5073/5074 places, 13842/13843 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19634 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19634 steps, saw 9231 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:23:54] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2023-03-24 04:23:54] [INFO ] Computed 1249 place invariants in 370 ms
[2023-03-24 04:23:55] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-24 04:23:55] [INFO ] [Real]Absence check using 49 positive and 1200 generalized place invariants in 336 ms returned sat
[2023-03-24 04:24:03] [INFO ] After 7428ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 04:24:03] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-24 04:24:04] [INFO ] After 1199ms SMT Verify possible using 8602 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:24:04] [INFO ] After 9705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:24:05] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-24 04:24:05] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 348 ms returned sat
[2023-03-24 04:24:13] [INFO ] After 7544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:24:16] [INFO ] After 3330ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:24:17] [INFO ] After 3977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 434 ms.
[2023-03-24 04:24:17] [INFO ] After 12990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 909 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 909 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 865 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2023-03-24 04:24:19] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-24 04:24:19] [INFO ] Invariant cache hit.
[2023-03-24 04:24:24] [INFO ] Implicit Places using invariants in 4831 ms returned []
Implicit Place search using SMT only with invariants took 4838 ms to find 0 implicit places.
[2023-03-24 04:24:24] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-24 04:24:24] [INFO ] Invariant cache hit.
[2023-03-24 04:24:32] [INFO ] Dead Transitions using invariants and state equation in 8449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14161 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Graph (trivial) has 3579 edges and 5073 vertex of which 25 / 5073 are part of one of the 1 SCC in 8 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51797 edges and 5049 vertex of which 5027 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t7279 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4641 transition count 12113
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4399 transition count 11632
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4158 transition count 11192
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3918 transition count 10794
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3718 transition count 10434
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3520 transition count 10112
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3358 transition count 9824
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3198 transition count 9570
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3070 transition count 9346
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2944 transition count 9152
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2846 transition count 8984
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2750 transition count 8842
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2678 transition count 8722
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2608 transition count 8624
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2558 transition count 8544
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 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 15 with 110 rules applied. Total rules applied 6007 place count 2510 transition count 8482
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2478 transition count 8434
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2448 transition count 8400
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2430 transition count 8376
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2414 transition count 8362
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2406 transition count 8354
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2399 transition count 8352
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2397 transition count 8352
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2397 transition count 7802
Deduced a syphon composed of 550 places in 4 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7899 place count 1298 transition count 7802
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8450 place count 747 transition count 7251
Iterating global reduction 23 with 551 rules applied. Total rules applied 9001 place count 747 transition count 7251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9001 place count 747 transition count 7250
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9003 place count 746 transition count 7250
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9543 place count 206 transition count 1310
Iterating global reduction 23 with 540 rules applied. Total rules applied 10083 place count 206 transition count 1310
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10623 place count 206 transition count 770
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10674 place count 180 transition count 745
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10696 place count 180 transition count 723
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10718 place count 158 transition count 723
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10740 place count 136 transition count 481
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10773 place count 125 transition count 481
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10795 place count 125 transition count 459
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10806 place count 114 transition count 338
Iterating global reduction 26 with 11 rules applied. Total rules applied 10817 place count 114 transition count 338
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10828 place count 103 transition count 327
Iterating global reduction 26 with 11 rules applied. Total rules applied 10839 place count 103 transition count 327
Applied a total of 10839 rules in 9608 ms. Remains 103 /5073 variables (removed 4970) and now considering 327/13842 (removed 13515) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 327 rows 103 cols
[2023-03-24 04:24:42] [INFO ] Computed 38 place invariants in 8 ms
[2023-03-24 04:24:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-24 04:24:42] [INFO ] [Real]Absence check using 3 positive and 35 generalized place invariants in 6 ms returned sat
[2023-03-24 04:24:42] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:24:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-24 04:24:42] [INFO ] [Nat]Absence check using 3 positive and 35 generalized place invariants in 11 ms returned sat
[2023-03-24 04:24:42] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:24:42] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 04:24:42] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 3579 edges and 5074 vertex of which 25 / 5074 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51799 edges and 5050 vertex of which 5028 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t7279 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4642 transition count 12114
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4400 transition count 11633
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4159 transition count 11193
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3919 transition count 10795
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3719 transition count 10435
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3521 transition count 10113
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3359 transition count 9825
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3199 transition count 9571
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3071 transition count 9347
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2945 transition count 9153
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2847 transition count 8985
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2751 transition count 8843
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2679 transition count 8723
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2609 transition count 8625
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2559 transition count 8545
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 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 15 with 110 rules applied. Total rules applied 6007 place count 2511 transition count 8483
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2479 transition count 8435
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2449 transition count 8401
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2431 transition count 8377
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2415 transition count 8363
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2407 transition count 8355
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2400 transition count 8353
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2398 transition count 8353
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2398 transition count 7803
Deduced a syphon composed of 550 places in 3 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7899 place count 1299 transition count 7803
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8450 place count 748 transition count 7252
Iterating global reduction 23 with 551 rules applied. Total rules applied 9001 place count 748 transition count 7252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9001 place count 748 transition count 7251
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9003 place count 747 transition count 7251
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 9543 place count 207 transition count 1311
Iterating global reduction 23 with 540 rules applied. Total rules applied 10083 place count 207 transition count 1311
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 10623 place count 207 transition count 771
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10674 place count 181 transition count 746
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10696 place count 181 transition count 724
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10718 place count 159 transition count 724
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10740 place count 137 transition count 482
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10773 place count 126 transition count 482
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10795 place count 126 transition count 460
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10806 place count 115 transition count 339
Iterating global reduction 26 with 11 rules applied. Total rules applied 10817 place count 115 transition count 339
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10828 place count 104 transition count 328
Iterating global reduction 26 with 11 rules applied. Total rules applied 10839 place count 104 transition count 328
Applied a total of 10839 rules in 9257 ms. Remains 104 /5074 variables (removed 4970) and now considering 328/13843 (removed 13515) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 328 rows 104 cols
[2023-03-24 04:24:51] [INFO ] Computed 38 place invariants in 10 ms
[2023-03-24 04:24:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-24 04:24:51] [INFO ] [Real]Absence check using 3 positive and 35 generalized place invariants in 6 ms returned sat
[2023-03-24 04:24:51] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:24:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-24 04:24:51] [INFO ] [Nat]Absence check using 3 positive and 35 generalized place invariants in 5 ms returned sat
[2023-03-24 04:24:51] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:24:51] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-24 04:24:51] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 530 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:24:53] [INFO ] Flatten gal took : 626 ms
[2023-03-24 04:24:53] [INFO ] Flatten gal took : 699 ms
[2023-03-24 04:24:55] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 525 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:24:56] [INFO ] Flatten gal took : 704 ms
[2023-03-24 04:24:57] [INFO ] Flatten gal took : 778 ms
[2023-03-24 04:24:58] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 516 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:00] [INFO ] Flatten gal took : 704 ms
[2023-03-24 04:25:00] [INFO ] Flatten gal took : 774 ms
[2023-03-24 04:25:02] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 498 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:03] [INFO ] Flatten gal took : 611 ms
[2023-03-24 04:25:04] [INFO ] Flatten gal took : 685 ms
[2023-03-24 04:25:05] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6587 transitions
Trivial Post-agglo rules discarded 6587 transitions
Performed 6587 trivial Post agglomeration. Transition count delta: 6587
Iterating post reduction 0 with 6587 rules applied. Total rules applied 6587 place count 19204 transition count 21386
Reduce places removed 6587 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13186 place count 12617 transition count 21374
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20825
Deduced a syphon composed of 549 places in 28 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14296 place count 12056 transition count 20825
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20344 place count 6008 transition count 14777
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14757
Deduced a syphon composed of 20 places in 19 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26432 place count 5988 transition count 14757
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 26979 place count 5441 transition count 8740
Iterating global reduction 3 with 547 rules applied. Total rules applied 27526 place count 5441 transition count 8740
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27576 place count 5416 transition count 8715
Applied a total of 27576 rules in 3400 ms. Remains 5416 /19204 variables (removed 13788) and now considering 8715/27973 (removed 19258) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3400 ms. Remains : 5416/19204 places, 8715/27973 transitions.
[2023-03-24 04:25:09] [INFO ] Flatten gal took : 191 ms
[2023-03-24 04:25:09] [INFO ] Flatten gal took : 219 ms
[2023-03-24 04:25:09] [INFO ] Input system was already deterministic with 8715 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 502 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:10] [INFO ] Flatten gal took : 625 ms
[2023-03-24 04:25:11] [INFO ] Flatten gal took : 692 ms
[2023-03-24 04:25:12] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 507 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:14] [INFO ] Flatten gal took : 621 ms
[2023-03-24 04:25:14] [INFO ] Flatten gal took : 683 ms
[2023-03-24 04:25:15] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 535 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:17] [INFO ] Flatten gal took : 617 ms
[2023-03-24 04:25:17] [INFO ] Flatten gal took : 686 ms
[2023-03-24 04:25:19] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 533 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:20] [INFO ] Flatten gal took : 618 ms
[2023-03-24 04:25:21] [INFO ] Flatten gal took : 678 ms
[2023-03-24 04:25:22] [INFO ] Input system was already deterministic with 27973 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 505 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 19204/19204 places, 27973/27973 transitions.
[2023-03-24 04:25:23] [INFO ] Flatten gal took : 640 ms
[2023-03-24 04:25:24] [INFO ] Flatten gal took : 670 ms
[2023-03-24 04:25:25] [INFO ] Input system was already deterministic with 27973 transitions.
[2023-03-24 04:25:26] [INFO ] Flatten gal took : 658 ms
[2023-03-24 04:25:26] [INFO ] Flatten gal took : 683 ms
[2023-03-24 04:25:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-24 04:25:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 19204 places, 27973 transitions and 102972 arcs took 95 ms.
Total runtime 820591 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 19204 NrTr: 27973 NrArc: 102972)
parse formulas
formulas created successfully
place and transition orderings generation:1m43.340sec
net check time: 0m 0.018sec
init dd package: 0m 2.730sec
before gc: list nodes free: 1808367
after gc: idd nodes used:11314, unused:63988686; list nodes free:257870454
before gc: list nodes free: 1777143
after gc: idd nodes used:15999, unused:63984001; list nodes free:257837591
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6540828 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16058344 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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 4.179sec
54403 83394 119292
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="MultiCrashLeafsetExtension-PT-S24C11"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420900874"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C11.tgz
mv MultiCrashLeafsetExtension-PT-S24C11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;