fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419600953
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S32C10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14667.951 3600000.00 5938140.00 6503.90 ???????F??F?FFFF 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.r233-tall-167856419600953.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S32C10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419600953
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 11K Feb 26 03:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:26 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 32M 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-S32C10-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679676476249

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 16:47:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 16:47:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 16:47:58] [INFO ] Load time of PNML (sax parser for PT used): 1150 ms
[2023-03-24 16:47:58] [INFO ] Transformed 32088 places.
[2023-03-24 16:47:59] [INFO ] Transformed 48223 transitions.
[2023-03-24 16:47:59] [INFO ] Parsed PT model containing 32088 places and 48223 transitions and 181342 arcs in 1373 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Support contains 124 out of 32088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 32033 transition count 48223
Applied a total of 55 rules in 2489 ms. Remains 32033 /32088 variables (removed 55) and now considering 48223/48223 (removed 0) transitions.
[2023-03-24 16:48:02] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32033 cols
[2023-03-24 16:48:09] [INFO ] Computed 1838 place invariants in 7639 ms
[2023-03-24 16:48:12] [INFO ] Implicit Places using invariants in 10306 ms returned []
Implicit Place search using SMT only with invariants took 10331 ms to find 0 implicit places.
[2023-03-24 16:48:12] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 16:48:12] [INFO ] Invariant cache hit.
[2023-03-24 16:48:14] [INFO ] Dead Transitions using invariants and state equation in 2489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32033/32088 places, 48223/48223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15319 ms. Remains : 32033/32088 places, 48223/48223 transitions.
Support contains 124 out of 32033 places after structural reductions.
[2023-03-24 16:48:16] [INFO ] Flatten gal took : 1645 ms
[2023-03-24 16:48:18] [INFO ] Flatten gal took : 1315 ms
[2023-03-24 16:48:20] [INFO ] Input system was already deterministic with 48223 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 69) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 63) 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 63) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) 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 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) 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 61) 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 61) 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 61) 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 61) 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 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) 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 61) 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 61) 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 61) 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 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) 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 61) 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 61) 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 61) seen :0
Running SMT prover for 61 properties.
[2023-03-24 16:48:22] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
[2023-03-24 16:48:22] [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 16:48:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 16:48:47] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 61 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 106 out of 32033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Drop transitions removed 10426 transitions
Trivial Post-agglo rules discarded 10426 transitions
Performed 10426 trivial Post agglomeration. Transition count delta: 10426
Iterating post reduction 0 with 10426 rules applied. Total rules applied 10426 place count 32033 transition count 37797
Reduce places removed 10426 places and 0 transitions.
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Iterating post reduction 1 with 10531 rules applied. Total rules applied 20957 place count 21607 transition count 37692
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 2 with 105 rules applied. Total rules applied 21062 place count 21502 transition count 37692
Performed 654 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 654 Pre rules applied. Total rules applied 21062 place count 21502 transition count 37038
Deduced a syphon composed of 654 places in 47 ms
Reduce places removed 654 places and 0 transitions.
Iterating global reduction 3 with 1308 rules applied. Total rules applied 22370 place count 20848 transition count 37038
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 42 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22436 place count 20815 transition count 37005
Free-agglomeration rule (complex) applied 1558 times.
Iterating global reduction 3 with 1558 rules applied. Total rules applied 23994 place count 20815 transition count 35447
Reduce places removed 1558 places and 0 transitions.
Iterating post reduction 3 with 1558 rules applied. Total rules applied 25552 place count 19257 transition count 35447
Partial Free-agglomeration rule applied 9898 times.
Drop transitions removed 9898 transitions
Iterating global reduction 4 with 9898 rules applied. Total rules applied 35450 place count 19257 transition count 35447
Applied a total of 35450 rules in 10871 ms. Remains 19257 /32033 variables (removed 12776) and now considering 35447/48223 (removed 12776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10873 ms. Remains : 19257/32033 places, 35447/48223 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1275 ms. (steps per millisecond=7 ) properties (out of 61) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 57) seen :0
Interrupted probabilistic random walk after 7738 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7738 steps, saw 3768 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 57 properties.
[2023-03-24 16:49:03] [INFO ] Flow matrix only has 33884 transitions (discarded 1563 similar events)
// Phase 1: matrix 33884 rows 19257 cols
[2023-03-24 16:49:15] [INFO ] Computed 1838 place invariants in 11128 ms
[2023-03-24 16:49:29] [INFO ] [Real]Absence check using 65 positive place invariants in 220 ms returned sat
[2023-03-24 16:49:31] [INFO ] [Real]Absence check using 65 positive and 1773 generalized place invariants in 1153 ms returned sat
[2023-03-24 16:49:31] [INFO ] After 16071ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:56
[2023-03-24 16:49:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 204 ms returned sat
[2023-03-24 16:49:46] [INFO ] [Nat]Absence check using 65 positive and 1773 generalized place invariants in 1142 ms returned sat
[2023-03-24 16:49:56] [INFO ] After 5239ms SMT Verify possible using state equation in natural domain returned unsat :39 sat :17
[2023-03-24 16:49:56] [INFO ] State equation strengthened by 15490 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 16:49:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 16:49:56] [INFO ] After 25764ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:56
Fused 57 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 19257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19257/19257 places, 35447/35447 transitions.
Graph (complete) has 141870 edges and 19257 vertex of which 19256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 16 rules applied. Total rules applied 17 place count 19256 transition count 35431
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 19240 transition count 35431
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 33 place count 19240 transition count 35425
Deduced a syphon composed of 6 places in 26 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 19234 transition count 35425
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 58 place count 19234 transition count 35412
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 71 place count 19221 transition count 35412
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 146 place count 19221 transition count 35412
Applied a total of 146 rules in 4133 ms. Remains 19221 /19257 variables (removed 36) and now considering 35412/35447 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4134 ms. Remains : 19221/19257 places, 35412/35447 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1197 ms. (steps per millisecond=8 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-24 16:50:02] [INFO ] Flow matrix only has 33846 transitions (discarded 1566 similar events)
// Phase 1: matrix 33846 rows 19221 cols
[2023-03-24 16:50:13] [INFO ] Computed 1837 place invariants in 11107 ms
[2023-03-24 16:50:18] [INFO ] After 5396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 16:50:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 175 ms returned sat
[2023-03-24 16:50:25] [INFO ] [Nat]Absence check using 65 positive and 1772 generalized place invariants in 1167 ms returned sat
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:629)
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 16:50:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 16:50:43] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 19221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19221/19221 places, 35412/35412 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19221 transition count 35409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19218 transition count 35409
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 19218 transition count 35408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19217 transition count 35408
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 11 place count 19217 transition count 35408
Applied a total of 11 rules in 4074 ms. Remains 19217 /19221 variables (removed 4) and now considering 35408/35412 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4074 ms. Remains : 19217/19221 places, 35408/35412 transitions.
Successfully simplified 39 atomic propositions for a total of 16 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 16:50:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 16:50:49] [INFO ] Flatten gal took : 1072 ms
[2023-03-24 16:50:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 16:50:50] [INFO ] Flatten gal took : 1160 ms
[2023-03-24 16:50:52] [INFO ] Input system was already deterministic with 48223 transitions.
Support contains 34 out of 32033 places (down from 42) after GAL structural reductions.
Computed a total of 26017 stabilizing places and 36254 stable transitions
Graph (complete) has 132231 edges and 32033 vertex of which 32032 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.136 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Graph (complete) has 132231 edges and 32033 vertex of which 32032 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.103 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10556 transitions
Trivial Post-agglo rules discarded 10556 transitions
Performed 10556 trivial Post agglomeration. Transition count delta: 10556
Iterating post reduction 0 with 10556 rules applied. Total rules applied 10557 place count 32032 transition count 37667
Reduce places removed 10556 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10558 rules applied. Total rules applied 21115 place count 21476 transition count 37665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21117 place count 21474 transition count 37665
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 660 Pre rules applied. Total rules applied 21117 place count 21474 transition count 37005
Deduced a syphon composed of 660 places in 45 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 3 with 1320 rules applied. Total rules applied 22437 place count 20814 transition count 37005
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 43 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22503 place count 20781 transition count 36972
Applied a total of 22503 rules in 5469 ms. Remains 20781 /32033 variables (removed 11252) and now considering 36972/48223 (removed 11251) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5472 ms. Remains : 20781/32033 places, 36972/48223 transitions.
[2023-03-24 16:50:59] [INFO ] Flatten gal took : 830 ms
[2023-03-24 16:51:00] [INFO ] Flatten gal took : 958 ms
[2023-03-24 16:51:01] [INFO ] Input system was already deterministic with 36972 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1657 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1658 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:04] [INFO ] Flatten gal took : 1093 ms
[2023-03-24 16:51:05] [INFO ] Flatten gal took : 1209 ms
[2023-03-24 16:51:08] [INFO ] Input system was already deterministic with 48223 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Graph (complete) has 132231 edges and 32033 vertex of which 32032 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.58 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10557 transitions
Trivial Post-agglo rules discarded 10557 transitions
Performed 10557 trivial Post agglomeration. Transition count delta: 10557
Iterating post reduction 0 with 10557 rules applied. Total rules applied 10558 place count 32032 transition count 37666
Reduce places removed 10557 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10559 rules applied. Total rules applied 21117 place count 21475 transition count 37664
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21119 place count 21473 transition count 37664
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 660 Pre rules applied. Total rules applied 21119 place count 21473 transition count 37004
Deduced a syphon composed of 660 places in 46 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 3 with 1320 rules applied. Total rules applied 22439 place count 20813 transition count 37004
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 35 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22505 place count 20780 transition count 36971
Applied a total of 22505 rules in 5326 ms. Remains 20780 /32033 variables (removed 11253) and now considering 36971/48223 (removed 11252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5328 ms. Remains : 20780/32033 places, 36971/48223 transitions.
[2023-03-24 16:51:14] [INFO ] Flatten gal took : 811 ms
[2023-03-24 16:51:15] [INFO ] Flatten gal took : 940 ms
[2023-03-24 16:51:17] [INFO ] Input system was already deterministic with 36971 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1684 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1687 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:20] [INFO ] Flatten gal took : 1082 ms
[2023-03-24 16:51:21] [INFO ] Flatten gal took : 1218 ms
[2023-03-24 16:51:23] [INFO ] Input system was already deterministic with 48223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1584 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1585 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:26] [INFO ] Flatten gal took : 1120 ms
[2023-03-24 16:51:27] [INFO ] Flatten gal took : 1254 ms
[2023-03-24 16:51:29] [INFO ] Input system was already deterministic with 48223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1594 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1596 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:32] [INFO ] Flatten gal took : 1086 ms
[2023-03-24 16:51:34] [INFO ] Flatten gal took : 1174 ms
[2023-03-24 16:51:36] [INFO ] Input system was already deterministic with 48223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1581 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1582 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:38] [INFO ] Flatten gal took : 1107 ms
[2023-03-24 16:51:40] [INFO ] Flatten gal took : 1183 ms
[2023-03-24 16:51:42] [INFO ] Input system was already deterministic with 48223 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Graph (complete) has 132231 edges and 32033 vertex of which 32032 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.54 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 10559 transitions
Trivial Post-agglo rules discarded 10559 transitions
Performed 10559 trivial Post agglomeration. Transition count delta: 10559
Iterating post reduction 0 with 10559 rules applied. Total rules applied 10560 place count 32032 transition count 37664
Reduce places removed 10559 places and 0 transitions.
Iterating post reduction 1 with 10559 rules applied. Total rules applied 21119 place count 21473 transition count 37664
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21119 place count 21473 transition count 37004
Deduced a syphon composed of 660 places in 46 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22439 place count 20813 transition count 37004
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 35 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 22505 place count 20780 transition count 36971
Applied a total of 22505 rules in 5277 ms. Remains 20780 /32033 variables (removed 11253) and now considering 36971/48223 (removed 11252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5278 ms. Remains : 20780/32033 places, 36971/48223 transitions.
[2023-03-24 16:51:48] [INFO ] Flatten gal took : 827 ms
[2023-03-24 16:51:49] [INFO ] Flatten gal took : 949 ms
[2023-03-24 16:51:51] [INFO ] Input system was already deterministic with 36971 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1666 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1667 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:53] [INFO ] Flatten gal took : 1040 ms
[2023-03-24 16:51:55] [INFO ] Flatten gal took : 1181 ms
[2023-03-24 16:51:57] [INFO ] Input system was already deterministic with 48223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32033/32033 places, 48223/48223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32032 transition count 48223
Applied a total of 1 rules in 1596 ms. Remains 32032 /32033 variables (removed 1) and now considering 48223/48223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 32032/32033 places, 48223/48223 transitions.
[2023-03-24 16:51:59] [INFO ] Flatten gal took : 1030 ms
[2023-03-24 16:52:01] [INFO ] Flatten gal took : 1185 ms
[2023-03-24 16:52:03] [INFO ] Input system was already deterministic with 48223 transitions.
[2023-03-24 16:52:04] [INFO ] Flatten gal took : 1142 ms
[2023-03-24 16:52:05] [INFO ] Flatten gal took : 1210 ms
[2023-03-24 16:52:05] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-24 16:52:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32033 places, 48223 transitions and 181287 arcs took 154 ms.
Total runtime 248154 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/505/ctl_0_ --ctl=/tmp/505/ctl_1_ --ctl=/tmp/505/ctl_2_ --ctl=/tmp/505/ctl_3_ --ctl=/tmp/505/ctl_4_ --ctl=/tmp/505/ctl_5_ --ctl=/tmp/505/ctl_6_ --ctl=/tmp/505/ctl_7_ --ctl=/tmp/505/ctl_8_ --ctl=/tmp/505/ctl_9_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 1406516 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16025808 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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-S32C10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419600953"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C10.tgz
mv MultiCrashLeafsetExtension-PT-S32C10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;