Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 7.2K Feb 26 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 14K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:46 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 30M 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-070-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678664531864

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:42:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 23:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:42:14] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2023-03-12 23:42:14] [INFO ] Transformed 10644 places.
[2023-03-12 23:42:14] [INFO ] Transformed 29820 transitions.
[2023-03-12 23:42:14] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 863 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 3024 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:42:23] [INFO ] Computed 72 place invariants in 5447 ms
[2023-03-12 23:42:24] [INFO ] Implicit Places using invariants in 6583 ms returned []
Implicit Place search using SMT only with invariants took 6608 ms to find 0 implicit places.
[2023-03-12 23:42:24] [INFO ] Invariant cache hit.
[2023-03-12 23:42:25] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10816 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 51 out of 10643 places after structural reductions.
[2023-03-12 23:42:26] [INFO ] Flatten gal took : 928 ms
[2023-03-12 23:42:27] [INFO ] Flatten gal took : 669 ms
[2023-03-12 23:42:28] [INFO ] Input system was already deterministic with 29820 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 33) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 23:42:29] [INFO ] Invariant cache hit.
[2023-03-12 23:42:34] [INFO ] [Real]Absence check using 70 positive place invariants in 167 ms returned sat
[2023-03-12 23:42:34] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 239 ms returned sat
[2023-03-12 23:42:54] [INFO ] After 20115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-12 23:42:55] [INFO ] State equation strengthened by 9730 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:42:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:42:55] [INFO ] After 25217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 481 place count 10643 transition count 29339
Reduce places removed 481 places and 0 transitions.
Iterating post reduction 1 with 481 rules applied. Total rules applied 962 place count 10162 transition count 29339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 962 place count 10162 transition count 29338
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 964 place count 10161 transition count 29338
Performed 4815 Post agglomeration using F-continuation condition.Transition count delta: 4815
Deduced a syphon composed of 4815 places in 39 ms
Reduce places removed 4815 places and 0 transitions.
Iterating global reduction 2 with 9630 rules applied. Total rules applied 10594 place count 5346 transition count 24523
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 10603 place count 5346 transition count 24514
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 10612 place count 5337 transition count 24514
Partial Free-agglomeration rule applied 4963 times.
Drop transitions removed 4963 transitions
Iterating global reduction 3 with 4963 rules applied. Total rules applied 15575 place count 5337 transition count 24514
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 15645 place count 5337 transition count 24514
Applied a total of 15645 rules in 10183 ms. Remains 5337 /10643 variables (removed 5306) and now considering 24514/29820 (removed 5306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10186 ms. Remains : 5337/10643 places, 24514/29820 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-12 23:43:05] [INFO ] Flow matrix only has 24506 transitions (discarded 8 similar events)
// Phase 1: matrix 24506 rows 5337 cols
[2023-03-12 23:43:07] [INFO ] Computed 72 place invariants in 1254 ms
[2023-03-12 23:43:09] [INFO ] [Real]Absence check using 70 positive place invariants in 72 ms returned sat
[2023-03-12 23:43:09] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 85 ms returned sat
[2023-03-12 23:43:20] [INFO ] After 10678ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-12 23:43:20] [INFO ] State equation strengthened by 24245 read => feed constraints.
[2023-03-12 23:43:26] [INFO ] After 6080ms SMT Verify possible using 24245 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 23:43:26] [INFO ] After 19299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 23:43:28] [INFO ] [Nat]Absence check using 70 positive place invariants in 68 ms returned sat
[2023-03-12 23:43:28] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 94 ms returned sat
[2023-03-12 23:43:50] [INFO ] After 20175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-12 23:43:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:43:51] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 24 out of 5337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5337/5337 places, 24514/24514 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 5334 transition count 24511
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 5334 transition count 24511
Applied a total of 8 rules in 3870 ms. Remains 5334 /5337 variables (removed 3) and now considering 24511/24514 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3871 ms. Remains : 5334/5337 places, 24511/24514 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 17) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 23:43:56] [INFO ] Flow matrix only has 24504 transitions (discarded 7 similar events)
// Phase 1: matrix 24504 rows 5334 cols
[2023-03-12 23:43:57] [INFO ] Computed 72 place invariants in 1403 ms
[2023-03-12 23:43:59] [INFO ] [Real]Absence check using 70 positive place invariants in 87 ms returned sat
[2023-03-12 23:43:59] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 91 ms returned sat
[2023-03-12 23:44:16] [INFO ] After 16364ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-12 23:44:16] [INFO ] State equation strengthened by 24252 read => feed constraints.
[2023-03-12 23:44:23] [INFO ] After 6360ms SMT Verify possible using 24252 Read/Feed constraints in real domain returned unsat :0 sat :7
[2023-03-12 23:44:23] [INFO ] After 6361ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 23:44:23] [INFO ] After 25313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 9 out of 5334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5334/5334 places, 24511/24511 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 5329 transition count 24506
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 5329 transition count 24506
Applied a total of 16 rules in 4053 ms. Remains 5329 /5334 variables (removed 5) and now considering 24506/24511 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4053 ms. Remains : 5329/5334 places, 24506/24511 transitions.
Computed a total of 282 stabilizing places and 490 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' '!(((p0 U G(p1))||X(G((p2 U p3)))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2004 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:44:34] [INFO ] Computed 72 place invariants in 4725 ms
[2023-03-12 23:44:35] [INFO ] Implicit Places using invariants in 5838 ms returned []
Implicit Place search using SMT only with invariants took 5838 ms to find 0 implicit places.
[2023-03-12 23:44:35] [INFO ] Invariant cache hit.
[2023-03-12 23:44:36] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8867 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 675 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0} source=8 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(GEQ s7840 1), p0:(LT s3934 1), p3:(GEQ s6689 1), p2:(OR (GEQ s3934 1) (GEQ s6689 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1635 steps with 0 reset in 60 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-00 finished in 9735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((F(p1) U p2)&&F(p0)))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2014 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:44:39] [INFO ] Invariant cache hit.
[2023-03-12 23:44:40] [INFO ] Implicit Places using invariants in 1329 ms returned []
Implicit Place search using SMT only with invariants took 1333 ms to find 0 implicit places.
[2023-03-12 23:44:40] [INFO ] Invariant cache hit.
[2023-03-12 23:44:41] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4315 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p0) p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s1178 1), p1:(GEQ s1718 1), p0:(AND (GEQ s138 1) (GEQ s455 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1478 steps with 0 reset in 50 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-01 finished in 4912 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((p1||F(p2)))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2080 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:44:44] [INFO ] Invariant cache hit.
[2023-03-12 23:44:45] [INFO ] Implicit Places using invariants in 1068 ms returned []
Implicit Place search using SMT only with invariants took 1069 ms to find 0 implicit places.
[2023-03-12 23:44:45] [INFO ] Invariant cache hit.
[2023-03-12 23:44:46] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4379 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s8790 1), p1:(LT s5734 1), p2:(LT s2050 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-02 finished in 4757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(G(p1)) U p2)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 9 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 5316 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2023-03-12 23:44:52] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
// Phase 1: matrix 19812 rows 5326 cols
[2023-03-12 23:44:54] [INFO ] Computed 72 place invariants in 1821 ms
[2023-03-12 23:44:55] [INFO ] Implicit Places using invariants in 3185 ms returned []
Implicit Place search using SMT only with invariants took 3186 ms to find 0 implicit places.
[2023-03-12 23:44:55] [INFO ] Flow matrix only has 19812 transitions (discarded 4691 similar events)
[2023-03-12 23:44:55] [INFO ] Invariant cache hit.
[2023-03-12 23:45:07] [INFO ] Dead Transitions using invariants and state equation in 11537 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20042 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s1616 1)), p2:(GEQ s1596 1), p1:(AND (GEQ s264 1) (GEQ s3268 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 352 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-04 finished in 20285 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 1 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2010 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:45:14] [INFO ] Computed 72 place invariants in 4732 ms
[2023-03-12 23:45:15] [INFO ] Implicit Places using invariants in 5883 ms returned []
Implicit Place search using SMT only with invariants took 5884 ms to find 0 implicit places.
[2023-03-12 23:45:15] [INFO ] Invariant cache hit.
[2023-03-12 23:45:16] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8984 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s620 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 49648 reset in 6320 ms.
Product exploration explored 100000 steps with 49651 reset in 6451 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Detected a total of 282/10643 stabilizing places and 490/29820 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-070-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-06 finished in 22154 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(G(p0))||G((p1&&X(p1))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2069 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:45:31] [INFO ] Invariant cache hit.
[2023-03-12 23:45:32] [INFO ] Implicit Places using invariants in 989 ms returned []
Implicit Place search using SMT only with invariants took 991 ms to find 0 implicit places.
[2023-03-12 23:45:32] [INFO ] Invariant cache hit.
[2023-03-12 23:45:33] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4155 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(GEQ s8699 1), p0:(AND (GEQ s833 1) (GEQ s3721 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1796 steps with 0 reset in 35 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-07 finished in 4365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||X(F(p1)))))))))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2066 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:45:35] [INFO ] Invariant cache hit.
[2023-03-12 23:45:36] [INFO ] Implicit Places using invariants in 1130 ms returned []
Implicit Place search using SMT only with invariants took 1130 ms to find 0 implicit places.
[2023-03-12 23:45:36] [INFO ] Invariant cache hit.
[2023-03-12 23:45:38] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4267 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s446 1) (GEQ s455 1)), p1:(OR (LT s791 1) (LT s810 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14285 reset in 3527 ms.
Product exploration explored 100000 steps with 14318 reset in 3633 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:45:46] [INFO ] Invariant cache hit.
[2023-03-12 23:45:47] [INFO ] [Real]Absence check using 70 positive place invariants in 95 ms returned sat
[2023-03-12 23:45:47] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 183 ms returned sat
[2023-03-12 23:46:11] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 10 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10638 place count 5325 transition count 24500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10640 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 3 with 4972 rules applied. Total rules applied 15612 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 15682 place count 5323 transition count 24500
Applied a total of 15682 rules in 9455 ms. Remains 5323 /10643 variables (removed 5320) and now considering 24500/29820 (removed 5320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9455 ms. Remains : 5323/10643 places, 24500/29820 transitions.
Finished random walk after 5063 steps, including 12 resets, run visited all 1 properties in 172 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 1996 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:46:23] [INFO ] Invariant cache hit.
[2023-03-12 23:46:24] [INFO ] Implicit Places using invariants in 1094 ms returned []
Implicit Place search using SMT only with invariants took 1096 ms to find 0 implicit places.
[2023-03-12 23:46:24] [INFO ] Invariant cache hit.
[2023-03-12 23:46:25] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4207 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 5687 steps, including 3 resets, run visited all 2 properties in 139 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 14271 reset in 3574 ms.
Product exploration explored 100000 steps with 14301 reset in 3505 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 10643 transition count 29820
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 346 place count 10643 transition count 29820
Deduced a syphon composed of 420 places in 7 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 420 place count 10643 transition count 29820
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 560 place count 10503 transition count 29680
Deduced a syphon composed of 280 places in 8 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 700 place count 10503 transition count 29680
Performed 4896 Post agglomeration using F-continuation condition.Transition count delta: -9520
Deduced a syphon composed of 5176 places in 14 ms
Iterating global reduction 1 with 4896 rules applied. Total rules applied 5596 place count 10503 transition count 39200
Discarding 272 places :
Symmetric choice reduction at 1 with 272 rule applications. Total rules 5868 place count 10231 transition count 38928
Deduced a syphon composed of 4904 places in 17 ms
Iterating global reduction 1 with 272 rules applied. Total rules applied 6140 place count 10231 transition count 38928
Deduced a syphon composed of 4904 places in 7 ms
Applied a total of 6140 rules in 12642 ms. Remains 10231 /10643 variables (removed 412) and now considering 38928/29820 (removed -9108) transitions.
[2023-03-12 23:46:48] [INFO ] Flow matrix only has 34236 transitions (discarded 4692 similar events)
// Phase 1: matrix 34236 rows 10231 cols
[2023-03-12 23:46:53] [INFO ] Computed 72 place invariants in 5758 ms
[2023-03-12 23:46:54] [INFO ] Dead Transitions using invariants and state equation in 6748 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10231/10643 places, 38928/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19393 ms. Remains : 10231/10643 places, 38928/29820 transitions.
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3004 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:47:02] [INFO ] Computed 72 place invariants in 4905 ms
[2023-03-12 23:47:03] [INFO ] Implicit Places using invariants in 6072 ms returned []
Implicit Place search using SMT only with invariants took 6076 ms to find 0 implicit places.
[2023-03-12 23:47:03] [INFO ] Invariant cache hit.
[2023-03-12 23:47:05] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10268 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-08 finished in 92506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 10643 transition count 29331
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4830 Post agglomeration using F-continuation condition.Transition count delta: 4830
Deduced a syphon composed of 4830 places in 9 ms
Reduce places removed 4830 places and 0 transitions.
Iterating global reduction 2 with 9660 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 7028 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2023-03-12 23:47:13] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
// Phase 1: matrix 19809 rows 5324 cols
[2023-03-12 23:47:15] [INFO ] Computed 72 place invariants in 1934 ms
[2023-03-12 23:47:19] [INFO ] Implicit Places using invariants in 6264 ms returned []
Implicit Place search using SMT only with invariants took 6267 ms to find 0 implicit places.
[2023-03-12 23:47:19] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:47:19] [INFO ] Invariant cache hit.
[2023-03-12 23:47:30] [INFO ] Dead Transitions using invariants and state equation in 11004 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24304 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s101 1) (LT s4010 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 282 reset in 2382 ms.
Product exploration explored 100000 steps with 283 reset in 2314 ms.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 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 53 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 56042 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56042 steps, saw 39247 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:47:38] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:47:38] [INFO ] Invariant cache hit.
[2023-03-12 23:47:39] [INFO ] [Real]Absence check using 70 positive place invariants in 88 ms returned sat
[2023-03-12 23:47:39] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 96 ms returned sat
[2023-03-12 23:47:46] [INFO ] After 7103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:47:47] [INFO ] State equation strengthened by 14628 read => feed constraints.
[2023-03-12 23:47:48] [INFO ] After 1668ms SMT Verify possible using 14628 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:47:48] [INFO ] After 9784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:47:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 47 ms returned sat
[2023-03-12 23:47:49] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-12 23:47:56] [INFO ] After 7193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:47:58] [INFO ] After 1592ms SMT Verify possible using 14628 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:47:59] [INFO ] After 2468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 640 ms.
[2023-03-12 23:47:59] [INFO ] After 11083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5324 transition count 24499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5322 transition count 24499
Applied a total of 4974 rules in 5887 ms. Remains 5322 /5324 variables (removed 2) and now considering 24499/24501 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5887 ms. Remains : 5322/5324 places, 24499/24501 transitions.
Finished random walk after 4789 steps, including 11 resets, run visited all 1 properties in 125 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 167 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1886 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2023-03-12 23:48:08] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:48:08] [INFO ] Invariant cache hit.
[2023-03-12 23:48:09] [INFO ] Implicit Places using invariants in 1264 ms returned []
Implicit Place search using SMT only with invariants took 1264 ms to find 0 implicit places.
[2023-03-12 23:48:09] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:48:09] [INFO ] Invariant cache hit.
[2023-03-12 23:48:22] [INFO ] Dead Transitions using invariants and state equation in 12789 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15941 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 214 stabilizing places and 351 stable transitions
Computed a total of 214 stabilizing places and 351 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 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 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 28 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 55837 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55837 steps, saw 39220 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:48:25] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:48:25] [INFO ] Invariant cache hit.
[2023-03-12 23:48:26] [INFO ] [Real]Absence check using 70 positive place invariants in 60 ms returned sat
[2023-03-12 23:48:26] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 82 ms returned sat
[2023-03-12 23:48:34] [INFO ] After 7898ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:48:34] [INFO ] State equation strengthened by 14628 read => feed constraints.
[2023-03-12 23:48:36] [INFO ] After 1700ms SMT Verify possible using 14628 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:48:36] [INFO ] After 10575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:48:37] [INFO ] [Nat]Absence check using 70 positive place invariants in 92 ms returned sat
[2023-03-12 23:48:37] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 95 ms returned sat
[2023-03-12 23:48:45] [INFO ] After 8287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:48:47] [INFO ] After 1841ms SMT Verify possible using 14628 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:48:48] [INFO ] After 2764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 780 ms.
[2023-03-12 23:48:49] [INFO ] After 12789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5324 transition count 24499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 4970 times.
Drop transitions removed 4970 transitions
Iterating global reduction 1 with 4970 rules applied. Total rules applied 4974 place count 5322 transition count 24499
Applied a total of 4974 rules in 6117 ms. Remains 5322 /5324 variables (removed 2) and now considering 24499/24501 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6117 ms. Remains : 5322/5324 places, 24499/24501 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Finished Best-First random walk after 1862 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=310 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 282 reset in 2988 ms.
Product exploration explored 100000 steps with 284 reset in 2873 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1935 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2023-03-12 23:49:03] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:49:03] [INFO ] Invariant cache hit.
[2023-03-12 23:49:05] [INFO ] Implicit Places using invariants in 1299 ms returned []
Implicit Place search using SMT only with invariants took 1300 ms to find 0 implicit places.
[2023-03-12 23:49:05] [INFO ] Flow matrix only has 19809 transitions (discarded 4692 similar events)
[2023-03-12 23:49:05] [INFO ] Invariant cache hit.
[2023-03-12 23:49:17] [INFO ] Dead Transitions using invariants and state equation in 11957 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15195 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-09 finished in 131371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2836 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:49:25] [INFO ] Computed 72 place invariants in 4756 ms
[2023-03-12 23:49:26] [INFO ] Implicit Places using invariants in 6032 ms returned []
Implicit Place search using SMT only with invariants took 6039 ms to find 0 implicit places.
[2023-03-12 23:49:26] [INFO ] Invariant cache hit.
[2023-03-12 23:49:27] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9899 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s553 1) (LT s726 1)), p0:(AND (GEQ s21 1) (GEQ s8713 1) (GEQ s6810 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5401 steps with 3 reset in 136 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-11 finished in 10310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2771 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:49:30] [INFO ] Invariant cache hit.
[2023-03-12 23:49:31] [INFO ] Implicit Places using invariants in 1229 ms returned []
Implicit Place search using SMT only with invariants took 1230 ms to find 0 implicit places.
[2023-03-12 23:49:31] [INFO ] Invariant cache hit.
[2023-03-12 23:49:33] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5176 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s3498 1), p1:(AND (GEQ s651 1) (GEQ s754 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-12 finished in 5418 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)||(!p0 U (G(!p0)||(G(!p2)&&X(p3)&&p1)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3111 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:49:36] [INFO ] Invariant cache hit.
[2023-03-12 23:49:37] [INFO ] Implicit Places using invariants in 1141 ms returned []
Implicit Place search using SMT only with invariants took 1142 ms to find 0 implicit places.
[2023-03-12 23:49:37] [INFO ] Invariant cache hit.
[2023-03-12 23:49:38] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5372 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 561 ms :[true, false, p2, (OR (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND p0 p2), (AND p2 (NOT p0)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 8}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=1 dest: 9}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(OR p2 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)), acceptance={} source=4 dest: 8}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=5 dest: 7}, { cond=(OR (AND p0 p2) (AND p0 (NOT p3))), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 9}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=8 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=1, aps=[p0:(GEQ s4404 1), p1:(AND (NOT (OR (AND (GEQ s488 1) (GEQ s973 1)) (GEQ s6388 1))) (LT s4404 1)), p2:(AND (GEQ s488 1) (GEQ s973 1)), p3:(LT s4238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 57 reset in 2299 ms.
Product exploration explored 100000 steps with 57 reset in 2178 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p2) p3))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2))))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p2 (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 1399 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, (OR (NOT p3) p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 819 ms. (steps per millisecond=12 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 81282 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{0=1, 1=1, 2=1, 5=1, 6=1, 9=1, 10=1, 14=1, 15=1}
Probabilistic random walk after 81282 steps, saw 79516 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :9
Running SMT prover for 8 properties.
[2023-03-12 23:49:49] [INFO ] Invariant cache hit.
[2023-03-12 23:49:51] [INFO ] [Real]Absence check using 70 positive place invariants in 150 ms returned sat
[2023-03-12 23:49:51] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-12 23:50:13] [INFO ] After 21653ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:5
[2023-03-12 23:50:13] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2023-03-12 23:50:14] [INFO ] After 754ms SMT Verify possible using 9730 Read/Feed constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-12 23:50:14] [INFO ] After 755ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-12 23:50:14] [INFO ] After 25074ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-12 23:50:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 129 ms returned sat
[2023-03-12 23:50:16] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-12 23:50:39] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4826 Post agglomeration using F-continuation condition.Transition count delta: 4826
Deduced a syphon composed of 4826 places in 14 ms
Reduce places removed 4826 places and 0 transitions.
Iterating global reduction 2 with 9652 rules applied. Total rules applied 10630 place count 5328 transition count 24505
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10632 place count 5328 transition count 24503
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 3 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 13015 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13016 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 62290 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62290 steps, saw 51754 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 24503 rows 5326 cols
[2023-03-12 23:50:57] [INFO ] Computed 72 place invariants in 1377 ms
[2023-03-12 23:50:58] [INFO ] [Real]Absence check using 70 positive place invariants in 89 ms returned sat
[2023-03-12 23:50:59] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 91 ms returned sat
[2023-03-12 23:51:07] [INFO ] After 8504ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-12 23:51:07] [INFO ] State equation strengthened by 24284 read => feed constraints.
[2023-03-12 23:51:12] [INFO ] After 4222ms SMT Verify possible using 24284 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:51:12] [INFO ] After 14614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:51:13] [INFO ] [Nat]Absence check using 70 positive place invariants in 64 ms returned sat
[2023-03-12 23:51:13] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 76 ms returned sat
[2023-03-12 23:51:24] [INFO ] After 11297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:51:31] [INFO ] After 6823ms SMT Verify possible using 24284 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:51:37] [INFO ] After 12230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 23:51:37] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 2225 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2225 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 2105 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2023-03-12 23:51:41] [INFO ] Invariant cache hit.
[2023-03-12 23:51:45] [INFO ] Implicit Places using invariants in 4273 ms returned []
Implicit Place search using SMT only with invariants took 4275 ms to find 0 implicit places.
[2023-03-12 23:51:45] [INFO ] Invariant cache hit.
[2023-03-12 23:51:58] [INFO ] Dead Transitions using invariants and state equation in 12294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18681 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p2) p3))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2))))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p2 (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND (NOT p3) p1 p0 (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (F (NOT (AND p3 (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND p3 (NOT p2)))), (F (OR (NOT p3) p2)), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))]
Knowledge based reduction with 35 factoid took 1953 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, p2, (AND p0 p2)]
Stuttering acceptance computed with spot in 266 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), p0, p2, (AND p0 p2)]
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3312 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:52:08] [INFO ] Computed 72 place invariants in 4498 ms
[2023-03-12 23:52:09] [INFO ] Implicit Places using invariants in 5676 ms returned []
Implicit Place search using SMT only with invariants took 5685 ms to find 0 implicit places.
[2023-03-12 23:52:09] [INFO ] Invariant cache hit.
[2023-03-12 23:52:10] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10183 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 709 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, p0, (AND p0 p2), (OR (AND p0 (NOT p3)) (AND p0 p2))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:52:12] [INFO ] Invariant cache hit.
[2023-03-12 23:52:15] [INFO ] [Real]Absence check using 70 positive place invariants in 153 ms returned sat
[2023-03-12 23:52:15] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 221 ms returned sat
[2023-03-12 23:52:37] [INFO ] After 22034ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-12 23:52:38] [INFO ] State equation strengthened by 9730 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:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:52:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:52:38] [INFO ] After 25219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 59 ms.
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 10155 transition count 29331
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4826 Post agglomeration using F-continuation condition.Transition count delta: 4826
Deduced a syphon composed of 4826 places in 24 ms
Reduce places removed 4826 places and 0 transitions.
Iterating global reduction 2 with 9652 rules applied. Total rules applied 10630 place count 5328 transition count 24505
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10632 place count 5328 transition count 24503
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 3 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 13378 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13379 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 64385 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64385 steps, saw 52012 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 24503 rows 5326 cols
[2023-03-12 23:52:56] [INFO ] Computed 72 place invariants in 1407 ms
[2023-03-12 23:52:57] [INFO ] [Real]Absence check using 70 positive place invariants in 92 ms returned sat
[2023-03-12 23:52:57] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 95 ms returned sat
[2023-03-12 23:53:06] [INFO ] After 8447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 23:53:06] [INFO ] State equation strengthened by 24284 read => feed constraints.
[2023-03-12 23:53:10] [INFO ] After 4389ms SMT Verify possible using 24284 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:53:10] [INFO ] After 14351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:53:11] [INFO ] [Nat]Absence check using 70 positive place invariants in 92 ms returned sat
[2023-03-12 23:53:11] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 94 ms returned sat
[2023-03-12 23:53:23] [INFO ] After 11459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:53:28] [INFO ] After 4850ms SMT Verify possible using 24284 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:53:31] [INFO ] After 8369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2433 ms.
[2023-03-12 23:53:34] [INFO ] After 23659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 2134 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2134 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 2164 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2023-03-12 23:53:38] [INFO ] Invariant cache hit.
[2023-03-12 23:53:42] [INFO ] Implicit Places using invariants in 4210 ms returned []
Implicit Place search using SMT only with invariants took 4219 ms to find 0 implicit places.
[2023-03-12 23:53:42] [INFO ] Invariant cache hit.
[2023-03-12 23:53:56] [INFO ] Dead Transitions using invariants and state equation in 13523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19913 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3))))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F p2), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (F p0), (F (NOT (AND p3 (NOT p0) (NOT p2)))), (F (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p3 p0 (NOT p2)))]
Knowledge based reduction with 20 factoid took 811 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, p0, (AND p0 p2), (OR (AND p0 (NOT p3)) (AND p0 p2))]
Stuttering acceptance computed with spot in 174 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, p0, (AND p0 p2), (OR (AND p0 (NOT p3)) (AND p0 p2))]
Stuttering acceptance computed with spot in 186 ms :[true, (OR (AND p0 (NOT p3)) (AND p0 p2)), p2, p0, (AND p0 p2), (OR (AND p0 (NOT p3)) (AND p0 p2))]
Product exploration explored 100000 steps with 58 reset in 2531 ms.
Entered a terminal (fully accepting) state of product in 50175 steps with 29 reset in 1395 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-13 finished in 268414 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(G(p1))||p0)))'
Support contains 6 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3086 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:54:09] [INFO ] Computed 72 place invariants in 4968 ms
[2023-03-12 23:54:11] [INFO ] Implicit Places using invariants in 6216 ms returned []
Implicit Place search using SMT only with invariants took 6220 ms to find 0 implicit places.
[2023-03-12 23:54:11] [INFO ] Invariant cache hit.
[2023-03-12 23:54:12] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10333 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-14 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:(OR (GEQ s10226 1) (GEQ s9830 1) (AND (GEQ s357 1) (GEQ s6553 1))), p1:(AND (GEQ s427 1) (GEQ s544 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]]
Stuttering criterion allowed to conclude after 1669 steps with 0 reset in 57 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-14 finished in 10657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(!p0) U p1)) U (X(p2)||p3)))'
Support contains 8 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 3259 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:54:15] [INFO ] Invariant cache hit.
[2023-03-12 23:54:16] [INFO ] Implicit Places using invariants in 1059 ms returned []
Implicit Place search using SMT only with invariants took 1061 ms to find 0 implicit places.
[2023-03-12 23:54:16] [INFO ] Invariant cache hit.
[2023-03-12 23:54:18] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5575 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s4017 1)), p2:(AND (GEQ s315 1) (GEQ s502 1)), p1:(AND (GEQ s189 1) (GEQ s4597 1)), p0:(AND (GEQ s861 1) (GEQ s2483 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 745 steps with 0 reset in 26 ms.
FORMULA CANInsertWithFailure-PT-070-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-15 finished in 5952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||X(F(p1)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-070-LTLFireability-08
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 486 place count 10643 transition count 29334
Reduce places removed 486 places and 0 transitions.
Iterating post reduction 1 with 486 rules applied. Total rules applied 972 place count 10157 transition count 29334
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 972 place count 10157 transition count 29332
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 976 place count 10155 transition count 29332
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 15 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 2 with 9656 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Applied a total of 10632 rules in 7276 ms. Remains 5327 /10643 variables (removed 5316) and now considering 24504/29820 (removed 5316) transitions.
[2023-03-12 23:54:26] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
// Phase 1: matrix 19812 rows 5327 cols
[2023-03-12 23:54:28] [INFO ] Computed 72 place invariants in 2038 ms
[2023-03-12 23:54:29] [INFO ] Implicit Places using invariants in 3257 ms returned []
Implicit Place search using SMT only with invariants took 3258 ms to find 0 implicit places.
[2023-03-12 23:54:29] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2023-03-12 23:54:29] [INFO ] Invariant cache hit.
[2023-03-12 23:54:41] [INFO ] Dead Transitions using invariants and state equation in 12596 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5327/10643 places, 24504/29820 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 23137 ms. Remains : 5327/10643 places, 24504/29820 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s192 1) (GEQ s198 1)), p1:(OR (LT s343 1) (LT s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14324 reset in 2925 ms.
Product exploration explored 100000 steps with 14273 reset in 2886 ms.
Computed a total of 210 stabilizing places and 350 stable transitions
Computed a total of 210 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 666 steps, including 1 resets, run visited all 2 properties in 20 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 5327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5327/5327 places, 24504/24504 transitions.
Applied a total of 0 rules in 1822 ms. Remains 5327 /5327 variables (removed 0) and now considering 24504/24504 (removed 0) transitions.
[2023-03-12 23:54:50] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2023-03-12 23:54:50] [INFO ] Invariant cache hit.
[2023-03-12 23:54:52] [INFO ] Implicit Places using invariants in 1234 ms returned []
Implicit Place search using SMT only with invariants took 1234 ms to find 0 implicit places.
[2023-03-12 23:54:52] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2023-03-12 23:54:52] [INFO ] Invariant cache hit.
[2023-03-12 23:55:04] [INFO ] Dead Transitions using invariants and state equation in 12480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15541 ms. Remains : 5327/5327 places, 24504/24504 transitions.
Computed a total of 210 stabilizing places and 350 stable transitions
Computed a total of 210 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1400 steps, including 3 resets, run visited all 2 properties in 51 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 14321 reset in 3020 ms.
Product exploration explored 100000 steps with 14243 reset in 2826 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 5327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5327/5327 places, 24504/24504 transitions.
Applied a total of 0 rules in 2074 ms. Remains 5327 /5327 variables (removed 0) and now considering 24504/24504 (removed 0) transitions.
[2023-03-12 23:55:14] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2023-03-12 23:55:14] [INFO ] Invariant cache hit.
[2023-03-12 23:55:26] [INFO ] Dead Transitions using invariants and state equation in 12173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14250 ms. Remains : 5327/5327 places, 24504/24504 transitions.
Support contains 4 out of 5327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5327/5327 places, 24504/24504 transitions.
Applied a total of 0 rules in 1919 ms. Remains 5327 /5327 variables (removed 0) and now considering 24504/24504 (removed 0) transitions.
[2023-03-12 23:55:28] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2023-03-12 23:55:28] [INFO ] Invariant cache hit.
[2023-03-12 23:55:29] [INFO ] Implicit Places using invariants in 1328 ms returned []
Implicit Place search using SMT only with invariants took 1329 ms to find 0 implicit places.
[2023-03-12 23:55:29] [INFO ] Flow matrix only has 19812 transitions (discarded 4692 similar events)
[2023-03-12 23:55:29] [INFO ] Invariant cache hit.
[2023-03-12 23:55:41] [INFO ] Dead Transitions using invariants and state equation in 11621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14873 ms. Remains : 5327/5327 places, 24504/24504 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLFireability-08 finished in 83606 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)))'
[2023-03-12 23:55:42] [INFO ] Flatten gal took : 716 ms
[2023-03-12 23:55:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 23:55:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10643 places, 29820 transitions and 79660 arcs took 112 ms.
Total runtime 809654 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2150/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2150/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-070-LTLFireability-08
Could not compute solution for formula : CANInsertWithFailure-PT-070-LTLFireability-09

BK_STOP 1678665399720

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-070-LTLFireability-08
ltl formula formula --ltl=/tmp/2150/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10643 places, 29820 transitions and 79660 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.690 real 1.170 user 1.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2150/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2150/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2150/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2150/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-070-LTLFireability-09
ltl formula formula --ltl=/tmp/2150/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10643 places, 29820 transitions and 79660 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.570 real 1.100 user 1.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2150/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2150/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2150/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2150/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-070, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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