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.r039-tajo-167813693000772.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 lolaxred
Input is CANInsertWithFailure-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813693000772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 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 49M 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-090-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678509981166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 04:46:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 04:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:46:24] [INFO ] Load time of PNML (sax parser for PT used): 1220 ms
[2023-03-11 04:46:24] [INFO ] Transformed 17284 places.
[2023-03-11 04:46:24] [INFO ] Transformed 49140 transitions.
[2023-03-11 04:46:24] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1574 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 17284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17283 transition count 49140
Applied a total of 1 rules in 8573 ms. Remains 17283 /17284 variables (removed 1) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-11 04:46:49] [INFO ] Computed 92 place invariants in 15079 ms
[2023-03-11 04:46:51] [INFO ] Implicit Places using invariants in 17049 ms returned []
Implicit Place search using SMT only with invariants took 17088 ms to find 0 implicit places.
[2023-03-11 04:46:51] [INFO ] Invariant cache hit.
[2023-03-11 04:46:52] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17283/17284 places, 49140/49140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27051 ms. Remains : 17283/17284 places, 49140/49140 transitions.
Support contains 37 out of 17283 places after structural reductions.
[2023-03-11 04:46:54] [INFO ] Flatten gal took : 1547 ms
[2023-03-11 04:46:56] [INFO ] Flatten gal took : 1261 ms
[2023-03-11 04:46:58] [INFO ] Input system was already deterministic with 49140 transitions.
Support contains 34 out of 17283 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1012 ms. (steps per millisecond=9 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-11 04:47:00] [INFO ] Invariant cache hit.
[2023-03-11 04:47:08] [INFO ] [Real]Absence check using 90 positive place invariants in 255 ms returned sat
[2023-03-11 04:47:09] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 498 ms returned sat
[2023-03-11 04:47:12] [INFO ] After 12676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-11 04:47:21] [INFO ] [Nat]Absence check using 90 positive place invariants in 229 ms returned sat
[2023-03-11 04:47:21] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 449 ms returned sat
[2023-03-11 04:47:37] [INFO ] After 10138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-11 04:47:38] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 04:47:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:47:38] [INFO ] After 25229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 621 transitions
Trivial Post-agglo rules discarded 621 transitions
Performed 621 trivial Post agglomeration. Transition count delta: 621
Iterating post reduction 0 with 621 rules applied. Total rules applied 621 place count 17283 transition count 48519
Reduce places removed 621 places and 0 transitions.
Iterating post reduction 1 with 621 rules applied. Total rules applied 1242 place count 16662 transition count 48519
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1242 place count 16662 transition count 48515
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1250 place count 16658 transition count 48515
Performed 7993 Post agglomeration using F-continuation condition.Transition count delta: 7993
Deduced a syphon composed of 7993 places in 19 ms
Reduce places removed 7993 places and 0 transitions.
Iterating global reduction 2 with 15986 rules applied. Total rules applied 17236 place count 8665 transition count 40522
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17242 place count 8665 transition count 40516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 17248 place count 8659 transition count 40516
Partial Free-agglomeration rule applied 8188 times.
Drop transitions removed 8188 transitions
Iterating global reduction 3 with 8188 rules applied. Total rules applied 25436 place count 8659 transition count 40516
Partial Free-agglomeration rule applied 360 times.
Drop transitions removed 360 transitions
Iterating global reduction 3 with 360 rules applied. Total rules applied 25796 place count 8659 transition count 40516
Applied a total of 25796 rules in 26354 ms. Remains 8659 /17283 variables (removed 8624) and now considering 40516/49140 (removed 8624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26357 ms. Remains : 8659/17283 places, 40516/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 727 ms. (steps per millisecond=13 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 04:48:05] [INFO ] Flow matrix only has 40509 transitions (discarded 7 similar events)
// Phase 1: matrix 40509 rows 8659 cols
[2023-03-11 04:48:08] [INFO ] Computed 92 place invariants in 3080 ms
[2023-03-11 04:48:11] [INFO ] [Real]Absence check using 90 positive place invariants in 110 ms returned sat
[2023-03-11 04:48:11] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 172 ms returned sat
[2023-03-11 04:48:13] [INFO ] After 4760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 04:48:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 64 ms returned sat
[2023-03-11 04:48:15] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 118 ms returned sat
[2023-03-11 04:48:38] [INFO ] After 21271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-11 04:48:38] [INFO ] State equation strengthened by 40190 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 04:48:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:48:38] [INFO ] After 25355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 8659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8659/8659 places, 40516/40516 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 8651 transition count 40508
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 8651 transition count 40508
Applied a total of 18 rules in 9936 ms. Remains 8651 /8659 variables (removed 8) and now considering 40508/40516 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9936 ms. Remains : 8651/8659 places, 40508/40516 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(X(p1)||F(p2)))))'
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6226 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-11 04:49:07] [INFO ] Computed 92 place invariants in 12337 ms
[2023-03-11 04:49:09] [INFO ] Implicit Places using invariants in 13832 ms returned []
Implicit Place search using SMT only with invariants took 13834 ms to find 0 implicit places.
[2023-03-11 04:49:09] [INFO ] Invariant cache hit.
[2023-03-11 04:49:11] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21772 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s1416 1) (LT s14830 1)), p2:(AND (GEQ s91 1) (GEQ s4479 1)), p1:(GEQ s7376 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 3916 steps with 1 reset in 291 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-00 finished in 22701 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)&&X(p1)) U X(G((p0||(p1 U p2))))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6077 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-11 04:49:18] [INFO ] Invariant cache hit.
[2023-03-11 04:49:19] [INFO ] Implicit Places using invariants in 1586 ms returned []
Implicit Place search using SMT only with invariants took 1591 ms to find 0 implicit places.
[2023-03-11 04:49:19] [INFO ] Invariant cache hit.
[2023-03-11 04:49:20] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8958 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(OR p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s54 1) (GEQ s329 1)), p1:(LT s11797 1), p2:(GEQ s7318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28513 reset in 7513 ms.
Product exploration explored 100000 steps with 28579 reset in 6556 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p0 p1 p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 1154 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 04:49:37] [INFO ] Invariant cache hit.
[2023-03-11 04:49:41] [INFO ] [Real]Absence check using 90 positive place invariants in 268 ms returned sat
[2023-03-11 04:49:42] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 504 ms returned sat
[2023-03-11 04:49:43] [INFO ] After 5726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 04:49:47] [INFO ] [Nat]Absence check using 90 positive place invariants in 194 ms returned sat
[2023-03-11 04:49:47] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 479 ms returned sat
[2023-03-11 04:50:08] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 20 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17276 place count 8646 transition count 40501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8191 times.
Drop transitions removed 8191 transitions
Iterating global reduction 3 with 8191 rules applied. Total rules applied 25469 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 3 with 90 rules applied. Total rules applied 25559 place count 8644 transition count 40501
Applied a total of 25559 rules in 23649 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23650 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 04:50:32] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
// Phase 1: matrix 40500 rows 8644 cols
[2023-03-11 04:50:35] [INFO ] Computed 92 place invariants in 3061 ms
[2023-03-11 04:50:36] [INFO ] [Real]Absence check using 90 positive place invariants in 81 ms returned sat
[2023-03-11 04:50:37] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 131 ms returned sat
[2023-03-11 04:51:00] [INFO ] After 23701ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:51:01] [INFO ] State equation strengthened by 40226 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 04:51:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:51:01] [INFO ] After 25390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3437 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3438 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82952 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82952 steps, saw 77445 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 04:51:08] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
[2023-03-11 04:51:08] [INFO ] Invariant cache hit.
[2023-03-11 04:51:09] [INFO ] [Real]Absence check using 90 positive place invariants in 96 ms returned sat
[2023-03-11 04:51:09] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 173 ms returned sat
[2023-03-11 04:51:09] [INFO ] After 1720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 04:51:11] [INFO ] [Nat]Absence check using 90 positive place invariants in 88 ms returned sat
[2023-03-11 04:51:11] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 205 ms returned sat
[2023-03-11 04:51:34] [INFO ] After 23134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:51:35] [INFO ] State equation strengthened by 40226 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 04:51:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:51:35] [INFO ] After 25381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3692 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3693 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3311 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
[2023-03-11 04:51:42] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
[2023-03-11 04:51:42] [INFO ] Invariant cache hit.
[2023-03-11 04:51:43] [INFO ] Implicit Places using invariants in 1008 ms returned []
Implicit Place search using SMT only with invariants took 1012 ms to find 0 implicit places.
[2023-03-11 04:51:43] [INFO ] Flow matrix only has 40500 transitions (discarded 1 similar events)
[2023-03-11 04:51:43] [INFO ] Invariant cache hit.
[2023-03-11 04:52:08] [INFO ] Dead Transitions using invariants and state equation in 25490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29826 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p0 p1 p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR p0 p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1 p2)))
Knowledge based reduction with 19 factoid took 452 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-01 finished in 177463 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 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 20 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Applied a total of 17276 rules in 13118 ms. Remains 8645 /17283 variables (removed 8638) and now considering 40502/49140 (removed 8638) transitions.
[2023-03-11 04:52:22] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
// Phase 1: matrix 32672 rows 8645 cols
[2023-03-11 04:52:29] [INFO ] Computed 92 place invariants in 6578 ms
[2023-03-11 04:52:29] [INFO ] Implicit Places using invariants in 7455 ms returned []
Implicit Place search using SMT only with invariants took 7461 ms to find 0 implicit places.
[2023-03-11 04:52:29] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
[2023-03-11 04:52:29] [INFO ] Invariant cache hit.
[2023-03-11 04:52:30] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/17283 places, 40502/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21363 ms. Remains : 8645/17283 places, 40502/49140 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-02 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 s1455 1) (GEQ s4401 1)), p0:(GEQ s4401 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 467 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-02 finished in 21568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(G((X(p2)&&p1)))))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5917 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-11 04:52:52] [INFO ] Computed 92 place invariants in 16082 ms
[2023-03-11 04:52:54] [INFO ] Implicit Places using invariants in 17368 ms returned []
Implicit Place search using SMT only with invariants took 17370 ms to find 0 implicit places.
[2023-03-11 04:52:54] [INFO ] Invariant cache hit.
[2023-03-11 04:52:55] [INFO ] Dead Transitions using invariants and state equation in 1424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24757 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1118 1) (GEQ s1197 1)), p1:(AND (GEQ s1118 1) (GEQ s1197 1)), p2:(GEQ s7512 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 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-03 finished in 25105 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||F(G(p1)))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6527 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-11 04:53:02] [INFO ] Invariant cache hit.
[2023-03-11 04:53:03] [INFO ] Implicit Places using invariants in 1336 ms returned []
Implicit Place search using SMT only with invariants took 1340 ms to find 0 implicit places.
[2023-03-11 04:53:03] [INFO ] Invariant cache hit.
[2023-03-11 04:53:05] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9211 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s5074 1), p1:(OR (LT s91 1) (LT s782 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 44 reset in 3436 ms.
Product exploration explored 100000 steps with 45 reset in 3203 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Finished random walk after 7981 steps, including 3 resets, run visited all 1 properties in 277 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Support contains 2 out of 17283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 22 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Applied a total of 17274 rules in 12341 ms. Remains 8646 /17283 variables (removed 8637) and now considering 40503/49140 (removed 8637) transitions.
[2023-03-11 04:53:25] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
// Phase 1: matrix 32672 rows 8646 cols
[2023-03-11 04:53:31] [INFO ] Computed 92 place invariants in 6214 ms
[2023-03-11 04:53:34] [INFO ] Implicit Places using invariants in 9143 ms returned []
Implicit Place search using SMT only with invariants took 9145 ms to find 0 implicit places.
[2023-03-11 04:53:34] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
[2023-03-11 04:53:34] [INFO ] Invariant cache hit.
[2023-03-11 04:53:57] [INFO ] Dead Transitions using invariants and state equation in 22972 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/17283 places, 40503/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44476 ms. Remains : 8646/17283 places, 40503/49140 transitions.
Computed a total of 271 stabilizing places and 450 stable transitions
Computed a total of 271 stabilizing places and 450 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 1266 steps, including 2 resets, run visited all 1 properties in 48 ms. (steps per millisecond=26 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Product exploration explored 100000 steps with 219 reset in 2979 ms.
Stack based approach found an accepted trace after 27134 steps with 59 reset with depth 472 and stack size 471 in 860 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-05 finished in 66096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U (p2||G(p1)))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8007 Post agglomeration using F-continuation condition.Transition count delta: 8007
Deduced a syphon composed of 8007 places in 21 ms
Reduce places removed 8007 places and 0 transitions.
Iterating global reduction 2 with 16014 rules applied. Total rules applied 17272 place count 8647 transition count 40504
Applied a total of 17272 rules in 12341 ms. Remains 8647 /17283 variables (removed 8636) and now considering 40504/49140 (removed 8636) transitions.
[2023-03-11 04:54:14] [INFO ] Flow matrix only has 32674 transitions (discarded 7830 similar events)
// Phase 1: matrix 32674 rows 8647 cols
[2023-03-11 04:54:20] [INFO ] Computed 92 place invariants in 6265 ms
[2023-03-11 04:54:22] [INFO ] Implicit Places using invariants in 8266 ms returned []
Implicit Place search using SMT only with invariants took 8280 ms to find 0 implicit places.
[2023-03-11 04:54:22] [INFO ] Flow matrix only has 32674 transitions (discarded 7830 similar events)
[2023-03-11 04:54:22] [INFO ] Invariant cache hit.
[2023-03-11 04:54:45] [INFO ] Dead Transitions using invariants and state equation in 22435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8647/17283 places, 40504/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43071 ms. Remains : 8647/17283 places, 40504/49140 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (LT s3004 1) (OR (AND (GEQ s66 1) (GEQ s186 1)) (GEQ s2124 1))), p1:(OR (AND (GEQ s66 1) (GEQ s186 1)) (GEQ s2124 1)), p0:(OR (LT s66 1) (LT s186 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 381 steps with 0 reset in 13 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-07 finished in 43273 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||X(X(p1)))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5226 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-11 04:55:04] [INFO ] Computed 92 place invariants in 14303 ms
[2023-03-11 04:55:06] [INFO ] Implicit Places using invariants in 15715 ms returned []
Implicit Place search using SMT only with invariants took 15729 ms to find 0 implicit places.
[2023-03-11 04:55:06] [INFO ] Invariant cache hit.
[2023-03-11 04:55:07] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22299 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s3305 1), p1:(GEQ s884 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3019 steps with 1 reset in 129 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-08 finished in 22672 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(F(p0)))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5426 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-11 04:55:13] [INFO ] Invariant cache hit.
[2023-03-11 04:55:14] [INFO ] Implicit Places using invariants in 1375 ms returned []
Implicit Place search using SMT only with invariants took 1382 ms to find 0 implicit places.
[2023-03-11 04:55:14] [INFO ] Invariant cache hit.
[2023-03-11 04:55:16] [INFO ] Dead Transitions using invariants and state equation in 1635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8447 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s1202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3170 steps with 1 reset in 90 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-10 finished in 8748 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||X((p1||F(p2)||G(p3))))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5672 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-11 04:55:22] [INFO ] Invariant cache hit.
[2023-03-11 04:55:23] [INFO ] Implicit Places using invariants in 1428 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-11 04:55:23] [INFO ] Invariant cache hit.
[2023-03-11 04:55:25] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8429 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4969 1), p1:(LT s4418 1), p2:(LT s6941 1), p3:(LT s2741 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 9387 ms.
Product exploration explored 100000 steps with 50000 reset in 9213 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2 p3)
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-11 finished in 27528 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))&&(X(p0)||G(p1))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5558 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-11 04:55:49] [INFO ] Invariant cache hit.
[2023-03-11 04:55:51] [INFO ] Implicit Places using invariants in 1275 ms returned []
Implicit Place search using SMT only with invariants took 1291 ms to find 0 implicit places.
[2023-03-11 04:55:51] [INFO ] Invariant cache hit.
[2023-03-11 04:55:52] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8197 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s152 1) (LT s791 1)), p0:(AND (GEQ s712 1) (GEQ s833 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2309 steps with 0 reset in 59 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-12 finished in 8566 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(F(p0))||X(!(p0 U p1)))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5327 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-11 04:55:58] [INFO ] Invariant cache hit.
[2023-03-11 04:55:59] [INFO ] Implicit Places using invariants in 1424 ms returned []
Implicit Place search using SMT only with invariants took 1445 ms to find 0 implicit places.
[2023-03-11 04:55:59] [INFO ] Invariant cache hit.
[2023-03-11 04:56:01] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8094 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2949 1), p1:(OR (GEQ s15114 1) (GEQ s2949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 9491 ms.
Product exploration explored 100000 steps with 50000 reset in 9979 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-14 finished in 27994 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 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 22 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Applied a total of 17278 rules in 13539 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
[2023-03-11 04:56:34] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
// Phase 1: matrix 32670 rows 8644 cols
[2023-03-11 04:56:41] [INFO ] Computed 92 place invariants in 6545 ms
[2023-03-11 04:56:41] [INFO ] Implicit Places using invariants in 7475 ms returned []
Implicit Place search using SMT only with invariants took 7480 ms to find 0 implicit places.
[2023-03-11 04:56:41] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
[2023-03-11 04:56:41] [INFO ] Invariant cache hit.
[2023-03-11 04:56:42] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/17283 places, 40501/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21818 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-15 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:(GEQ s5184 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 441 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-15 finished in 22023 ms.
All properties solved by simple procedures.
Total runtime 619542 ms.
ITS solved all properties within timeout

BK_STOP 1678510603172

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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