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.r231-tall-167856416800972.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S32C12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416800972
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 14K Feb 26 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 02:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37M 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-S32C12-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679524002643

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 22:26:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:26:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:26:45] [INFO ] Load time of PNML (sax parser for PT used): 1015 ms
[2023-03-22 22:26:45] [INFO ] Transformed 36724 places.
[2023-03-22 22:26:45] [INFO ] Transformed 54827 transitions.
[2023-03-22 22:26:45] [INFO ] Parsed PT model containing 36724 places and 54827 transitions and 203278 arcs in 1263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 36724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36724/36724 places, 54827/54827 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 36664 transition count 54827
Applied a total of 60 rules in 2748 ms. Remains 36664 /36724 variables (removed 60) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:26:48] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36664 cols
[2023-03-22 22:27:00] [INFO ] Computed 1973 place invariants in 12023 ms
[2023-03-22 22:27:04] [INFO ] Implicit Places using invariants in 15346 ms returned []
Implicit Place search using SMT only with invariants took 15371 ms to find 0 implicit places.
[2023-03-22 22:27:04] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:27:04] [INFO ] Invariant cache hit.
[2023-03-22 22:27:07] [INFO ] Dead Transitions using invariants and state equation in 2906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36664/36724 places, 54827/54827 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21042 ms. Remains : 36664/36724 places, 54827/54827 transitions.
Support contains 49 out of 36664 places after structural reductions.
[2023-03-22 22:27:09] [INFO ] Flatten gal took : 1813 ms
[2023-03-22 22:27:11] [INFO ] Flatten gal took : 1475 ms
[2023-03-22 22:27:13] [INFO ] Input system was already deterministic with 54827 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 29) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 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 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 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 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 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-22 22:27:15] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:27:15] [INFO ] Invariant cache hit.
[2023-03-22 22:27:32] [INFO ] [Real]Absence check using 63 positive place invariants in 545 ms returned sat
[2023-03-22 22:27:34] [INFO ] [Real]Absence check using 63 positive and 1910 generalized place invariants in 1916 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-22 22:27:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:27:40] [INFO ] After 25100ms 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 1 ms.
Support contains 38 out of 36664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Drop transitions removed 12553 transitions
Trivial Post-agglo rules discarded 12553 transitions
Performed 12553 trivial Post agglomeration. Transition count delta: 12553
Iterating post reduction 0 with 12553 rules applied. Total rules applied 12553 place count 36664 transition count 42274
Reduce places removed 12553 places and 0 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Iterating post reduction 1 with 12664 rules applied. Total rules applied 25217 place count 24111 transition count 42163
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 2 with 111 rules applied. Total rules applied 25328 place count 24000 transition count 42163
Performed 785 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 785 Pre rules applied. Total rules applied 25328 place count 24000 transition count 41378
Deduced a syphon composed of 785 places in 72 ms
Reduce places removed 785 places and 0 transitions.
Iterating global reduction 3 with 1570 rules applied. Total rules applied 26898 place count 23215 transition count 41378
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 52 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 26964 place count 23182 transition count 41345
Free-agglomeration rule (complex) applied 1575 times.
Iterating global reduction 3 with 1575 rules applied. Total rules applied 28539 place count 23182 transition count 39770
Reduce places removed 1575 places and 0 transitions.
Iterating post reduction 3 with 1575 rules applied. Total rules applied 30114 place count 21607 transition count 39770
Partial Free-agglomeration rule applied 4633 times.
Drop transitions removed 4633 transitions
Iterating global reduction 4 with 4633 rules applied. Total rules applied 34747 place count 21607 transition count 39770
Applied a total of 34747 rules in 14597 ms. Remains 21607 /36664 variables (removed 15057) and now considering 39770/54827 (removed 15057) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14599 ms. Remains : 21607/36664 places, 39770/54827 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1595 ms. (steps per millisecond=6 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-22 22:27:57] [INFO ] Flow matrix only has 38204 transitions (discarded 1566 similar events)
// Phase 1: matrix 38204 rows 21607 cols
[2023-03-22 22:28:13] [INFO ] Computed 1973 place invariants in 15475 ms
[2023-03-22 22:28:20] [INFO ] [Real]Absence check using 65 positive place invariants in 206 ms returned sat
[2023-03-22 22:28:21] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1197 ms returned sat
[2023-03-22 22:28:38] [INFO ] After 11894ms SMT Verify possible using state equation in real domain returned unsat :1 sat :17
[2023-03-22 22:28:38] [INFO ] State equation strengthened by 17602 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-22 22:28:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:28:38] [INFO ] After 25878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 21607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21607/21607 places, 39770/39770 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21607 transition count 39767
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 21604 transition count 39766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 21603 transition count 39766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 21603 transition count 39765
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 21602 transition count 39765
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 21602 transition count 39763
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 21600 transition count 39763
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 32 place count 21600 transition count 39763
Applied a total of 32 rules in 4801 ms. Remains 21600 /21607 variables (removed 7) and now considering 39763/39770 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4801 ms. Remains : 21600/21607 places, 39763/39770 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1488 ms. (steps per millisecond=6 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 7644 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{7=1}
Probabilistic random walk after 7644 steps, saw 3770 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :1
Running SMT prover for 16 properties.
[2023-03-22 22:28:48] [INFO ] Flow matrix only has 38197 transitions (discarded 1566 similar events)
// Phase 1: matrix 38197 rows 21600 cols
[2023-03-22 22:29:04] [INFO ] Computed 1973 place invariants in 15570 ms
[2023-03-22 22:29:10] [INFO ] [Real]Absence check using 65 positive place invariants in 174 ms returned sat
[2023-03-22 22:29:11] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1181 ms returned sat
[2023-03-22 22:29:29] [INFO ] After 13288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2023-03-22 22:29:29] [INFO ] State equation strengthened by 17602 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-22 22:29:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:29:29] [INFO ] After 25765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 21600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21600/21600 places, 39763/39763 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 21600 transition count 39762
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21599 transition count 39762
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 21599 transition count 39761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 21598 transition count 39761
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 21598 transition count 39761
Applied a total of 20 rules in 4123 ms. Remains 21598 /21600 variables (removed 2) and now considering 39761/39763 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4124 ms. Remains : 21598/21600 places, 39761/39763 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30648 stabilizing places and 42858 stable transitions
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(((X(X(F(p0)))&&G(!p1))||G(F(p0)))))'
Support contains 4 out of 36664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1650 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:29:36] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36664 cols
[2023-03-22 22:29:46] [INFO ] Computed 1973 place invariants in 10643 ms
[2023-03-22 22:29:49] [INFO ] Implicit Places using invariants in 13404 ms returned []
Implicit Place search using SMT only with invariants took 13411 ms to find 0 implicit places.
[2023-03-22 22:29:49] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:29:49] [INFO ] Invariant cache hit.
[2023-03-22 22:29:52] [INFO ] Dead Transitions using invariants and state equation in 2683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17750 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s30784 1) (GEQ s35974 1)), p0:(AND (GEQ s9990 1) (GEQ s10765 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 123 steps with 0 reset in 29 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-01 finished in 18359 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' '!((p0 U X((G(F(p2))&&p1))))'
Support contains 3 out of 36664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1663 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:29:54] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:29:54] [INFO ] Invariant cache hit.
[2023-03-22 22:29:57] [INFO ] Implicit Places using invariants in 2833 ms returned []
Implicit Place search using SMT only with invariants took 2838 ms to find 0 implicit places.
[2023-03-22 22:29:57] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:29:57] [INFO ] Invariant cache hit.
[2023-03-22 22:29:59] [INFO ] Dead Transitions using invariants and state equation in 2712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7219 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-02 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 p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ 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:(AND (GEQ s32634 1) (GEQ s36359 1)), p1:(AND (GEQ s32634 1) (GEQ s36359 1)), p2:(LT s8860 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-02 finished in 7583 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||F((p1&&G(p2)))))))'
Support contains 4 out of 36664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Drop transitions removed 12670 transitions
Trivial Post-agglo rules discarded 12670 transitions
Performed 12670 trivial Post agglomeration. Transition count delta: 12670
Iterating post reduction 0 with 12670 rules applied. Total rules applied 12670 place count 36664 transition count 42157
Reduce places removed 12670 places and 0 transitions.
Iterating post reduction 1 with 12670 rules applied. Total rules applied 25340 place count 23994 transition count 42157
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 25340 place count 23994 transition count 41365
Deduced a syphon composed of 792 places in 51 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 26924 place count 23202 transition count 41365
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 44 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 26990 place count 23169 transition count 41332
Applied a total of 26990 rules in 6777 ms. Remains 23169 /36664 variables (removed 13495) and now considering 41332/54827 (removed 13495) transitions.
[2023-03-22 22:30:07] [INFO ] Flow matrix only has 40276 transitions (discarded 1056 similar events)
// Phase 1: matrix 40276 rows 23169 cols
[2023-03-22 22:30:14] [INFO ] Computed 1973 place invariants in 6915 ms
[2023-03-22 22:30:15] [INFO ] Implicit Places using invariants in 8751 ms returned []
Implicit Place search using SMT only with invariants took 8761 ms to find 0 implicit places.
[2023-03-22 22:30:15] [INFO ] Flow matrix only has 40276 transitions (discarded 1056 similar events)
[2023-03-22 22:30:15] [INFO ] Invariant cache hit.
[2023-03-22 22:30:17] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23169/36664 places, 41332/54827 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17329 ms. Remains : 23169/36664 places, 41332/54827 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s20496 1) (LT s22619 1)), p2:(LT s18695 1), p0:(LT s5921 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1020 reset in 3532 ms.
Product exploration explored 100000 steps with 1020 reset in 3320 ms.
Computed a total of 17186 stabilizing places and 29396 stable transitions
Computed a total of 17186 stabilizing places and 29396 stable transitions
Detected a total of 17186/23169 stabilizing places and 29396/41332 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 814 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 102 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 6141 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6141 steps, saw 3133 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 22:30:30] [INFO ] Flow matrix only has 40276 transitions (discarded 1056 similar events)
[2023-03-22 22:30:30] [INFO ] Invariant cache hit.
[2023-03-22 22:30:35] [INFO ] [Real]Absence check using 63 positive place invariants in 169 ms returned sat
[2023-03-22 22:30:37] [INFO ] [Real]Absence check using 63 positive and 1910 generalized place invariants in 1405 ms returned sat
[2023-03-22 22:30:37] [INFO ] After 6766ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 22:30:42] [INFO ] [Nat]Absence check using 63 positive place invariants in 234 ms returned sat
[2023-03-22 22:30:43] [INFO ] [Nat]Absence check using 63 positive and 1910 generalized place invariants in 1377 ms returned sat
[2023-03-22 22:31:02] [INFO ] After 16598ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-22 22:31:02] [INFO ] State equation strengthened by 17602 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.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-22 22:31:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:31:02] [INFO ] After 25288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 23169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 23169/23169 places, 41332/41332 transitions.
Free-agglomeration rule (complex) applied 1587 times.
Iterating global reduction 0 with 1587 rules applied. Total rules applied 1587 place count 23169 transition count 39745
Reduce places removed 1587 places and 0 transitions.
Iterating post reduction 0 with 1587 rules applied. Total rules applied 3174 place count 21582 transition count 39745
Partial Free-agglomeration rule applied 1054 times.
Drop transitions removed 1054 transitions
Iterating global reduction 1 with 1054 rules applied. Total rules applied 4228 place count 21582 transition count 39745
Applied a total of 4228 rules in 7717 ms. Remains 21582 /23169 variables (removed 1587) and now considering 39745/41332 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7718 ms. Remains : 21582/23169 places, 39745/41332 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1349 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 13977 steps, run timeout after 6001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 13977 steps, saw 6924 distinct states, run finished after 6001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 22:31:18] [INFO ] Flow matrix only has 38179 transitions (discarded 1566 similar events)
// Phase 1: matrix 38179 rows 21582 cols
[2023-03-22 22:31:35] [INFO ] Computed 1973 place invariants in 16268 ms
[2023-03-22 22:31:39] [INFO ] [Real]Absence check using 65 positive place invariants in 268 ms returned sat
[2023-03-22 22:31:40] [INFO ] [Real]Absence check using 65 positive and 1908 generalized place invariants in 1257 ms returned sat
[2023-03-22 22:31:40] [INFO ] After 5633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 22:31:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 175 ms returned sat
[2023-03-22 22:31:46] [INFO ] [Nat]Absence check using 65 positive and 1908 generalized place invariants in 1290 ms returned sat
[2023-03-22 22:32:05] [INFO ] After 17949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 22:32:06] [INFO ] State equation strengthened by 17602 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.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-22 22:32:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:32:06] [INFO ] After 25489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21582/21582 places, 39745/39745 transitions.
Applied a total of 0 rules in 1325 ms. Remains 21582 /21582 variables (removed 0) and now considering 39745/39745 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1325 ms. Remains : 21582/21582 places, 39745/39745 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21582/21582 places, 39745/39745 transitions.
Applied a total of 0 rules in 1331 ms. Remains 21582 /21582 variables (removed 0) and now considering 39745/39745 (removed 0) transitions.
[2023-03-22 22:32:09] [INFO ] Flow matrix only has 38179 transitions (discarded 1566 similar events)
[2023-03-22 22:32:09] [INFO ] Invariant cache hit.
[2023-03-22 22:32:10] [INFO ] Implicit Places using invariants in 1720 ms returned []
Implicit Place search using SMT only with invariants took 1736 ms to find 0 implicit places.
[2023-03-22 22:32:10] [INFO ] Flow matrix only has 38179 transitions (discarded 1566 similar events)
[2023-03-22 22:32:10] [INFO ] Invariant cache hit.
[2023-03-22 22:32:12] [INFO ] Dead Transitions using invariants and state equation in 1682 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4759 ms. Remains : 21582/21582 places, 39745/39745 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p2) (G (NOT p2))))
Knowledge based reduction with 18 factoid took 746 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-03 finished in 132895 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(p0)&&(p0||F(G(p1))))))'
Support contains 4 out of 36664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1630 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:32:14] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36664 cols
[2023-03-22 22:32:24] [INFO ] Computed 1973 place invariants in 9381 ms
[2023-03-22 22:32:27] [INFO ] Implicit Places using invariants in 12220 ms returned []
Implicit Place search using SMT only with invariants took 12230 ms to find 0 implicit places.
[2023-03-22 22:32:27] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:32:27] [INFO ] Invariant cache hit.
[2023-03-22 22:32:29] [INFO ] Dead Transitions using invariants and state equation in 2792 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16669 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s20563 1) (GEQ s35834 1)), p1:(AND (GEQ s13762 1) (GEQ s14625 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 7 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-04 finished in 16989 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 2 out of 36664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Drop transitions removed 12670 transitions
Trivial Post-agglo rules discarded 12670 transitions
Performed 12670 trivial Post agglomeration. Transition count delta: 12670
Iterating post reduction 0 with 12670 rules applied. Total rules applied 12670 place count 36664 transition count 42157
Reduce places removed 12670 places and 0 transitions.
Iterating post reduction 1 with 12670 rules applied. Total rules applied 25340 place count 23994 transition count 42157
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 25340 place count 23994 transition count 41365
Deduced a syphon composed of 792 places in 52 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 26924 place count 23202 transition count 41365
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 38 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 26990 place count 23169 transition count 41332
Applied a total of 26990 rules in 6544 ms. Remains 23169 /36664 variables (removed 13495) and now considering 41332/54827 (removed 13495) transitions.
[2023-03-22 22:32:36] [INFO ] Flow matrix only has 40276 transitions (discarded 1056 similar events)
// Phase 1: matrix 40276 rows 23169 cols
[2023-03-22 22:32:43] [INFO ] Computed 1973 place invariants in 6469 ms
[2023-03-22 22:32:45] [INFO ] Implicit Places using invariants in 8256 ms returned []
Implicit Place search using SMT only with invariants took 8277 ms to find 0 implicit places.
[2023-03-22 22:32:45] [INFO ] Flow matrix only has 40276 transitions (discarded 1056 similar events)
[2023-03-22 22:32:45] [INFO ] Invariant cache hit.
[2023-03-22 22:32:46] [INFO ] Dead Transitions using invariants and state equation in 1776 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23169/36664 places, 41332/54827 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16610 ms. Remains : 23169/36664 places, 41332/54827 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-06 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:(GEQ s3530 1), p1:(GEQ s823 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 96 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-06 finished in 16819 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)||(!p0&&F(!p1)))))'
Support contains 4 out of 36664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1682 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:32:48] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36664 cols
[2023-03-22 22:32:57] [INFO ] Computed 1973 place invariants in 9220 ms
[2023-03-22 22:33:00] [INFO ] Implicit Places using invariants in 11969 ms returned []
Implicit Place search using SMT only with invariants took 11984 ms to find 0 implicit places.
[2023-03-22 22:33:00] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:33:00] [INFO ] Invariant cache hit.
[2023-03-22 22:33:03] [INFO ] Dead Transitions using invariants and state equation in 2695 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16367 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s1831 1) (GEQ s2697 1)), p0:(AND (GEQ s22722 1) (GEQ s36639 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, null, null, null][false, false, false, false, false]]
Product exploration timeout after 38990 steps with 19495 reset in 10002 ms.
Product exploration timeout after 40500 steps with 20250 reset in 10002 ms.
Computed a total of 30648 stabilizing places and 42858 stable transitions
Computed a total of 30648 stabilizing places and 42858 stable transitions
Detected a total of 30648/36664 stabilizing places and 42858/54827 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 160 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-08 finished in 36973 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(p0))||G(p1)))'
Support contains 3 out of 36664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1658 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:33:25] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:33:25] [INFO ] Invariant cache hit.
[2023-03-22 22:33:28] [INFO ] Implicit Places using invariants in 2829 ms returned []
Implicit Place search using SMT only with invariants took 2841 ms to find 0 implicit places.
[2023-03-22 22:33:28] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:33:28] [INFO ] Invariant cache hit.
[2023-03-22 22:33:31] [INFO ] Dead Transitions using invariants and state equation in 2836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7349 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(LT s34422 1), p1:(OR (LT s8722 1) (LT s9705 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, null][false, false, false, false, false, false, false]]
Product exploration timeout after 58110 steps with 19370 reset in 10003 ms.
Product exploration timeout after 57180 steps with 19060 reset in 10002 ms.
Computed a total of 30648 stabilizing places and 42858 stable transitions
Computed a total of 30648 stabilizing places and 42858 stable transitions
Detected a total of 30648/36664 stabilizing places and 42858/54827 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0)))))
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-09 finished in 28108 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||(!(!p1 U X(p0))&&!p1))))'
Support contains 4 out of 36664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Drop transitions removed 12656 transitions
Trivial Post-agglo rules discarded 12656 transitions
Performed 12656 trivial Post agglomeration. Transition count delta: 12656
Iterating post reduction 0 with 12656 rules applied. Total rules applied 12656 place count 36664 transition count 42171
Reduce places removed 12656 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 12672 rules applied. Total rules applied 25328 place count 24008 transition count 42155
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 25344 place count 23992 transition count 42155
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 25344 place count 23992 transition count 41364
Deduced a syphon composed of 791 places in 56 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 26926 place count 23201 transition count 41364
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 40 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 26992 place count 23168 transition count 41331
Applied a total of 26992 rules in 6627 ms. Remains 23168 /36664 variables (removed 13496) and now considering 41331/54827 (removed 13496) transitions.
[2023-03-22 22:33:58] [INFO ] Flow matrix only has 40275 transitions (discarded 1056 similar events)
// Phase 1: matrix 40275 rows 23168 cols
[2023-03-22 22:34:05] [INFO ] Computed 1973 place invariants in 6477 ms
[2023-03-22 22:34:07] [INFO ] Implicit Places using invariants in 8241 ms returned []
Implicit Place search using SMT only with invariants took 8243 ms to find 0 implicit places.
[2023-03-22 22:34:07] [INFO ] Flow matrix only has 40275 transitions (discarded 1056 similar events)
[2023-03-22 22:34:07] [INFO ] Invariant cache hit.
[2023-03-22 22:34:08] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23168/36664 places, 41331/54827 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16713 ms. Remains : 23168/36664 places, 41331/54827 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9687 1) (GEQ s9854 1)), p1:(AND (GEQ s8518 1) (GEQ s8816 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-10 TRUE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-10 finished in 16849 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(X((X((G(F(p0))||F(p0))) U p1))))'
Support contains 2 out of 36664 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1683 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:34:10] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36664 cols
[2023-03-22 22:34:20] [INFO ] Computed 1973 place invariants in 9834 ms
[2023-03-22 22:34:23] [INFO ] Implicit Places using invariants in 12630 ms returned []
Implicit Place search using SMT only with invariants took 12642 ms to find 0 implicit places.
[2023-03-22 22:34:23] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:34:23] [INFO ] Invariant cache hit.
[2023-03-22 22:34:26] [INFO ] Dead Transitions using invariants and state equation in 2783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17113 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s9161 1) (GEQ s18363 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 120 steps with 0 reset in 7 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-11 finished in 17353 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))'
Support contains 2 out of 36664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Drop transitions removed 12656 transitions
Trivial Post-agglo rules discarded 12656 transitions
Performed 12656 trivial Post agglomeration. Transition count delta: 12656
Iterating post reduction 0 with 12656 rules applied. Total rules applied 12656 place count 36664 transition count 42171
Reduce places removed 12656 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 12672 rules applied. Total rules applied 25328 place count 24008 transition count 42155
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 25344 place count 23992 transition count 42155
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 25344 place count 23992 transition count 41364
Deduced a syphon composed of 791 places in 52 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 26926 place count 23201 transition count 41364
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 55 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 26992 place count 23168 transition count 41331
Applied a total of 26992 rules in 6716 ms. Remains 23168 /36664 variables (removed 13496) and now considering 41331/54827 (removed 13496) transitions.
[2023-03-22 22:34:33] [INFO ] Flow matrix only has 40275 transitions (discarded 1056 similar events)
// Phase 1: matrix 40275 rows 23168 cols
[2023-03-22 22:34:39] [INFO ] Computed 1973 place invariants in 6757 ms
[2023-03-22 22:34:41] [INFO ] Implicit Places using invariants in 8537 ms returned []
Implicit Place search using SMT only with invariants took 8551 ms to find 0 implicit places.
[2023-03-22 22:34:41] [INFO ] Flow matrix only has 40275 transitions (discarded 1056 similar events)
[2023-03-22 22:34:41] [INFO ] Invariant cache hit.
[2023-03-22 22:34:43] [INFO ] Dead Transitions using invariants and state equation in 1778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23168/36664 places, 41331/54827 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17049 ms. Remains : 23168/36664 places, 41331/54827 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-12 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}]], initial=1, aps=[p0:(OR (LT s3575 1) (LT s3610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 72993 steps with 744 reset in 2213 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-12 finished in 19418 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 36664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Drop transitions removed 12656 transitions
Trivial Post-agglo rules discarded 12656 transitions
Performed 12656 trivial Post agglomeration. Transition count delta: 12656
Iterating post reduction 0 with 12656 rules applied. Total rules applied 12656 place count 36664 transition count 42171
Reduce places removed 12656 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 12672 rules applied. Total rules applied 25328 place count 24008 transition count 42155
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 25344 place count 23992 transition count 42155
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 25344 place count 23992 transition count 41364
Deduced a syphon composed of 791 places in 58 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 26926 place count 23201 transition count 41364
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 40 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 26992 place count 23168 transition count 41331
Applied a total of 26992 rules in 6637 ms. Remains 23168 /36664 variables (removed 13496) and now considering 41331/54827 (removed 13496) transitions.
[2023-03-22 22:34:52] [INFO ] Flow matrix only has 40275 transitions (discarded 1056 similar events)
// Phase 1: matrix 40275 rows 23168 cols
[2023-03-22 22:34:58] [INFO ] Computed 1973 place invariants in 6568 ms
[2023-03-22 22:35:00] [INFO ] Implicit Places using invariants in 8361 ms returned []
Implicit Place search using SMT only with invariants took 8381 ms to find 0 implicit places.
[2023-03-22 22:35:00] [INFO ] Flow matrix only has 40275 transitions (discarded 1056 similar events)
[2023-03-22 22:35:00] [INFO ] Invariant cache hit.
[2023-03-22 22:35:02] [INFO ] Dead Transitions using invariants and state equation in 1792 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23168/36664 places, 41331/54827 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16824 ms. Remains : 23168/36664 places, 41331/54827 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-13 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 s3511 1) (GEQ s3604 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 100 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-13 finished in 16964 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' '!((p0 U X(!p1)))'
Support contains 3 out of 36664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36664/36664 places, 54827/54827 transitions.
Applied a total of 0 rules in 1654 ms. Remains 36664 /36664 variables (removed 0) and now considering 54827/54827 (removed 0) transitions.
[2023-03-22 22:35:04] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
// Phase 1: matrix 53771 rows 36664 cols
[2023-03-22 22:35:14] [INFO ] Computed 1973 place invariants in 9915 ms
[2023-03-22 22:35:17] [INFO ] Implicit Places using invariants in 12699 ms returned []
Implicit Place search using SMT only with invariants took 12713 ms to find 0 implicit places.
[2023-03-22 22:35:17] [INFO ] Flow matrix only has 53771 transitions (discarded 1056 similar events)
[2023-03-22 22:35:17] [INFO ] Invariant cache hit.
[2023-03-22 22:35:19] [INFO ] Dead Transitions using invariants and state equation in 2865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17240 ms. Remains : 36664/36664 places, 54827/54827 transitions.
Stuttering acceptance computed with spot in 113 ms :[p1, true, p1, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GEQ s25799 1), p1:(AND (GEQ s26478 1) (GEQ s35869 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, null, null][false, false, false, false]]
Product exploration timeout after 40950 steps with 20475 reset in 10003 ms.
Product exploration timeout after 40930 steps with 20465 reset in 10021 ms.
Computed a total of 30648 stabilizing places and 42858 stable transitions
Computed a total of 30648 stabilizing places and 42858 stable transitions
Detected a total of 30648/36664 stabilizing places and 42858/54827 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 10 factoid took 188 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C12-LTLFireability-15 finished in 37874 ms.
All properties solved by simple procedures.
Total runtime 536358 ms.
ITS solved all properties within timeout

BK_STOP 1679524541608

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S32C12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C12, 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 r231-tall-167856416800972"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C12.tgz
mv MultiCrashLeafsetExtension-PT-S32C12 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 ;