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-167813695100771.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-090, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100771
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-090-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678666268991

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:11:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:11:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:11:15] [INFO ] Load time of PNML (sax parser for PT used): 1776 ms
[2023-03-13 00:11:15] [INFO ] Transformed 17284 places.
[2023-03-13 00:11:15] [INFO ] Transformed 49140 transitions.
[2023-03-13 00:11:15] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 2389 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 17284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17283 transition count 49140
Applied a total of 1 rules in 9208 ms. Remains 17283 /17284 variables (removed 1) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:11:42] [INFO ] Computed 92 place invariants in 16378 ms
[2023-03-13 00:11:45] [INFO ] Implicit Places using invariants in 19842 ms returned []
Implicit Place search using SMT only with invariants took 19919 ms to find 0 implicit places.
[2023-03-13 00:11:45] [INFO ] Invariant cache hit.
[2023-03-13 00:11:48] [INFO ] Dead Transitions using invariants and state equation in 2508 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17283/17284 places, 49140/49140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31672 ms. Remains : 17283/17284 places, 49140/49140 transitions.
Support contains 44 out of 17283 places after structural reductions.
[2023-03-13 00:11:51] [INFO ] Flatten gal took : 2307 ms
[2023-03-13 00:11:52] [INFO ] Flatten gal took : 1484 ms
[2023-03-13 00:11:56] [INFO ] Input system was already deterministic with 49140 transitions.
Support contains 42 out of 17283 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1389 ms. (steps per millisecond=7 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 44745 steps, run timeout after 3004 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44745 steps, saw 44122 distinct states, run finished after 3019 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 23 properties.
[2023-03-13 00:12:01] [INFO ] Invariant cache hit.
[2023-03-13 00:12:10] [INFO ] After 8957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-13 00:12:20] [INFO ] [Nat]Absence check using 90 positive place invariants in 382 ms returned sat
[2023-03-13 00:12:21] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 523 ms returned sat
[2023-03-13 00:12:35] [INFO ] After 7791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-13 00:12:35] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:12:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:12:35] [INFO ] After 25479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 17283 transition count 48513
Reduce places removed 627 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 628 rules applied. Total rules applied 1255 place count 16656 transition count 48512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 7816 Post agglomeration using F-continuation condition.Transition count delta: 7816
Deduced a syphon composed of 7816 places in 78 ms
Reduce places removed 7816 places and 0 transitions.
Iterating global reduction 3 with 15632 rules applied. Total rules applied 16888 place count 8839 transition count 40696
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 16891 place count 8839 transition count 40693
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 16894 place count 8836 transition count 40693
Partial Free-agglomeration rule applied 8346 times.
Drop transitions removed 8346 transitions
Iterating global reduction 4 with 8346 rules applied. Total rules applied 25240 place count 8836 transition count 40693
Applied a total of 25240 rules in 27452 ms. Remains 8836 /17283 variables (removed 8447) and now considering 40693/49140 (removed 8447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27454 ms. Remains : 8836/17283 places, 40693/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-13 00:13:04] [INFO ] Flow matrix only has 40676 transitions (discarded 17 similar events)
// Phase 1: matrix 40676 rows 8836 cols
[2023-03-13 00:13:07] [INFO ] Computed 92 place invariants in 3352 ms
[2023-03-13 00:13:11] [INFO ] After 3742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-13 00:13:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 138 ms returned sat
[2023-03-13 00:13:15] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 187 ms returned sat
[2023-03-13 00:13:36] [INFO ] After 17179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-13 00:13:36] [INFO ] State equation strengthened by 39893 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:13:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:13:36] [INFO ] After 25555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 8836 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8836/8836 places, 40693/40693 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8836 transition count 40692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8835 transition count 40692
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 8830 transition count 40687
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 8830 transition count 40687
Applied a total of 15 rules in 11407 ms. Remains 8830 /8836 variables (removed 6) and now considering 40687/40693 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11408 ms. Remains : 8830/8836 places, 40687/40693 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p0)))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6101 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:14:09] [INFO ] Computed 92 place invariants in 14311 ms
[2023-03-13 00:14:11] [INFO ] Implicit Places using invariants in 16782 ms returned []
Implicit Place search using SMT only with invariants took 16784 ms to find 0 implicit places.
[2023-03-13 00:14:11] [INFO ] Invariant cache hit.
[2023-03-13 00:14:13] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24526 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5446 s11984)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 97620 steps with 48810 reset in 10001 ms.
Product exploration timeout after 96780 steps with 48390 reset in 10001 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-01 finished in 45304 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)||G(p1))))'
Support contains 6 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 23 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Applied a total of 17276 rules in 15251 ms. Remains 8645 /17283 variables (removed 8638) and now considering 40502/49140 (removed 8638) transitions.
[2023-03-13 00:14:49] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
// Phase 1: matrix 32672 rows 8645 cols
[2023-03-13 00:14:55] [INFO ] Computed 92 place invariants in 6443 ms
[2023-03-13 00:14:56] [INFO ] Implicit Places using invariants in 7600 ms returned []
Implicit Place search using SMT only with invariants took 7603 ms to find 0 implicit places.
[2023-03-13 00:14:56] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
[2023-03-13 00:14:56] [INFO ] Invariant cache hit.
[2023-03-13 00:15:20] [INFO ] Dead Transitions using invariants and state equation in 24188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/17283 places, 40502/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47050 ms. Remains : 8645/17283 places, 40502/49140 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s8536 s3424) (GT s7627 s1489)), p1:(GT s3879 s5907)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 427 steps with 0 reset in 23 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-02 finished in 47218 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 U X(p0))))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5707 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:15:41] [INFO ] Computed 92 place invariants in 14333 ms
[2023-03-13 00:15:43] [INFO ] Implicit Places using invariants in 16229 ms returned []
Implicit Place search using SMT only with invariants took 16232 ms to find 0 implicit places.
[2023-03-13 00:15:43] [INFO ] Invariant cache hit.
[2023-03-13 00:15:44] [INFO ] Dead Transitions using invariants and state equation in 1879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23827 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s5892 s3902)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 45 reset in 3656 ms.
Entered a terminal (fully accepting) state of product in 41923 steps with 19 reset in 1517 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-03 finished in 29416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&F(p1)))||G(p2))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 35 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Applied a total of 17276 rules in 14595 ms. Remains 8645 /17283 variables (removed 8638) and now considering 40502/49140 (removed 8638) transitions.
[2023-03-13 00:16:05] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
// Phase 1: matrix 32672 rows 8645 cols
[2023-03-13 00:16:12] [INFO ] Computed 92 place invariants in 7061 ms
[2023-03-13 00:16:14] [INFO ] Implicit Places using invariants in 9202 ms returned []
Implicit Place search using SMT only with invariants took 9205 ms to find 0 implicit places.
[2023-03-13 00:16:14] [INFO ] Flow matrix only has 32672 transitions (discarded 7830 similar events)
[2023-03-13 00:16:14] [INFO ] Invariant cache hit.
[2023-03-13 00:16:38] [INFO ] Dead Transitions using invariants and state equation in 24564 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/17283 places, 40502/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48372 ms. Remains : 8645/17283 places, 40502/49140 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7480), p2:(AND (LEQ 1 s7480) (GT 3 s4486)), p1:(LEQ s6350 s3372)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 480 steps with 0 reset in 27 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-04 finished in 48661 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(((G(p0)||X(G(!p0))) U p1)))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5852 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:16:59] [INFO ] Computed 92 place invariants in 13931 ms
[2023-03-13 00:17:00] [INFO ] Implicit Places using invariants in 15570 ms returned []
Implicit Place search using SMT only with invariants took 15572 ms to find 0 implicit places.
[2023-03-13 00:17:00] [INFO ] Invariant cache hit.
[2023-03-13 00:17:02] [INFO ] Dead Transitions using invariants and state equation in 1654 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23081 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), p0, (NOT p1), false, true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s2860), p0:(LEQ s14779 s9644)], 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 27238 steps with 12 reset in 1070 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-05 finished in 24620 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 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 27 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Applied a total of 17278 rules in 13925 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
[2023-03-13 00:17:17] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
// Phase 1: matrix 32670 rows 8644 cols
[2023-03-13 00:17:24] [INFO ] Computed 92 place invariants in 6964 ms
[2023-03-13 00:17:25] [INFO ] Implicit Places using invariants in 8088 ms returned []
Implicit Place search using SMT only with invariants took 8091 ms to find 0 implicit places.
[2023-03-13 00:17:25] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
[2023-03-13 00:17:25] [INFO ] Invariant cache hit.
[2023-03-13 00:17:26] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/17283 places, 40501/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23117 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s5037)], 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 219 reset in 4496 ms.
Stack based approach found an accepted trace after 37300 steps with 81 reset with depth 395 and stack size 395 in 1502 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-06 finished in 29295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X((p1&&(p2 U (p3||G(p2)))))))'
Support contains 6 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5722 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:17:54] [INFO ] Computed 92 place invariants in 15509 ms
[2023-03-13 00:17:56] [INFO ] Implicit Places using invariants in 17331 ms returned []
Implicit Place search using SMT only with invariants took 17333 ms to find 0 implicit places.
[2023-03-13 00:17:56] [INFO ] Invariant cache hit.
[2023-03-13 00:17:57] [INFO ] Dead Transitions using invariants and state equation in 1676 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24741 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GT 2 s12360), p1:(LEQ s13948 s1009), p3:(AND (LEQ 2 s15558) (LEQ s8567 s8835)), p2:(GT 2 s15558)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 46 reset in 4005 ms.
Product exploration explored 100000 steps with 44 reset in 3896 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X (NOT (OR (NOT p0) (NOT p1) (AND (NOT p3) (NOT p2))))), (X (AND p0 p1 (NOT p3) p2)), (X (NOT (AND p0 p1 p3))), true, (X (X p0)), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 498 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 75420 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75420 steps, saw 74310 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:18:10] [INFO ] Invariant cache hit.
[2023-03-13 00:18:14] [INFO ] [Real]Absence check using 90 positive place invariants in 216 ms returned sat
[2023-03-13 00:18:14] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 454 ms returned sat
[2023-03-13 00:18:14] [INFO ] After 3822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:18:17] [INFO ] [Nat]Absence check using 90 positive place invariants in 217 ms returned sat
[2023-03-13 00:18:18] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 452 ms returned sat
[2023-03-13 00:18:39] [INFO ] After 20281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:18:40] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:18:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:18:40] [INFO ] After 25419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 26 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17277 place count 8645 transition count 40501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8189 times.
Drop transitions removed 8189 transitions
Iterating global reduction 3 with 8189 rules applied. Total rules applied 25467 place count 8644 transition count 40501
Applied a total of 25467 rules in 21423 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21424 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 79074 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79074 steps, saw 76865 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:19:05] [INFO ] Flow matrix only has 40499 transitions (discarded 2 similar events)
// Phase 1: matrix 40499 rows 8644 cols
[2023-03-13 00:19:09] [INFO ] Computed 92 place invariants in 3821 ms
[2023-03-13 00:19:10] [INFO ] [Real]Absence check using 90 positive place invariants in 140 ms returned sat
[2023-03-13 00:19:11] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 191 ms returned sat
[2023-03-13 00:19:11] [INFO ] After 2118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:19:12] [INFO ] [Nat]Absence check using 90 positive place invariants in 97 ms returned sat
[2023-03-13 00:19:13] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 167 ms returned sat
[2023-03-13 00:19:36] [INFO ] After 22622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:19:36] [INFO ] State equation strengthened by 40222 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:19:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:19:36] [INFO ] After 25513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3652 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3652 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3697 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
[2023-03-13 00:19:44] [INFO ] Flow matrix only has 40499 transitions (discarded 2 similar events)
[2023-03-13 00:19:44] [INFO ] Invariant cache hit.
[2023-03-13 00:19:45] [INFO ] Implicit Places using invariants in 941 ms returned []
Implicit Place search using SMT only with invariants took 945 ms to find 0 implicit places.
[2023-03-13 00:19:45] [INFO ] Flow matrix only has 40499 transitions (discarded 2 similar events)
[2023-03-13 00:19:45] [INFO ] Invariant cache hit.
[2023-03-13 00:20:10] [INFO ] Dead Transitions using invariants and state equation in 25189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29841 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p3) p2), (X (NOT (OR (NOT p0) (NOT p1) (AND (NOT p3) (NOT p2))))), (X (AND p0 p1 (NOT p3) p2)), (X (NOT (AND p0 p1 p3))), true, (X (X p0)), (X (X (NOT (OR (NOT p0) (AND (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Support contains 4 out of 17283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6008 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:20:31] [INFO ] Computed 92 place invariants in 14413 ms
[2023-03-13 00:20:33] [INFO ] Implicit Places using invariants in 16118 ms returned []
Implicit Place search using SMT only with invariants took 16121 ms to find 0 implicit places.
[2023-03-13 00:20:33] [INFO ] Invariant cache hit.
[2023-03-13 00:20:34] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23768 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p0 p3))), true, (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0))))), (X (X p0)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p0 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 475 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 97237 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97237 steps, saw 95729 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:20:39] [INFO ] Invariant cache hit.
[2023-03-13 00:20:42] [INFO ] [Real]Absence check using 90 positive place invariants in 246 ms returned sat
[2023-03-13 00:20:43] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 496 ms returned sat
[2023-03-13 00:20:43] [INFO ] After 3965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:20:46] [INFO ] [Nat]Absence check using 90 positive place invariants in 234 ms returned sat
[2023-03-13 00:20:47] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 498 ms returned sat
[2023-03-13 00:21:08] [INFO ] After 20220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:21:08] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:21:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:21:08] [INFO ] After 25346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 24 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17277 place count 8645 transition count 40501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8189 times.
Drop transitions removed 8189 transitions
Iterating global reduction 3 with 8189 rules applied. Total rules applied 25467 place count 8644 transition count 40501
Applied a total of 25467 rules in 21259 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21261 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 79799 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79799 steps, saw 76992 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:21:33] [INFO ] Flow matrix only has 40499 transitions (discarded 2 similar events)
// Phase 1: matrix 40499 rows 8644 cols
[2023-03-13 00:21:37] [INFO ] Computed 92 place invariants in 3850 ms
[2023-03-13 00:21:39] [INFO ] [Real]Absence check using 90 positive place invariants in 133 ms returned sat
[2023-03-13 00:21:39] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 180 ms returned sat
[2023-03-13 00:21:39] [INFO ] After 2093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:21:41] [INFO ] [Nat]Absence check using 90 positive place invariants in 119 ms returned sat
[2023-03-13 00:21:41] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 181 ms returned sat
[2023-03-13 00:22:04] [INFO ] After 22526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:22:05] [INFO ] State equation strengthened by 40222 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-13 00:22:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:22:05] [INFO ] After 25530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3670 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3670 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 3587 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
[2023-03-13 00:22:12] [INFO ] Flow matrix only has 40499 transitions (discarded 2 similar events)
[2023-03-13 00:22:12] [INFO ] Invariant cache hit.
[2023-03-13 00:22:13] [INFO ] Implicit Places using invariants in 1024 ms returned []
Implicit Place search using SMT only with invariants took 1026 ms to find 0 implicit places.
[2023-03-13 00:22:13] [INFO ] Flow matrix only has 40499 transitions (discarded 2 similar events)
[2023-03-13 00:22:13] [INFO ] Invariant cache hit.
[2023-03-13 00:22:14] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5612 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Graph (trivial) has 39944 edges and 8644 vertex of which 8277 / 8644 are part of one of the 2 SCC in 14 ms
Free SCC test removed 8275 places
Drop transitions removed 31939 transitions
Ensure Unique test removed 8184 transitions
Reduce isomorphic transitions removed 40123 transitions.
Graph (complete) has 920 edges and 369 vertex of which 98 are kept as prefixes of interest. Removing 271 places using SCC suffix rule.1 ms
Discarding 271 places :
Also discarding 89 output transitions
Drop transitions removed 89 transitions
Drop transitions removed 181 transitions
Reduce isomorphic transitions removed 181 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 98 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 185 place count 97 transition count 107
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 273 place count 9 transition count 19
Iterating global reduction 2 with 88 rules applied. Total rules applied 361 place count 9 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 9 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 364 place count 9 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 366 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 367 place count 7 transition count 14
Applied a total of 367 rules in 194 ms. Remains 7 /8644 variables (removed 8637) and now considering 14/40501 (removed 40487) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 14 rows 7 cols
[2023-03-13 00:22:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-13 00:22:15] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:22:15] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:22:15] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 00:22:15] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (X (AND p2 p0 (NOT p3))), (X (NOT (AND p0 p3))), true, (X (X (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0))))), (X (X p0)), (X (X (AND p2 p0 (NOT p3)))), (X (X (NOT (AND p0 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 45 reset in 3354 ms.
Product exploration explored 100000 steps with 43 reset in 3130 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 165 ms :[true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 17283 transition count 49140
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 450 place count 17283 transition count 49140
Deduced a syphon composed of 540 places in 21 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 540 place count 17283 transition count 49140
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 17103 transition count 48960
Deduced a syphon composed of 360 places in 14 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 17103 transition count 48960
Performed 8098 Post agglomeration using F-continuation condition.Transition count delta: -15836
Deduced a syphon composed of 8458 places in 19 ms
Iterating global reduction 1 with 8098 rules applied. Total rules applied 8998 place count 17103 transition count 64796
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 9358 place count 16743 transition count 64436
Deduced a syphon composed of 8098 places in 19 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 9718 place count 16743 transition count 64436
Deduced a syphon composed of 8098 places in 16 ms
Applied a total of 9718 rules in 39323 ms. Remains 16743 /17283 variables (removed 540) and now considering 64436/49140 (removed -15296) transitions.
[2023-03-13 00:23:02] [INFO ] Flow matrix only has 56606 transitions (discarded 7830 similar events)
// Phase 1: matrix 56606 rows 16743 cols
[2023-03-13 00:23:17] [INFO ] Computed 92 place invariants in 15054 ms
[2023-03-13 00:23:19] [INFO ] Dead Transitions using invariants and state equation in 16893 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16743/17283 places, 64436/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56224 ms. Remains : 16743/17283 places, 64436/49140 transitions.
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 8179 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:23:43] [INFO ] Computed 92 place invariants in 15478 ms
[2023-03-13 00:23:44] [INFO ] Implicit Places using invariants in 17178 ms returned []
Implicit Place search using SMT only with invariants took 17182 ms to find 0 implicit places.
[2023-03-13 00:23:44] [INFO ] Invariant cache hit.
[2023-03-13 00:23:46] [INFO ] Dead Transitions using invariants and state equation in 1726 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27093 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-08 finished in 375442 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))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 8319 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:23:56] [INFO ] Invariant cache hit.
[2023-03-13 00:23:58] [INFO ] Implicit Places using invariants in 1853 ms returned []
Implicit Place search using SMT only with invariants took 1860 ms to find 0 implicit places.
[2023-03-13 00:23:58] [INFO ] Invariant cache hit.
[2023-03-13 00:24:00] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11910 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s230 s7566)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-09 finished in 12283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(G((p0&&F(p1))))&&F(p2))))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7781 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:24:08] [INFO ] Invariant cache hit.
[2023-03-13 00:24:10] [INFO ] Implicit Places using invariants in 1555 ms returned []
Implicit Place search using SMT only with invariants took 1557 ms to find 0 implicit places.
[2023-03-13 00:24:10] [INFO ] Invariant cache hit.
[2023-03-13 00:24:11] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11054 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-10 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=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s15569 s855), p0:(LEQ 3 s3288), p1:(LEQ 2 s7763)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2104 steps with 0 reset in 108 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-10 finished in 11757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8010 Post agglomeration using F-continuation condition.Transition count delta: 8010
Deduced a syphon composed of 8010 places in 26 ms
Reduce places removed 8010 places and 0 transitions.
Iterating global reduction 2 with 16020 rules applied. Total rules applied 17280 place count 8643 transition count 40500
Applied a total of 17280 rules in 17915 ms. Remains 8643 /17283 variables (removed 8640) and now considering 40500/49140 (removed 8640) transitions.
[2023-03-13 00:24:30] [INFO ] Flow matrix only has 32668 transitions (discarded 7832 similar events)
// Phase 1: matrix 32668 rows 8643 cols
[2023-03-13 00:24:37] [INFO ] Computed 92 place invariants in 6931 ms
[2023-03-13 00:24:38] [INFO ] Implicit Places using invariants in 7903 ms returned []
Implicit Place search using SMT only with invariants took 7905 ms to find 0 implicit places.
[2023-03-13 00:24:38] [INFO ] Flow matrix only has 32668 transitions (discarded 7832 similar events)
[2023-03-13 00:24:38] [INFO ] Invariant cache hit.
[2023-03-13 00:24:39] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/17283 places, 40500/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26694 ms. Remains : 8643/17283 places, 40500/49140 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2746)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 468 steps with 0 reset in 28 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-11 finished in 26961 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 X(G(p1)))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 8294 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2023-03-13 00:25:02] [INFO ] Computed 92 place invariants in 14310 ms
[2023-03-13 00:25:03] [INFO ] Implicit Places using invariants in 16103 ms returned []
Implicit Place search using SMT only with invariants took 16105 ms to find 0 implicit places.
[2023-03-13 00:25:03] [INFO ] Invariant cache hit.
[2023-03-13 00:25:05] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26130 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT 2 s5274) (GT s6021 s14298)), p0:(LEQ 2 s5274)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-12 finished in 26495 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))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 8646 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:25:14] [INFO ] Invariant cache hit.
[2023-03-13 00:25:16] [INFO ] Implicit Places using invariants in 1801 ms returned []
Implicit Place search using SMT only with invariants took 1812 ms to find 0 implicit places.
[2023-03-13 00:25:16] [INFO ] Invariant cache hit.
[2023-03-13 00:25:18] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12295 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s11514) (LEQ 3 s13165)), p0:(GT 3 s15879)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-14 finished in 12692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 8228 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2023-03-13 00:25:26] [INFO ] Invariant cache hit.
[2023-03-13 00:25:28] [INFO ] Implicit Places using invariants in 1617 ms returned []
Implicit Place search using SMT only with invariants took 1619 ms to find 0 implicit places.
[2023-03-13 00:25:28] [INFO ] Invariant cache hit.
[2023-03-13 00:25:30] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11778 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s3430 s3231), p0:(OR (LEQ s11907 s2541) (LEQ 1 s5977))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 97370 steps with 48685 reset in 10001 ms.
Product exploration timeout after 98160 steps with 49080 reset in 10001 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLCardinality-15 finished in 32440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X((p1&&(p2 U (p3||G(p2)))))))'
[2023-03-13 00:25:52] [INFO ] Flatten gal took : 1338 ms
[2023-03-13 00:25:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-13 00:25:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17283 places, 49140 transitions and 131220 arcs took 129 ms.
Total runtime 879873 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1134/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-090-LTLCardinality-08

BK_STOP 1678667214377

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-090-LTLCardinality-08
ltl formula formula --ltl=/tmp/1134/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 17283 places, 49140 transitions and 131220 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 6.340 real 2.160 user 2.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1134/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1134/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1134/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1134/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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)

Sequence of Actions to be Executed by the VM

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

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

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