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-167856419600924.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-S32C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419600924
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 16K Feb 26 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K 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.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 02:54 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 24M 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-S32C06-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679664829224

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 13:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 13:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 13:33:51] [INFO ] Load time of PNML (sax parser for PT used): 743 ms
[2023-03-24 13:33:51] [INFO ] Transformed 22816 places.
[2023-03-24 13:33:51] [INFO ] Transformed 35015 transitions.
[2023-03-24 13:33:51] [INFO ] Parsed PT model containing 22816 places and 35015 transitions and 137470 arcs in 976 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 22816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22816/22816 places, 35015/35015 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 22768 transition count 35015
Applied a total of 48 rules in 2139 ms. Remains 22768 /22816 variables (removed 48) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:33:54] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 13:33:58] [INFO ] Computed 1565 place invariants in 3806 ms
[2023-03-24 13:34:00] [INFO ] Implicit Places using invariants in 5830 ms returned []
Implicit Place search using SMT only with invariants took 5864 ms to find 0 implicit places.
[2023-03-24 13:34:00] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:34:00] [INFO ] Invariant cache hit.
[2023-03-24 13:34:01] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22768/22816 places, 35015/35015 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9929 ms. Remains : 22768/22816 places, 35015/35015 transitions.
Support contains 53 out of 22768 places after structural reductions.
[2023-03-24 13:34:03] [INFO ] Flatten gal took : 1320 ms
[2023-03-24 13:34:04] [INFO ] Flatten gal took : 1056 ms
[2023-03-24 13:34:06] [INFO ] Input system was already deterministic with 35015 transitions.
Support contains 51 out of 22768 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1004 ms. (steps per millisecond=9 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Interrupted probabilistic random walk after 6372 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6372 steps, saw 3171 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 25 properties.
[2023-03-24 13:34:11] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:34:11] [INFO ] Invariant cache hit.
[2023-03-24 13:34:21] [INFO ] [Real]Absence check using 63 positive place invariants in 288 ms returned sat
[2023-03-24 13:34:22] [INFO ] [Real]Absence check using 63 positive and 1502 generalized place invariants in 1256 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: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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 13:34:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 13:34:36] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 22768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6206 transitions
Trivial Post-agglo rules discarded 6206 transitions
Performed 6206 trivial Post agglomeration. Transition count delta: 6206
Iterating post reduction 0 with 6206 rules applied. Total rules applied 6206 place count 22768 transition count 28809
Reduce places removed 6206 places and 0 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 1 with 6334 rules applied. Total rules applied 12540 place count 16562 transition count 28681
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 12668 place count 16434 transition count 28681
Performed 388 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 388 Pre rules applied. Total rules applied 12668 place count 16434 transition count 28293
Deduced a syphon composed of 388 places in 28 ms
Reduce places removed 388 places and 0 transitions.
Iterating global reduction 3 with 776 rules applied. Total rules applied 13444 place count 16046 transition count 28293
Discarding 5930 places :
Symmetric choice reduction at 3 with 5930 rule applications. Total rules 19374 place count 10116 transition count 22363
Iterating global reduction 3 with 5930 rules applied. Total rules applied 25304 place count 10116 transition count 22363
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 25304 place count 10116 transition count 22359
Deduced a syphon composed of 4 places in 18 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 25312 place count 10112 transition count 22359
Discarding 978 places :
Symmetric choice reduction at 3 with 978 rule applications. Total rules 26290 place count 9134 transition count 16491
Iterating global reduction 3 with 978 rules applied. Total rules applied 27268 place count 9134 transition count 16491
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 17 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 27332 place count 9102 transition count 16459
Free-agglomeration rule (complex) applied 572 times.
Iterating global reduction 3 with 572 rules applied. Total rules applied 27904 place count 9102 transition count 20777
Reduce places removed 572 places and 0 transitions.
Iterating post reduction 3 with 572 rules applied. Total rules applied 28476 place count 8530 transition count 20777
Partial Free-agglomeration rule applied 256 times.
Drop transitions removed 256 transitions
Iterating global reduction 4 with 256 rules applied. Total rules applied 28732 place count 8530 transition count 20777
Applied a total of 28732 rules in 14109 ms. Remains 8530 /22768 variables (removed 14238) and now considering 20777/35015 (removed 14238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14113 ms. Remains : 8530/22768 places, 20777/35015 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 1049 ms. (steps per millisecond=9 ) properties (out of 23) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-24 13:34:52] [INFO ] Flow matrix only has 19225 transitions (discarded 1552 similar events)
// Phase 1: matrix 19225 rows 8530 cols
[2023-03-24 13:34:53] [INFO ] Computed 1565 place invariants in 906 ms
[2023-03-24 13:34:55] [INFO ] [Real]Absence check using 65 positive place invariants in 129 ms returned sat
[2023-03-24 13:34:56] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 556 ms returned sat
[2023-03-24 13:35:18] [INFO ] After 19648ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:10
[2023-03-24 13:35:18] [INFO ] State equation strengthened by 11266 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 13:35:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 13:35:18] [INFO ] After 25279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 8530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8530/8530 places, 20777/20777 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 0 with 2 rules applied. Total rules applied 2 place count 8530 transition count 20775
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8528 transition count 20775
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 8528 transition count 20772
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 8525 transition count 20772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 8522 transition count 20769
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 8522 transition count 20769
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 8522 transition count 20766
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 8519 transition count 20766
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 8519 transition count 20764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 8517 transition count 20764
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 8516 transition count 20763
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 8516 transition count 20763
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 8516 transition count 20763
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 8515 transition count 20762
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 8515 transition count 20762
Applied a total of 31 rules in 8087 ms. Remains 8515 /8530 variables (removed 15) and now considering 20762/20777 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8087 ms. Remains : 8515/8530 places, 20762/20777 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 934 ms. (steps per millisecond=10 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 11417 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11417 steps, saw 5462 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-24 13:35:30] [INFO ] Flow matrix only has 19210 transitions (discarded 1552 similar events)
// Phase 1: matrix 19210 rows 8515 cols
[2023-03-24 13:35:31] [INFO ] Computed 1565 place invariants in 935 ms
[2023-03-24 13:35:34] [INFO ] [Real]Absence check using 65 positive place invariants in 113 ms returned sat
[2023-03-24 13:35:34] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 554 ms returned sat
[2023-03-24 13:35:36] [INFO ] After 5258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-24 13:35:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 114 ms returned sat
[2023-03-24 13:35:39] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 575 ms returned sat
[2023-03-24 13:36:01] [INFO ] After 19934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-24 13:36:02] [INFO ] State equation strengthened by 11266 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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 13:36:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 13:36:02] [INFO ] After 25171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 33 out of 8515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8515/8515 places, 20762/20762 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 8515 transition count 20761
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8514 transition count 20761
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8513 transition count 20760
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8513 transition count 20760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 8513 transition count 20759
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 8512 transition count 20759
Applied a total of 6 rules in 2761 ms. Remains 8512 /8515 variables (removed 3) and now considering 20759/20762 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2761 ms. Remains : 8512/8515 places, 20759/20762 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 16752 stabilizing places and 23046 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1763 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:36:06] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 13:36:10] [INFO ] Computed 1565 place invariants in 3387 ms
[2023-03-24 13:36:12] [INFO ] Implicit Places using invariants in 5151 ms returned []
Implicit Place search using SMT only with invariants took 5153 ms to find 0 implicit places.
[2023-03-24 13:36:12] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:36:12] [INFO ] Invariant cache hit.
[2023-03-24 13:36:13] [INFO ] Dead Transitions using invariants and state equation in 1763 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8683 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 11 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-01 finished in 9002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p0)||G(p1))))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1712 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:36:15] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:36:15] [INFO ] Invariant cache hit.
[2023-03-24 13:36:17] [INFO ] Implicit Places using invariants in 1776 ms returned []
Implicit Place search using SMT only with invariants took 1781 ms to find 0 implicit places.
[2023-03-24 13:36:17] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:36:17] [INFO ] Invariant cache hit.
[2023-03-24 13:36:19] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5247 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s4545 1) (GEQ s5135 1)), p1:(OR (LT s7136 1) (LT s7689 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1623 reset in 2598 ms.
Product exploration explored 100000 steps with 1623 reset in 2512 ms.
Computed a total of 16752 stabilizing places and 23046 stable transitions
Computed a total of 16752 stabilizing places and 23046 stable transitions
Detected a total of 16752/22768 stabilizing places and 23046/35015 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 288 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 162 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6053 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6053 steps, saw 3019 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:36:28] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:36:28] [INFO ] Invariant cache hit.
[2023-03-24 13:36:31] [INFO ] [Real]Absence check using 63 positive place invariants in 216 ms returned sat
[2023-03-24 13:36:32] [INFO ] [Real]Absence check using 63 positive and 1502 generalized place invariants in 1127 ms returned sat
[2023-03-24 13:36:53] [INFO ] After 20627ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 13:36:53] [INFO ] State equation strengthened by 11266 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 13:36:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 13:36:53] [INFO ] After 25136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 22768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6320 transitions
Trivial Post-agglo rules discarded 6320 transitions
Performed 6320 trivial Post agglomeration. Transition count delta: 6320
Iterating post reduction 0 with 6320 rules applied. Total rules applied 6320 place count 22768 transition count 28695
Reduce places removed 6320 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12656 place count 16448 transition count 28679
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28284
Deduced a syphon composed of 395 places in 24 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 13462 place count 16037 transition count 28284
Discarding 5939 places :
Symmetric choice reduction at 3 with 5939 rule applications. Total rules 19401 place count 10098 transition count 22345
Iterating global reduction 3 with 5939 rules applied. Total rules applied 25340 place count 10098 transition count 22345
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25340 place count 10098 transition count 22334
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 25362 place count 10087 transition count 22334
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 26351 place count 9098 transition count 16400
Iterating global reduction 3 with 989 rules applied. Total rules applied 27340 place count 9098 transition count 16400
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27406 place count 9065 transition count 16367
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 3 with 577 rules applied. Total rules applied 27983 place count 9065 transition count 20735
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 3 with 577 rules applied. Total rules applied 28560 place count 8488 transition count 20735
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 28592 place count 8488 transition count 20735
Applied a total of 28592 rules in 12224 ms. Remains 8488 /22768 variables (removed 14280) and now considering 20735/35015 (removed 14280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12224 ms. Remains : 8488/22768 places, 20735/35015 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10927 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10927 steps, saw 5244 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:37:09] [INFO ] Flow matrix only has 19169 transitions (discarded 1566 similar events)
// Phase 1: matrix 19169 rows 8488 cols
[2023-03-24 13:37:10] [INFO ] Computed 1565 place invariants in 876 ms
[2023-03-24 13:37:11] [INFO ] [Real]Absence check using 65 positive place invariants in 131 ms returned sat
[2023-03-24 13:37:12] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 606 ms returned sat
[2023-03-24 13:37:25] [INFO ] After 13189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 13:37:25] [INFO ] State equation strengthened by 11266 read => feed constraints.
[2023-03-24 13:37:29] [INFO ] After 3958ms SMT Verify possible using 11266 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 13:37:29] [INFO ] After 18965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 13:37:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 137 ms returned sat
[2023-03-24 13:37:31] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 567 ms returned sat
[2023-03-24 13:37:44] [INFO ] After 12798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 13:37:51] [INFO ] After 7581ms SMT Verify possible using 11266 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 13:38:09] [INFO ] Deduced a trap composed of 483 places in 16744 ms of which 18 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 13:38:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 13:38:09] [INFO ] After 39394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 8488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8488/8488 places, 20735/20735 transitions.
Applied a total of 0 rules in 1333 ms. Remains 8488 /8488 variables (removed 0) and now considering 20735/20735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1334 ms. Remains : 8488/8488 places, 20735/20735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8488/8488 places, 20735/20735 transitions.
Applied a total of 0 rules in 1317 ms. Remains 8488 /8488 variables (removed 0) and now considering 20735/20735 (removed 0) transitions.
[2023-03-24 13:38:11] [INFO ] Flow matrix only has 19169 transitions (discarded 1566 similar events)
[2023-03-24 13:38:11] [INFO ] Invariant cache hit.
[2023-03-24 13:38:12] [INFO ] Implicit Places using invariants in 768 ms returned []
Implicit Place search using SMT only with invariants took 773 ms to find 0 implicit places.
[2023-03-24 13:38:12] [INFO ] Flow matrix only has 19169 transitions (discarded 1566 similar events)
[2023-03-24 13:38:12] [INFO ] Invariant cache hit.
[2023-03-24 13:38:13] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2852 ms. Remains : 8488/8488 places, 20735/20735 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 22768 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1701 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:38:15] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 13:38:18] [INFO ] Computed 1565 place invariants in 3461 ms
[2023-03-24 13:38:20] [INFO ] Implicit Places using invariants in 5238 ms returned []
Implicit Place search using SMT only with invariants took 5249 ms to find 0 implicit places.
[2023-03-24 13:38:20] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:38:20] [INFO ] Invariant cache hit.
[2023-03-24 13:38:22] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8686 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Computed a total of 16752 stabilizing places and 23046 stable transitions
Computed a total of 16752 stabilizing places and 23046 stable transitions
Detected a total of 16752/22768 stabilizing places and 23046/35015 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 162 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6059 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6059 steps, saw 3021 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:38:26] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:38:26] [INFO ] Invariant cache hit.
[2023-03-24 13:38:29] [INFO ] [Real]Absence check using 63 positive place invariants in 220 ms returned sat
[2023-03-24 13:38:30] [INFO ] [Real]Absence check using 63 positive and 1502 generalized place invariants in 1123 ms returned sat
[2023-03-24 13:38:51] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 22768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6320 transitions
Trivial Post-agglo rules discarded 6320 transitions
Performed 6320 trivial Post agglomeration. Transition count delta: 6320
Iterating post reduction 0 with 6320 rules applied. Total rules applied 6320 place count 22768 transition count 28695
Reduce places removed 6320 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12656 place count 16448 transition count 28679
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28284
Deduced a syphon composed of 395 places in 22 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 13462 place count 16037 transition count 28284
Discarding 5939 places :
Symmetric choice reduction at 3 with 5939 rule applications. Total rules 19401 place count 10098 transition count 22345
Iterating global reduction 3 with 5939 rules applied. Total rules applied 25340 place count 10098 transition count 22345
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25340 place count 10098 transition count 22334
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 25362 place count 10087 transition count 22334
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 26351 place count 9098 transition count 16400
Iterating global reduction 3 with 989 rules applied. Total rules applied 27340 place count 9098 transition count 16400
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27406 place count 9065 transition count 16367
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 3 with 577 rules applied. Total rules applied 27983 place count 9065 transition count 20735
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 3 with 577 rules applied. Total rules applied 28560 place count 8488 transition count 20735
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 28592 place count 8488 transition count 20735
Applied a total of 28592 rules in 12018 ms. Remains 8488 /22768 variables (removed 14280) and now considering 20735/35015 (removed 14280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12018 ms. Remains : 8488/22768 places, 20735/35015 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10915 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10915 steps, saw 5240 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 13:39:07] [INFO ] Flow matrix only has 19169 transitions (discarded 1566 similar events)
// Phase 1: matrix 19169 rows 8488 cols
[2023-03-24 13:39:08] [INFO ] Computed 1565 place invariants in 1001 ms
[2023-03-24 13:39:09] [INFO ] [Real]Absence check using 65 positive place invariants in 138 ms returned sat
[2023-03-24 13:39:09] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 569 ms returned sat
[2023-03-24 13:39:23] [INFO ] After 13544ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 13:39:23] [INFO ] State equation strengthened by 11266 read => feed constraints.
[2023-03-24 13:39:27] [INFO ] After 3987ms SMT Verify possible using 11266 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 13:39:27] [INFO ] After 19310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 13:39:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 131 ms returned sat
[2023-03-24 13:39:28] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 536 ms returned sat
[2023-03-24 13:39:41] [INFO ] After 12905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 13:39:49] [INFO ] After 7598ms SMT Verify possible using 11266 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 13:40:06] [INFO ] Deduced a trap composed of 483 places in 16462 ms of which 9 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 13:40:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 13:40:06] [INFO ] After 39209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 8488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8488/8488 places, 20735/20735 transitions.
Applied a total of 0 rules in 1287 ms. Remains 8488 /8488 variables (removed 0) and now considering 20735/20735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1287 ms. Remains : 8488/8488 places, 20735/20735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8488/8488 places, 20735/20735 transitions.
Applied a total of 0 rules in 1292 ms. Remains 8488 /8488 variables (removed 0) and now considering 20735/20735 (removed 0) transitions.
[2023-03-24 13:40:09] [INFO ] Flow matrix only has 19169 transitions (discarded 1566 similar events)
[2023-03-24 13:40:09] [INFO ] Invariant cache hit.
[2023-03-24 13:40:09] [INFO ] Implicit Places using invariants in 766 ms returned []
Implicit Place search using SMT only with invariants took 768 ms to find 0 implicit places.
[2023-03-24 13:40:09] [INFO ] Flow matrix only has 19169 transitions (discarded 1566 similar events)
[2023-03-24 13:40:09] [INFO ] Invariant cache hit.
[2023-03-24 13:40:10] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2926 ms. Remains : 8488/8488 places, 20735/20735 transitions.
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 89103 steps with 1445 reset in 3318 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-02 finished in 240502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6320 transitions
Trivial Post-agglo rules discarded 6320 transitions
Performed 6320 trivial Post agglomeration. Transition count delta: 6320
Iterating post reduction 0 with 6320 rules applied. Total rules applied 6320 place count 22768 transition count 28695
Reduce places removed 6320 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12656 place count 16448 transition count 28679
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28284
Deduced a syphon composed of 395 places in 24 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 13462 place count 16037 transition count 28284
Discarding 5939 places :
Symmetric choice reduction at 3 with 5939 rule applications. Total rules 19401 place count 10098 transition count 22345
Iterating global reduction 3 with 5939 rules applied. Total rules applied 25340 place count 10098 transition count 22345
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25340 place count 10098 transition count 22334
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 25362 place count 10087 transition count 22334
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 26351 place count 9098 transition count 16400
Iterating global reduction 3 with 989 rules applied. Total rules applied 27340 place count 9098 transition count 16400
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27406 place count 9065 transition count 16367
Applied a total of 27406 rules in 9481 ms. Remains 9065 /22768 variables (removed 13703) and now considering 16367/35015 (removed 18648) transitions.
[2023-03-24 13:40:24] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
// Phase 1: matrix 15311 rows 9065 cols
[2023-03-24 13:40:24] [INFO ] Computed 1565 place invariants in 771 ms
[2023-03-24 13:40:25] [INFO ] Implicit Places using invariants in 1553 ms returned []
Implicit Place search using SMT only with invariants took 1554 ms to find 0 implicit places.
[2023-03-24 13:40:25] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2023-03-24 13:40:25] [INFO ] Invariant cache hit.
[2023-03-24 13:40:26] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9065/22768 places, 16367/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11827 ms. Remains : 9065/22768 places, 16367/35015 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7130 1) (GEQ s7541 1)), p1:(OR (LT s5093 1) (LT s5325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-03 finished in 12033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1)) U X(p0)))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1830 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:40:28] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 13:40:31] [INFO ] Computed 1565 place invariants in 3340 ms
[2023-03-24 13:40:33] [INFO ] Implicit Places using invariants in 5089 ms returned []
Implicit Place search using SMT only with invariants took 5091 ms to find 0 implicit places.
[2023-03-24 13:40:33] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:40:33] [INFO ] Invariant cache hit.
[2023-03-24 13:40:35] [INFO ] Dead Transitions using invariants and state equation in 1757 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8682 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3882 1) (GEQ s8275 1)), p1:(AND (GEQ s15234 1) (GEQ s19194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-04 finished in 8950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6336 transitions
Trivial Post-agglo rules discarded 6336 transitions
Performed 6336 trivial Post agglomeration. Transition count delta: 6336
Iterating post reduction 0 with 6336 rules applied. Total rules applied 6336 place count 22768 transition count 28679
Reduce places removed 6336 places and 0 transitions.
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28283
Deduced a syphon composed of 396 places in 23 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 13464 place count 16036 transition count 28283
Discarding 5940 places :
Symmetric choice reduction at 2 with 5940 rule applications. Total rules 19404 place count 10096 transition count 22343
Iterating global reduction 2 with 5940 rules applied. Total rules applied 25344 place count 10096 transition count 22343
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25344 place count 10096 transition count 22331
Deduced a syphon composed of 12 places in 15 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 25368 place count 10084 transition count 22331
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 26358 place count 9094 transition count 16391
Iterating global reduction 2 with 990 rules applied. Total rules applied 27348 place count 9094 transition count 16391
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 27414 place count 9061 transition count 16358
Applied a total of 27414 rules in 9000 ms. Remains 9061 /22768 variables (removed 13707) and now considering 16358/35015 (removed 18657) transitions.
[2023-03-24 13:40:44] [INFO ] Flow matrix only has 15302 transitions (discarded 1056 similar events)
// Phase 1: matrix 15302 rows 9061 cols
[2023-03-24 13:40:45] [INFO ] Computed 1565 place invariants in 767 ms
[2023-03-24 13:40:46] [INFO ] Implicit Places using invariants in 1670 ms returned []
Implicit Place search using SMT only with invariants took 1672 ms to find 0 implicit places.
[2023-03-24 13:40:46] [INFO ] Flow matrix only has 15302 transitions (discarded 1056 similar events)
[2023-03-24 13:40:46] [INFO ] Invariant cache hit.
[2023-03-24 13:40:47] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9061/22768 places, 16358/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11591 ms. Remains : 9061/22768 places, 16358/35015 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s343 1) (GEQ s4569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-05 finished in 11706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X((p1&&G(F(p2))))))'
Support contains 7 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1836 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:40:49] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 13:40:52] [INFO ] Computed 1565 place invariants in 3492 ms
[2023-03-24 13:40:54] [INFO ] Implicit Places using invariants in 5523 ms returned []
Implicit Place search using SMT only with invariants took 5524 ms to find 0 implicit places.
[2023-03-24 13:40:54] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:40:54] [INFO ] Invariant cache hit.
[2023-03-24 13:40:56] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9429 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p0), (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s5826 1) (LT s5829 1) (LT s12457 1)), p1:(OR (LT s22295 1) (LT s22720 1)), p2:(AND (GEQ s7721 1) (GEQ s8269 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 185 steps with 2 reset in 9 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-06 finished in 9803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6304 transitions
Trivial Post-agglo rules discarded 6304 transitions
Performed 6304 trivial Post agglomeration. Transition count delta: 6304
Iterating post reduction 0 with 6304 rules applied. Total rules applied 6304 place count 22768 transition count 28711
Reduce places removed 6304 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12640 place count 16464 transition count 28679
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28285
Deduced a syphon composed of 394 places in 23 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 13460 place count 16038 transition count 28285
Discarding 5938 places :
Symmetric choice reduction at 3 with 5938 rule applications. Total rules 19398 place count 10100 transition count 22347
Iterating global reduction 3 with 5938 rules applied. Total rules applied 25336 place count 10100 transition count 22347
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25336 place count 10100 transition count 22337
Deduced a syphon composed of 10 places in 15 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 25356 place count 10090 transition count 22337
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 26344 place count 9102 transition count 16409
Iterating global reduction 3 with 988 rules applied. Total rules applied 27332 place count 9102 transition count 16409
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27398 place count 9069 transition count 16376
Applied a total of 27398 rules in 9211 ms. Remains 9069 /22768 variables (removed 13699) and now considering 16376/35015 (removed 18639) transitions.
[2023-03-24 13:41:06] [INFO ] Flow matrix only has 15320 transitions (discarded 1056 similar events)
// Phase 1: matrix 15320 rows 9069 cols
[2023-03-24 13:41:07] [INFO ] Computed 1565 place invariants in 792 ms
[2023-03-24 13:41:07] [INFO ] Implicit Places using invariants in 1574 ms returned []
Implicit Place search using SMT only with invariants took 1577 ms to find 0 implicit places.
[2023-03-24 13:41:07] [INFO ] Flow matrix only has 15320 transitions (discarded 1056 similar events)
[2023-03-24 13:41:07] [INFO ] Invariant cache hit.
[2023-03-24 13:41:08] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9069/22768 places, 16376/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11585 ms. Remains : 9069/22768 places, 16376/35015 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4437 1) (GEQ s4460 1)), p0:(AND (GEQ s3827 1) (GEQ s3842 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-07 finished in 11728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1709 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:41:10] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2023-03-24 13:41:14] [INFO ] Computed 1565 place invariants in 3405 ms
[2023-03-24 13:41:15] [INFO ] Implicit Places using invariants in 5142 ms returned []
Implicit Place search using SMT only with invariants took 5146 ms to find 0 implicit places.
[2023-03-24 13:41:15] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:15] [INFO ] Invariant cache hit.
[2023-03-24 13:41:17] [INFO ] Dead Transitions using invariants and state equation in 1793 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8651 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s16523 1), p1:(AND (GEQ s10464 1) (GEQ s10905 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-09 finished in 8928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0))||G(p1))))))'
Support contains 6 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1858 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:41:19] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:19] [INFO ] Invariant cache hit.
[2023-03-24 13:41:21] [INFO ] Implicit Places using invariants in 1758 ms returned []
Implicit Place search using SMT only with invariants took 1759 ms to find 0 implicit places.
[2023-03-24 13:41:21] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:21] [INFO ] Invariant cache hit.
[2023-03-24 13:41:23] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5383 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s968 1) (GEQ s22336 1)), p1:(OR (AND (GEQ s3325 1) (GEQ s22685 1)) (LT s11661 1) (LT s11916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89114 steps with 1445 reset in 2205 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-10 finished in 7944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p0 U X((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))'
Support contains 8 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1723 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:41:27] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:27] [INFO ] Invariant cache hit.
[2023-03-24 13:41:29] [INFO ] Implicit Places using invariants in 1742 ms returned []
Implicit Place search using SMT only with invariants took 1747 ms to find 0 implicit places.
[2023-03-24 13:41:29] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:29] [INFO ] Invariant cache hit.
[2023-03-24 13:41:30] [INFO ] Dead Transitions using invariants and state equation in 1704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5177 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s5602 1) (GEQ s14639 1)), p2:(AND (GEQ s12978 1) (GEQ s16939 1)), p3:(AND (GEQ s8550 1) (GEQ s9363 1)), p1:(AND (GEQ s5135 1) (GEQ s19855 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 78720 steps with 26240 reset in 10001 ms.
Product exploration timeout after 78690 steps with 26230 reset in 10003 ms.
Computed a total of 16752 stabilizing places and 23046 stable transitions
Computed a total of 16752 stabilizing places and 23046 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))
Knowledge based reduction with 12 factoid took 363 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-11 finished in 25989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X((!p1 U G(p2))))))))'
Support contains 6 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1797 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2023-03-24 13:41:53] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:53] [INFO ] Invariant cache hit.
[2023-03-24 13:41:55] [INFO ] Implicit Places using invariants in 1725 ms returned []
Implicit Place search using SMT only with invariants took 1727 ms to find 0 implicit places.
[2023-03-24 13:41:55] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2023-03-24 13:41:55] [INFO ] Invariant cache hit.
[2023-03-24 13:41:57] [INFO ] Dead Transitions using invariants and state equation in 1754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5281 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=9 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s17274 1) (GEQ s17912 1)), p2:(AND (GEQ s20547 1) (GEQ s21340 1)), p1:(AND (GEQ s12454 1) (GEQ s19878 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLFireability-14 finished in 5846 ms.
All properties solved by simple procedures.
Total runtime 486919 ms.
ITS solved all properties within timeout

BK_STOP 1679665318596

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C06"
export BK_EXAMINATION="LTLFireability"
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-S32C06, examination is LTLFireability"
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-167856419600924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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