Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100764.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 39M 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 CANInsertWithFailure-PT-080-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678665814543

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:03:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:03:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:03:38] [INFO ] Load time of PNML (sax parser for PT used): 1199 ms
[2023-03-13 00:03:38] [INFO ] Transformed 13764 places.
[2023-03-13 00:03:38] [INFO ] Transformed 38880 transitions.
[2023-03-13 00:03:38] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1544 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4455 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:03:52] [INFO ] Computed 82 place invariants in 8952 ms
[2023-03-13 00:03:54] [INFO ] Implicit Places using invariants in 10951 ms returned []
Implicit Place search using SMT only with invariants took 11011 ms to find 0 implicit places.
[2023-03-13 00:03:54] [INFO ] Invariant cache hit.
[2023-03-13 00:03:56] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17076 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 45 out of 13763 places after structural reductions.
[2023-03-13 00:03:58] [INFO ] Flatten gal took : 1634 ms
[2023-03-13 00:03:59] [INFO ] Flatten gal took : 1040 ms
[2023-03-13 00:04:01] [INFO ] Input system was already deterministic with 38880 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1369 ms. (steps per millisecond=7 ) properties (out of 32) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-13 00:04:03] [INFO ] Invariant cache hit.
[2023-03-13 00:04:09] [INFO ] [Real]Absence check using 80 positive place invariants in 203 ms returned sat
[2023-03-13 00:04:09] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 276 ms returned sat
[2023-03-13 00:04:28] [INFO ] After 12327ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27
[2023-03-13 00:04:28] [INFO ] State equation strengthened by 12720 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-13 00:04:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:04:28] [INFO ] After 25243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 13763 transition count 38333
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 13216 transition count 38333
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1094 place count 13216 transition count 38330
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1100 place count 13213 transition count 38330
Performed 6302 Post agglomeration using F-continuation condition.Transition count delta: 6302
Deduced a syphon composed of 6302 places in 22 ms
Reduce places removed 6302 places and 0 transitions.
Iterating global reduction 2 with 12604 rules applied. Total rules applied 13704 place count 6911 transition count 32028
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 13715 place count 6911 transition count 32017
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 13726 place count 6900 transition count 32017
Partial Free-agglomeration rule applied 6473 times.
Drop transitions removed 6473 transitions
Iterating global reduction 3 with 6473 rules applied. Total rules applied 20199 place count 6900 transition count 32017
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 3 with 239 rules applied. Total rules applied 20438 place count 6900 transition count 32017
Applied a total of 20438 rules in 18433 ms. Remains 6900 /13763 variables (removed 6863) and now considering 32017/38880 (removed 6863) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18447 ms. Remains : 6900/13763 places, 32017/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-13 00:04:48] [INFO ] Flow matrix only has 32006 transitions (discarded 11 similar events)
// Phase 1: matrix 32006 rows 6900 cols
[2023-03-13 00:04:50] [INFO ] Computed 82 place invariants in 2206 ms
[2023-03-13 00:04:53] [INFO ] [Real]Absence check using 80 positive place invariants in 114 ms returned sat
[2023-03-13 00:04:53] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 118 ms returned sat
[2023-03-13 00:05:15] [INFO ] After 20633ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-13 00:05:16] [INFO ] State equation strengthened by 31708 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-13 00:05:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:05:16] [INFO ] After 25555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 6900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6900/6900 places, 32017/32017 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 6895 transition count 32012
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 6895 transition count 32012
Applied a total of 14 rules in 7480 ms. Remains 6895 /6900 variables (removed 5) and now considering 32012/32017 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7480 ms. Remains : 6895/6900 places, 32012/32017 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 889 ms. (steps per millisecond=11 ) properties (out of 17) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 00:05:24] [INFO ] Flow matrix only has 32005 transitions (discarded 7 similar events)
// Phase 1: matrix 32005 rows 6895 cols
[2023-03-13 00:05:26] [INFO ] Computed 82 place invariants in 2020 ms
[2023-03-13 00:05:28] [INFO ] [Real]Absence check using 80 positive place invariants in 55 ms returned sat
[2023-03-13 00:05:28] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2023-03-13 00:05:51] [INFO ] After 23014ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-03-13 00:05:52] [INFO ] State equation strengthened by 31722 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-13 00:05:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:05:52] [INFO ] After 25353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 11 out of 6895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6895/6895 places, 32012/32012 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 6891 transition count 32008
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 6891 transition count 32008
Applied a total of 14 rules in 6759 ms. Remains 6891 /6895 variables (removed 4) and now considering 32008/32012 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6759 ms. Remains : 6891/6895 places, 32008/32012 transitions.
Computed a total of 322 stabilizing places and 560 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' '!(G((p0||X(X(X(G(p1)))))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3737 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:06:11] [INFO ] Computed 82 place invariants in 8066 ms
[2023-03-13 00:06:12] [INFO ] Implicit Places using invariants in 9244 ms returned []
Implicit Place search using SMT only with invariants took 9258 ms to find 0 implicit places.
[2023-03-13 00:06:12] [INFO ] Invariant cache hit.
[2023-03-13 00:06:13] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14107 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1029 1) (GEQ s5533 1)), p1:(LT s3244 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30819 steps with 16 reset in 854 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-01 finished in 15371 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) U X(p1))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3646 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:06:18] [INFO ] Invariant cache hit.
[2023-03-13 00:06:19] [INFO ] Implicit Places using invariants in 1316 ms returned []
Implicit Place search using SMT only with invariants took 1319 ms to find 0 implicit places.
[2023-03-13 00:06:19] [INFO ] Invariant cache hit.
[2023-03-13 00:06:20] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6069 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s329 1)), p1:(GEQ s8689 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-02 finished in 6397 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 U (p1||G(p0))))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 12 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 9081 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2023-03-13 00:06:30] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2023-03-13 00:06:34] [INFO ] Computed 82 place invariants in 4273 ms
[2023-03-13 00:06:36] [INFO ] Implicit Places using invariants in 6146 ms returned []
Implicit Place search using SMT only with invariants took 6147 ms to find 0 implicit places.
[2023-03-13 00:06:36] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-13 00:06:36] [INFO ] Invariant cache hit.
[2023-03-13 00:06:53] [INFO ] Dead Transitions using invariants and state equation in 17099 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32331 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s4973 1) (LT s3834 1)), p0:(LT s3834 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 247 reset in 2770 ms.
Product exploration explored 100000 steps with 250 reset in 3018 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:07:00] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-13 00:07:00] [INFO ] Invariant cache hit.
[2023-03-13 00:07:01] [INFO ] [Real]Absence check using 80 positive place invariants in 66 ms returned sat
[2023-03-13 00:07:01] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 119 ms returned sat
[2023-03-13 00:07:11] [INFO ] After 9992ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 00:07:11] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2023-03-13 00:07:13] [INFO ] After 2142ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:07:13] [INFO ] After 13392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:07:14] [INFO ] [Nat]Absence check using 80 positive place invariants in 240 ms returned sat
[2023-03-13 00:07:14] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 91 ms returned sat
[2023-03-13 00:07:27] [INFO ] After 13165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:07:30] [INFO ] After 2201ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 00:07:31] [INFO ] After 3212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 751 ms.
[2023-03-13 00:07:31] [INFO ] After 18330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 6237 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6238 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Finished random walk after 2283 steps, including 4 resets, run visited all 1 properties in 71 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1891 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2023-03-13 00:07:40] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-13 00:07:40] [INFO ] Invariant cache hit.
[2023-03-13 00:07:42] [INFO ] Implicit Places using invariants in 2078 ms returned []
Implicit Place search using SMT only with invariants took 2093 ms to find 0 implicit places.
[2023-03-13 00:07:42] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-13 00:07:42] [INFO ] Invariant cache hit.
[2023-03-13 00:08:00] [INFO ] Dead Transitions using invariants and state equation in 17374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21384 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 00:08:00] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-13 00:08:00] [INFO ] Invariant cache hit.
[2023-03-13 00:08:01] [INFO ] [Real]Absence check using 80 positive place invariants in 98 ms returned sat
[2023-03-13 00:08:01] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 113 ms returned sat
[2023-03-13 00:08:13] [INFO ] After 11858ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 00:08:13] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2023-03-13 00:08:16] [INFO ] After 2233ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:08:16] [INFO ] After 15247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:08:16] [INFO ] [Nat]Absence check using 80 positive place invariants in 82 ms returned sat
[2023-03-13 00:08:17] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 107 ms returned sat
[2023-03-13 00:08:29] [INFO ] After 12476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:08:31] [INFO ] After 2089ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 00:08:32] [INFO ] After 2967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 697 ms.
[2023-03-13 00:08:33] [INFO ] After 17103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 6121 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6121 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75728 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75728 steps, saw 64275 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2023-03-13 00:08:44] [INFO ] Computed 82 place invariants in 1978 ms
[2023-03-13 00:08:45] [INFO ] [Real]Absence check using 80 positive place invariants in 71 ms returned sat
[2023-03-13 00:08:45] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2023-03-13 00:08:59] [INFO ] After 13740ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 00:08:59] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2023-03-13 00:09:07] [INFO ] After 7936ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:09:07] [INFO ] After 23033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:09:08] [INFO ] [Nat]Absence check using 80 positive place invariants in 56 ms returned sat
[2023-03-13 00:09:08] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2023-03-13 00:09:23] [INFO ] After 14749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 00:09:27] [INFO ] After 4246ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 00:09:28] [INFO ] After 5414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 829 ms.
[2023-03-13 00:09:29] [INFO ] After 21888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2233 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2234 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2253 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2023-03-13 00:09:34] [INFO ] Invariant cache hit.
[2023-03-13 00:09:39] [INFO ] Implicit Places using invariants in 5791 ms returned []
Implicit Place search using SMT only with invariants took 5792 ms to find 0 implicit places.
[2023-03-13 00:09:39] [INFO ] Invariant cache hit.
[2023-03-13 00:09:57] [INFO ] Dead Transitions using invariants and state equation in 17216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25293 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 249 reset in 2969 ms.
Product exploration explored 100000 steps with 249 reset in 2926 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1902 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2023-03-13 00:10:05] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2023-03-13 00:10:09] [INFO ] Computed 82 place invariants in 3895 ms
[2023-03-13 00:10:10] [INFO ] Implicit Places using invariants in 5369 ms returned []
Implicit Place search using SMT only with invariants took 5382 ms to find 0 implicit places.
[2023-03-13 00:10:10] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-13 00:10:10] [INFO ] Invariant cache hit.
[2023-03-13 00:10:28] [INFO ] Dead Transitions using invariants and state equation in 17183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24469 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-03 finished in 248277 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)))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 16 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8940 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2023-03-13 00:10:38] [INFO ] Flow matrix only has 25841 transitions (discarded 6161 similar events)
// Phase 1: matrix 25841 rows 6885 cols
[2023-03-13 00:10:42] [INFO ] Computed 82 place invariants in 4009 ms
[2023-03-13 00:10:44] [INFO ] Implicit Places using invariants in 5619 ms returned []
Implicit Place search using SMT only with invariants took 5621 ms to find 0 implicit places.
[2023-03-13 00:10:44] [INFO ] Flow matrix only has 25841 transitions (discarded 6161 similar events)
[2023-03-13 00:10:44] [INFO ] Invariant cache hit.
[2023-03-13 00:11:00] [INFO ] Dead Transitions using invariants and state equation in 16780 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31344 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2592 1) (AND (GEQ s299 1) (GEQ s5494 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 422 steps with 0 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-04 finished in 31468 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&&G(p1))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 14 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13752 place count 6887 transition count 32004
Applied a total of 13752 rules in 8703 ms. Remains 6887 /13763 variables (removed 6876) and now considering 32004/38880 (removed 6876) transitions.
[2023-03-13 00:11:09] [INFO ] Flow matrix only has 25844 transitions (discarded 6160 similar events)
// Phase 1: matrix 25844 rows 6887 cols
[2023-03-13 00:11:13] [INFO ] Computed 82 place invariants in 4077 ms
[2023-03-13 00:11:14] [INFO ] Implicit Places using invariants in 4741 ms returned []
Implicit Place search using SMT only with invariants took 4743 ms to find 0 implicit places.
[2023-03-13 00:11:14] [INFO ] Flow matrix only has 25844 transitions (discarded 6160 similar events)
[2023-03-13 00:11:14] [INFO ] Invariant cache hit.
[2023-03-13 00:11:15] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6887/13763 places, 32004/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14099 ms. Remains : 6887/13763 places, 32004/38880 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6163 1), p1:(AND (GEQ s167 1) (GEQ s235 1) (GEQ s5090 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 410 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-05 finished in 14271 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((F((!p2 U (p3||G(!p2))))&&p1))&&p0)))'
Support contains 7 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3677 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:11:27] [INFO ] Computed 82 place invariants in 9041 ms
[2023-03-13 00:11:28] [INFO ] Implicit Places using invariants in 10068 ms returned []
Implicit Place search using SMT only with invariants took 10069 ms to find 0 implicit places.
[2023-03-13 00:11:28] [INFO ] Invariant cache hit.
[2023-03-13 00:11:30] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14849 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (OR (NOT p1) (AND p2 (NOT p3))), (AND (NOT p3) p2)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1057 1) (GEQ s11699 1)), p1:(AND (GEQ s245 1) (GEQ s8109 1)), p3:(AND (LT s2266 1) (NOT (AND (GEQ s721 1) (GEQ s12917 1)))), p2:(AND (GEQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-06 finished in 15079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))&&(F(X(p2))||F(p0))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3510 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:11:33] [INFO ] Invariant cache hit.
[2023-03-13 00:11:34] [INFO ] Implicit Places using invariants in 1187 ms returned []
Implicit Place search using SMT only with invariants took 1188 ms to find 0 implicit places.
[2023-03-13 00:11:35] [INFO ] Invariant cache hit.
[2023-03-13 00:11:36] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5757 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s259 1) (GEQ s5583 1)), p1:(AND (GEQ s208 1) (GEQ s777 1)), p2:(GEQ s5060 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2174 steps with 0 reset in 48 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-07 finished in 5989 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 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 12 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8532 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2023-03-13 00:11:44] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2023-03-13 00:11:48] [INFO ] Computed 82 place invariants in 3905 ms
[2023-03-13 00:11:50] [INFO ] Implicit Places using invariants in 5333 ms returned []
Implicit Place search using SMT only with invariants took 5347 ms to find 0 implicit places.
[2023-03-13 00:11:50] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2023-03-13 00:11:50] [INFO ] Invariant cache hit.
[2023-03-13 00:12:06] [INFO ] Dead Transitions using invariants and state equation in 16226 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30126 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-08 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:(OR (LT s186 1) (LT s3795 1)), p1:(OR (LT s90 1) (LT s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 247 reset in 2908 ms.
Stack based approach found an accepted trace after 15825 steps with 38 reset with depth 393 and stack size 393 in 428 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-08 finished in 33611 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 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 13 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 8172 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2023-03-13 00:12:18] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
// Phase 1: matrix 25839 rows 6884 cols
[2023-03-13 00:12:21] [INFO ] Computed 82 place invariants in 3876 ms
[2023-03-13 00:12:22] [INFO ] Implicit Places using invariants in 4552 ms returned []
Implicit Place search using SMT only with invariants took 4579 ms to find 0 implicit places.
[2023-03-13 00:12:22] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2023-03-13 00:12:22] [INFO ] Invariant cache hit.
[2023-03-13 00:12:39] [INFO ] Dead Transitions using invariants and state equation in 16477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29246 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-09 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 s59 1) (GEQ s5133 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 424 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-09 finished in 29365 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)))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3537 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-13 00:12:51] [INFO ] Computed 82 place invariants in 8359 ms
[2023-03-13 00:12:52] [INFO ] Implicit Places using invariants in 9571 ms returned []
Implicit Place search using SMT only with invariants took 9608 ms to find 0 implicit places.
[2023-03-13 00:12:52] [INFO ] Invariant cache hit.
[2023-03-13 00:12:53] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14232 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s13214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-10 finished in 14405 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((X(p0)&&(X(G(p1))||G(p2))))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3540 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:12:57] [INFO ] Invariant cache hit.
[2023-03-13 00:12:58] [INFO ] Implicit Places using invariants in 1196 ms returned []
Implicit Place search using SMT only with invariants took 1209 ms to find 0 implicit places.
[2023-03-13 00:12:58] [INFO ] Invariant cache hit.
[2023-03-13 00:12:59] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5879 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(LT s8254 1), p1:(OR (LT s637 1) (LT s5951 1)), p0:(OR (LT s147 1) (LT s6199 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1064 steps with 0 reset in 27 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-11 finished in 6223 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(p0)&&F(p1))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3594 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:13:03] [INFO ] Invariant cache hit.
[2023-03-13 00:13:04] [INFO ] Implicit Places using invariants in 1129 ms returned []
Implicit Place search using SMT only with invariants took 1134 ms to find 0 implicit places.
[2023-03-13 00:13:04] [INFO ] Invariant cache hit.
[2023-03-13 00:13:05] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5839 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s6061 1), p0:(GEQ s7041 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1864 steps with 0 reset in 42 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-12 finished in 6110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))&&X(p2)))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3714 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:13:09] [INFO ] Invariant cache hit.
[2023-03-13 00:13:10] [INFO ] Implicit Places using invariants in 1046 ms returned []
Implicit Place search using SMT only with invariants took 1060 ms to find 0 implicit places.
[2023-03-13 00:13:10] [INFO ] Invariant cache hit.
[2023-03-13 00:13:11] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5854 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2152 1), p2:(AND (GEQ s2152 1) (GEQ s12688 1)), p1:(LT s5160 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-13 finished in 6190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&G((F(p3)||p2))))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3654 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-13 00:13:15] [INFO ] Invariant cache hit.
[2023-03-13 00:13:17] [INFO ] Implicit Places using invariants in 1233 ms returned []
Implicit Place search using SMT only with invariants took 1234 ms to find 0 implicit places.
[2023-03-13 00:13:17] [INFO ] Invariant cache hit.
[2023-03-13 00:13:18] [INFO ] Dead Transitions using invariants and state equation in 1094 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5986 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3160 1), p1:(GEQ s13104 1), p2:(OR (LT s530 1) (LT s1029 1)), p3:(OR (LT s530 1) (LT s1029 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-15 finished in 6206 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 U (p1||G(p0))))))'
[2023-03-13 00:13:19] [INFO ] Flatten gal took : 765 ms
[2023-03-13 00:13:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-13 00:13:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 13763 places, 38880 transitions and 103840 arcs took 126 ms.
Total runtime 582579 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1030/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-080-LTLFireability-03

BK_STOP 1678666472426

--------------------
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
mcc2023
ltl formula name CANInsertWithFailure-PT-080-LTLFireability-03
ltl formula formula --ltl=/tmp/1030/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 13763 places, 38880 transitions and 103840 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.130 real 0.940 user 1.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5569d5e973f4]
1: pnml2lts-mc(+0xa2496) [0x5569d5e97496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f91c8a41140]
3: pnml2lts-mc(+0x405be5) [0x5569d61fabe5]
4: pnml2lts-mc(+0x16b3f9) [0x5569d5f603f9]
5: pnml2lts-mc(+0x164ac4) [0x5569d5f59ac4]
6: pnml2lts-mc(+0x272e0a) [0x5569d6067e0a]
7: pnml2lts-mc(+0xb61f0) [0x5569d5eab1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f91c88944d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f91c889467a]
10: pnml2lts-mc(+0xa1581) [0x5569d5e96581]
11: pnml2lts-mc(+0xa1910) [0x5569d5e96910]
12: pnml2lts-mc(+0xa32a2) [0x5569d5e982a2]
13: pnml2lts-mc(+0xa50f4) [0x5569d5e9a0f4]
14: pnml2lts-mc(+0x3f34b3) [0x5569d61e84b3]
15: pnml2lts-mc(+0x7c63d) [0x5569d5e7163d]
16: pnml2lts-mc(+0x67d86) [0x5569d5e5cd86]
17: pnml2lts-mc(+0x60a8a) [0x5569d5e55a8a]
18: pnml2lts-mc(+0x5eb15) [0x5569d5e53b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f91c887cd0a]
20: pnml2lts-mc(+0x6075e) [0x5569d5e5575e]

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="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-080, 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 r041-tajo-167813695100764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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