About the Execution of LTSMin+red for CANInsertWithFailure-PT-070
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4685.119 | 665988.00 | 1010462.00 | 297.60 | FFF?FF?TTFFFTTTF | normal |
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-167813695100755.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-070, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100755
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 7.2K Feb 26 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-070-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678664476140
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-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:41:19] [INFO ] Load time of PNML (sax parser for PT used): 1149 ms
[2023-03-12 23:41:19] [INFO ] Transformed 10644 places.
[2023-03-12 23:41:19] [INFO ] Transformed 29820 transitions.
[2023-03-12 23:41:19] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 1438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 10644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10643 transition count 29820
Applied a total of 1 rules in 3133 ms. Remains 10643 /10644 variables (removed 1) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:41:29] [INFO ] Computed 72 place invariants in 5471 ms
[2023-03-12 23:41:31] [INFO ] Implicit Places using invariants in 8180 ms returned []
Implicit Place search using SMT only with invariants took 8214 ms to find 0 implicit places.
[2023-03-12 23:41:31] [INFO ] Invariant cache hit.
[2023-03-12 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10643/10644 places, 29820/29820 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12750 ms. Remains : 10643/10644 places, 29820/29820 transitions.
Support contains 39 out of 10643 places after structural reductions.
[2023-03-12 23:41:35] [INFO ] Flatten gal took : 1695 ms
[2023-03-12 23:41:36] [INFO ] Flatten gal took : 1133 ms
[2023-03-12 23:41:38] [INFO ] Input system was already deterministic with 29820 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1369 ms. (steps per millisecond=7 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-12 23:41:41] [INFO ] Invariant cache hit.
[2023-03-12 23:41:45] [INFO ] [Real]Absence check using 70 positive place invariants in 327 ms returned sat
[2023-03-12 23:41:45] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 217 ms returned sat
[2023-03-12 23:41:45] [INFO ] After 4857ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 23:41:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 146 ms returned sat
[2023-03-12 23:41:50] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 217 ms returned sat
[2023-03-12 23:42:10] [INFO ] After 18408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 23:42:11] [INFO ] State equation strengthened by 9730 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:42:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:42:11] [INFO ] After 25180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4822 Post agglomeration using F-continuation condition.Transition count delta: 4822
Deduced a syphon composed of 4822 places in 15 ms
Reduce places removed 4822 places and 0 transitions.
Iterating global reduction 2 with 9644 rules applied. Total rules applied 10624 place count 5331 transition count 24508
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10625 place count 5331 transition count 24507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10626 place count 5330 transition count 24507
Partial Free-agglomeration rule applied 4959 times.
Drop transitions removed 4959 transitions
Iterating global reduction 3 with 4959 rules applied. Total rules applied 15585 place count 5330 transition count 24507
Applied a total of 15585 rules in 9618 ms. Remains 5330 /10643 variables (removed 5313) and now considering 24507/29820 (removed 5313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9624 ms. Remains : 5330/10643 places, 24507/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 23:42:21] [INFO ] Flow matrix only has 24495 transitions (discarded 12 similar events)
// Phase 1: matrix 24495 rows 5330 cols
[2023-03-12 23:42:22] [INFO ] Computed 72 place invariants in 1113 ms
[2023-03-12 23:42:24] [INFO ] [Real]Absence check using 70 positive place invariants in 66 ms returned sat
[2023-03-12 23:42:24] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 88 ms returned sat
[2023-03-12 23:42:24] [INFO ] After 1811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:42:25] [INFO ] [Nat]Absence check using 70 positive place invariants in 60 ms returned sat
[2023-03-12 23:42:25] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 84 ms returned sat
[2023-03-12 23:42:39] [INFO ] After 12787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:42:39] [INFO ] State equation strengthened by 24250 read => feed constraints.
[2023-03-12 23:42:49] [INFO ] After 9331ms SMT Verify possible using 24250 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 23:42:58] [INFO ] Deduced a trap composed of 3 places in 9342 ms of which 6 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:42:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:42:58] [INFO ] After 34378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 5330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5330/5330 places, 24507/24507 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5329 transition count 24506
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 5329 transition count 24506
Applied a total of 6 rules in 4135 ms. Remains 5329 /5330 variables (removed 1) and now considering 24506/24507 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4137 ms. Remains : 5329/5330 places, 24506/24507 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 23:43:03] [INFO ] Flow matrix only has 24498 transitions (discarded 8 similar events)
// Phase 1: matrix 24498 rows 5329 cols
[2023-03-12 23:43:04] [INFO ] Computed 72 place invariants in 1297 ms
[2023-03-12 23:43:06] [INFO ] [Real]Absence check using 70 positive place invariants in 91 ms returned sat
[2023-03-12 23:43:06] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 95 ms returned sat
[2023-03-12 23:43:06] [INFO ] After 1763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:43:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 56 ms returned sat
[2023-03-12 23:43:08] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 84 ms returned sat
[2023-03-12 23:43:21] [INFO ] After 13179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 23:43:22] [INFO ] State equation strengthened by 24260 read => feed constraints.
[2023-03-12 23:43:31] [INFO ] After 9568ms SMT Verify possible using 24260 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:43:31] [INFO ] After 9570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 23:43:31] [INFO ] After 25129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 11 out of 5329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5329/5329 places, 24506/24506 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5327 transition count 24504
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 5327 transition count 24504
Applied a total of 6 rules in 4543 ms. Remains 5327 /5329 variables (removed 2) and now considering 24504/24506 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4543 ms. Remains : 5327/5329 places, 24504/24506 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)||(!p0&&G(p2)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4828 Post agglomeration using F-continuation condition.Transition count delta: 4828
Deduced a syphon composed of 4828 places in 7 ms
Reduce places removed 4828 places and 0 transitions.
Iterating global reduction 3 with 9656 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Applied a total of 10634 rules in 5341 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
[2023-03-12 23:43:42] [INFO ] Flow matrix only has 19813 transitions (discarded 4690 similar events)
// Phase 1: matrix 19813 rows 5326 cols
[2023-03-12 23:43:44] [INFO ] Computed 72 place invariants in 1844 ms
[2023-03-12 23:43:45] [INFO ] Implicit Places using invariants in 3387 ms returned []
Implicit Place search using SMT only with invariants took 3394 ms to find 0 implicit places.
[2023-03-12 23:43:45] [INFO ] Flow matrix only has 19813 transitions (discarded 4690 similar events)
[2023-03-12 23:43:45] [INFO ] Invariant cache hit.
[2023-03-12 23:43:58] [INFO ] Dead Transitions using invariants and state equation in 13295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5326/10643 places, 24503/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22033 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT s370 s1505), p2:(GT s1131 s4551), p0:(GT 1 s974)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 321 steps with 0 reset in 22 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-00 finished in 22397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 17 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 3 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 5666 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2023-03-12 23:44:04] [INFO ] Flow matrix only has 19810 transitions (discarded 4692 similar events)
// Phase 1: matrix 19810 rows 5325 cols
[2023-03-12 23:44:06] [INFO ] Computed 72 place invariants in 1822 ms
[2023-03-12 23:44:08] [INFO ] Implicit Places using invariants in 3239 ms returned []
Implicit Place search using SMT only with invariants took 3240 ms to find 0 implicit places.
[2023-03-12 23:44:08] [INFO ] Flow matrix only has 19810 transitions (discarded 4692 similar events)
[2023-03-12 23:44:08] [INFO ] Invariant cache hit.
[2023-03-12 23:44:19] [INFO ] Dead Transitions using invariants and state equation in 11598 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20510 ms. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s383 s852)], 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 281 reset in 2375 ms.
Stack based approach found an accepted trace after 8639 steps with 23 reset with depth 368 and stack size 368 in 182 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-01 finished in 23162 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 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2079 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:44:29] [INFO ] Computed 72 place invariants in 4981 ms
[2023-03-12 23:44:30] [INFO ] Implicit Places using invariants in 6056 ms returned []
Implicit Place search using SMT only with invariants took 6058 ms to find 0 implicit places.
[2023-03-12 23:44:30] [INFO ] Invariant cache hit.
[2023-03-12 23:44:31] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9056 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-02 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 s10055 s4129)], 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 2 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-02 finished in 9298 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 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10153 transition count 29330
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 11 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 2 with 9658 rules applied. Total rules applied 10638 place count 5324 transition count 24501
Applied a total of 10638 rules in 5490 ms. Remains 5324 /10643 variables (removed 5319) and now considering 24501/29820 (removed 5319) transitions.
[2023-03-12 23:44:37] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
// Phase 1: matrix 19810 rows 5324 cols
[2023-03-12 23:44:38] [INFO ] Computed 72 place invariants in 1636 ms
[2023-03-12 23:44:40] [INFO ] Implicit Places using invariants in 3008 ms returned []
Implicit Place search using SMT only with invariants took 3011 ms to find 0 implicit places.
[2023-03-12 23:44:40] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2023-03-12 23:44:40] [INFO ] Invariant cache hit.
[2023-03-12 23:44:51] [INFO ] Dead Transitions using invariants and state equation in 11766 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5324/10643 places, 24501/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20269 ms. Remains : 5324/10643 places, 24501/29820 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-03 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 s1437 s3831)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 284 reset in 2578 ms.
Product exploration explored 100000 steps with 288 reset in 2763 ms.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3135 steps, including 8 resets, run visited all 1 properties in 66 ms. (steps per millisecond=47 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1182 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2023-03-12 23:44:59] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2023-03-12 23:44:59] [INFO ] Invariant cache hit.
[2023-03-12 23:45:00] [INFO ] Implicit Places using invariants in 1258 ms returned []
Implicit Place search using SMT only with invariants took 1259 ms to find 0 implicit places.
[2023-03-12 23:45:00] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2023-03-12 23:45:00] [INFO ] Invariant cache hit.
[2023-03-12 23:45:13] [INFO ] Dead Transitions using invariants and state equation in 12739 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15187 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Computed a total of 213 stabilizing places and 350 stable transitions
Computed a total of 213 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4636 steps, including 13 resets, run visited all 1 properties in 115 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 285 reset in 2182 ms.
Product exploration explored 100000 steps with 285 reset in 2316 ms.
Support contains 2 out of 5324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5324/5324 places, 24501/24501 transitions.
Applied a total of 0 rules in 1016 ms. Remains 5324 /5324 variables (removed 0) and now considering 24501/24501 (removed 0) transitions.
[2023-03-12 23:45:19] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2023-03-12 23:45:19] [INFO ] Invariant cache hit.
[2023-03-12 23:45:21] [INFO ] Implicit Places using invariants in 1351 ms returned []
Implicit Place search using SMT only with invariants took 1355 ms to find 0 implicit places.
[2023-03-12 23:45:21] [INFO ] Flow matrix only has 19810 transitions (discarded 4691 similar events)
[2023-03-12 23:45:21] [INFO ] Invariant cache hit.
[2023-03-12 23:45:36] [INFO ] Dead Transitions using invariants and state equation in 15428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17801 ms. Remains : 5324/5324 places, 24501/24501 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-03 finished in 65932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2121 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:45:44] [INFO ] Computed 72 place invariants in 4793 ms
[2023-03-12 23:45:45] [INFO ] Implicit Places using invariants in 5774 ms returned []
Implicit Place search using SMT only with invariants took 5788 ms to find 0 implicit places.
[2023-03-12 23:45:45] [INFO ] Invariant cache hit.
[2023-03-12 23:45:46] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8863 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s1723), p0:(LEQ 1 s359)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5395 steps with 2 reset in 97 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-04 finished in 9146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 5 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2297 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:45:49] [INFO ] Invariant cache hit.
[2023-03-12 23:45:49] [INFO ] Implicit Places using invariants in 905 ms returned []
Implicit Place search using SMT only with invariants took 908 ms to find 0 implicit places.
[2023-03-12 23:45:50] [INFO ] Invariant cache hit.
[2023-03-12 23:45:50] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4118 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT s5482 s1137), p0:(AND (GT 1 s7280) (GT s5349 s4055))], 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 1 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-05 finished in 4334 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((X(p0)||F((p1||(X(!p0) U ((X(!p0)&&G(p2))||X(G(!p0)))))))))'
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2267 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:45:53] [INFO ] Invariant cache hit.
[2023-03-12 23:45:54] [INFO ] Implicit Places using invariants in 1026 ms returned []
Implicit Place search using SMT only with invariants took 1043 ms to find 0 implicit places.
[2023-03-12 23:45:54] [INFO ] Invariant cache hit.
[2023-03-12 23:45:55] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4231 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 213 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s849), p2:(GT 3 s1654), p0:(LEQ 3 s5986)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 595 reset in 1931 ms.
Product exploration explored 100000 steps with 576 reset in 1995 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 23:46:00] [INFO ] Invariant cache hit.
[2023-03-12 23:46:02] [INFO ] [Real]Absence check using 70 positive place invariants in 134 ms returned sat
[2023-03-12 23:46:02] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 206 ms returned sat
[2023-03-12 23:46:24] [INFO ] After 21087ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-12 23:46:24] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2023-03-12 23:46:25] [INFO ] After 1556ms SMT Verify possible using 9730 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-12 23:46:25] [INFO ] After 1557ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 23:46:25] [INFO ] After 25049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 9 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 3 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10633 place count 5327 transition count 24503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 4 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 9560 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9560 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 666 ms. (steps per millisecond=15 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63432 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63432 steps, saw 52116 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 24503 rows 5326 cols
[2023-03-12 23:46:40] [INFO ] Computed 72 place invariants in 1147 ms
[2023-03-12 23:46:41] [INFO ] [Real]Absence check using 70 positive place invariants in 57 ms returned sat
[2023-03-12 23:46:41] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 69 ms returned sat
[2023-03-12 23:46:53] [INFO ] After 13438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:46:54] [INFO ] [Nat]Absence check using 70 positive place invariants in 54 ms returned sat
[2023-03-12 23:46:54] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 83 ms returned sat
[2023-03-12 23:47:07] [INFO ] After 12247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:47:07] [INFO ] State equation strengthened by 24215 read => feed constraints.
[2023-03-12 23:47:16] [INFO ] After 8897ms SMT Verify possible using 24215 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:47:27] [INFO ] Deduced a trap composed of 3 places in 8835 ms of which 5 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-12 23:47:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:47:27] [INFO ] After 33981ms 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 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1460 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1460 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1328 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2023-03-12 23:47:30] [INFO ] Invariant cache hit.
[2023-03-12 23:47:34] [INFO ] Implicit Places using invariants in 3870 ms returned []
Implicit Place search using SMT only with invariants took 3871 ms to find 0 implicit places.
[2023-03-12 23:47:34] [INFO ] Invariant cache hit.
[2023-03-12 23:47:45] [INFO ] Dead Transitions using invariants and state equation in 11345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16549 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 486 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 311 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2080 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:47:53] [INFO ] Computed 72 place invariants in 5120 ms
[2023-03-12 23:47:54] [INFO ] Implicit Places using invariants in 6135 ms returned []
Implicit Place search using SMT only with invariants took 6137 ms to find 0 implicit places.
[2023-03-12 23:47:54] [INFO ] Invariant cache hit.
[2023-03-12 23:47:56] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9431 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 409 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 23:47:57] [INFO ] Invariant cache hit.
[2023-03-12 23:47:59] [INFO ] [Real]Absence check using 70 positive place invariants in 138 ms returned sat
[2023-03-12 23:47:59] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 214 ms returned sat
[2023-03-12 23:48:19] [INFO ] After 19365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-12 23:48:19] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2023-03-12 23:48:22] [INFO ] After 2925ms SMT Verify possible using 9730 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-12 23:48:22] [INFO ] After 2927ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 23:48:22] [INFO ] After 25084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4827 Post agglomeration using F-continuation condition.Transition count delta: 4827
Deduced a syphon composed of 4827 places in 8 ms
Reduce places removed 4827 places and 0 transitions.
Iterating global reduction 3 with 9654 rules applied. Total rules applied 10632 place count 5327 transition count 24504
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10633 place count 5327 transition count 24503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10634 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 4972 times.
Drop transitions removed 4972 transitions
Iterating global reduction 4 with 4972 rules applied. Total rules applied 15606 place count 5326 transition count 24503
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 15676 place count 5326 transition count 24503
Applied a total of 15676 rules in 9278 ms. Remains 5326 /10643 variables (removed 5317) and now considering 24503/29820 (removed 5317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9278 ms. Remains : 5326/10643 places, 24503/29820 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 563 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 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 64837 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64837 steps, saw 52279 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 24503 rows 5326 cols
[2023-03-12 23:48:36] [INFO ] Computed 72 place invariants in 1437 ms
[2023-03-12 23:48:37] [INFO ] [Real]Absence check using 70 positive place invariants in 85 ms returned sat
[2023-03-12 23:48:37] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 89 ms returned sat
[2023-03-12 23:48:50] [INFO ] After 13303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:48:51] [INFO ] [Nat]Absence check using 70 positive place invariants in 54 ms returned sat
[2023-03-12 23:48:51] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 81 ms returned sat
[2023-03-12 23:49:03] [INFO ] After 11767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:49:03] [INFO ] State equation strengthened by 24215 read => feed constraints.
[2023-03-12 23:49:12] [INFO ] After 9000ms SMT Verify possible using 24215 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:49:15] [INFO ] After 11965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:49:15] [INFO ] After 25159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 5326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1299 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1299 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5326/5326 places, 24503/24503 transitions.
Applied a total of 0 rules in 1565 ms. Remains 5326 /5326 variables (removed 0) and now considering 24503/24503 (removed 0) transitions.
[2023-03-12 23:49:18] [INFO ] Invariant cache hit.
[2023-03-12 23:49:22] [INFO ] Implicit Places using invariants in 3730 ms returned []
Implicit Place search using SMT only with invariants took 3745 ms to find 0 implicit places.
[2023-03-12 23:49:22] [INFO ] Invariant cache hit.
[2023-03-12 23:49:33] [INFO ] Dead Transitions using invariants and state equation in 11617 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16932 ms. Remains : 5326/5326 places, 24503/24503 transitions.
Graph (trivial) has 24006 edges and 5326 vertex of which 4968 / 5326 are part of one of the 2 SCC in 7 ms
Free SCC test removed 4966 places
Drop transitions removed 18906 transitions
Ensure Unique test removed 4958 transitions
Reduce isomorphic transitions removed 23864 transitions.
Graph (complete) has 1063 edges and 360 vertex of which 150 are kept as prefixes of interest. Removing 210 places using SCC suffix rule.1 ms
Discarding 210 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Drop transitions removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 150 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 211 place count 150 transition count 361
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 213 place count 149 transition count 361
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 347 place count 15 transition count 95
Iterating global reduction 1 with 134 rules applied. Total rules applied 481 place count 15 transition count 95
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 547 place count 15 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 549 place count 14 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 551 place count 13 transition count 27
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 555 place count 13 transition count 23
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 556 place count 13 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 12 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 558 place count 11 transition count 21
Applied a total of 558 rules in 97 ms. Remains 11 /5326 variables (removed 5315) and now considering 21/24503 (removed 24482) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 21 rows 11 cols
[2023-03-12 23:49:33] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-12 23:49:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 23:49:33] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:49:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 23:49:33] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:49:33] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-12 23:49:34] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 457 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 166 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 195 ms :[false, false, false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 557 reset in 1692 ms.
Product exploration explored 100000 steps with 612 reset in 1847 ms.
Support contains 3 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2054 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:49:46] [INFO ] Computed 72 place invariants in 5248 ms
[2023-03-12 23:49:47] [INFO ] Implicit Places using invariants in 6231 ms returned []
Implicit Place search using SMT only with invariants took 6233 ms to find 0 implicit places.
[2023-03-12 23:49:47] [INFO ] Invariant cache hit.
[2023-03-12 23:49:48] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9178 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-06 finished in 237541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 10643 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 10643 transition count 29332
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 10155 transition count 29331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 10154 transition count 29331
Performed 4829 Post agglomeration using F-continuation condition.Transition count delta: 4829
Deduced a syphon composed of 4829 places in 8 ms
Reduce places removed 4829 places and 0 transitions.
Iterating global reduction 3 with 9658 rules applied. Total rules applied 10636 place count 5325 transition count 24502
Applied a total of 10636 rules in 5846 ms. Remains 5325 /10643 variables (removed 5318) and now considering 24502/29820 (removed 5318) transitions.
[2023-03-12 23:49:54] [INFO ] Flow matrix only has 19810 transitions (discarded 4692 similar events)
// Phase 1: matrix 19810 rows 5325 cols
[2023-03-12 23:49:56] [INFO ] Computed 72 place invariants in 1855 ms
[2023-03-12 23:50:00] [INFO ] Implicit Places using invariants in 6145 ms returned []
Implicit Place search using SMT only with invariants took 6146 ms to find 0 implicit places.
[2023-03-12 23:50:00] [INFO ] Flow matrix only has 19810 transitions (discarded 4692 similar events)
[2023-03-12 23:50:00] [INFO ] Invariant cache hit.
[2023-03-12 23:50:12] [INFO ] Dead Transitions using invariants and state equation in 12261 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/10643 places, 24502/29820 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24259 ms. Remains : 5325/10643 places, 24502/29820 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-10 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 s155 s3454)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 310 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-10 finished in 24371 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((X(p1)&&p0))))'
Support contains 6 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2261 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
// Phase 1: matrix 29820 rows 10643 cols
[2023-03-12 23:50:20] [INFO ] Computed 72 place invariants in 5057 ms
[2023-03-12 23:50:21] [INFO ] Implicit Places using invariants in 6331 ms returned []
Implicit Place search using SMT only with invariants took 6335 ms to find 0 implicit places.
[2023-03-12 23:50:21] [INFO ] Invariant cache hit.
[2023-03-12 23:50:22] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9740 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s969 s8170) (LEQ s10036 s1040)), p1:(GT s3072 s9805)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1566 steps with 0 reset in 54 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-11 finished in 9979 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)))||F(p2)))'
Support contains 4 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2888 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:50:25] [INFO ] Invariant cache hit.
[2023-03-12 23:50:26] [INFO ] Implicit Places using invariants in 1060 ms returned []
Implicit Place search using SMT only with invariants took 1062 ms to find 0 implicit places.
[2023-03-12 23:50:27] [INFO ] Invariant cache hit.
[2023-03-12 23:50:28] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5093 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LEQ 3 s7311) (LEQ s1968 s9821)), p0:(GT 2 s2171), p1:(GT 3 s7311)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7658 ms.
Product exploration explored 100000 steps with 50000 reset in 7183 ms.
Computed a total of 282 stabilizing places and 490 stable transitions
Computed a total of 282 stabilizing places and 490 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-12 finished in 20272 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)||(p0&&F(((p1&&X(F(p2)))||G(F(p2))))))))'
Support contains 6 out of 10643 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10643/10643 places, 29820/29820 transitions.
Applied a total of 0 rules in 2523 ms. Remains 10643 /10643 variables (removed 0) and now considering 29820/29820 (removed 0) transitions.
[2023-03-12 23:50:45] [INFO ] Invariant cache hit.
[2023-03-12 23:50:46] [INFO ] Implicit Places using invariants in 1130 ms returned []
Implicit Place search using SMT only with invariants took 1133 ms to find 0 implicit places.
[2023-03-12 23:50:46] [INFO ] Invariant cache hit.
[2023-03-12 23:50:47] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4673 ms. Remains : 10643/10643 places, 29820/29820 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-070-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s2131 s5208), p1:(GT s7714 s99), p2:(LEQ s1529 s5521)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1553 steps with 0 reset in 33 ms.
FORMULA CANInsertWithFailure-PT-070-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-070-LTLCardinality-15 finished in 4960 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)))'
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((X(p0)||F((p1||(X(!p0) U ((X(!p0)&&G(p2))||X(G(!p0)))))))))'
[2023-03-12 23:50:49] [INFO ] Flatten gal took : 824 ms
[2023-03-12 23:50:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 23:50:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10643 places, 29820 transitions and 79660 arcs took 108 ms.
Total runtime 571008 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1304/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1304/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-070-LTLCardinality-03
Could not compute solution for formula : CANInsertWithFailure-PT-070-LTLCardinality-06
BK_STOP 1678665142128
--------------------
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-070-LTLCardinality-03
ltl formula formula --ltl=/tmp/1304/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10643 places, 29820 transitions and 79660 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.200 real 0.840 user 1.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1304/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CANInsertWithFailure-PT-070-LTLCardinality-06
ltl formula formula --ltl=/tmp/1304/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10643 places, 29820 transitions and 79660 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.110 real 0.760 user 0.990 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1304/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1304/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1304/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1304/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="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-070, 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-167813695100755"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 execution
cd execution
if [ "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 '
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 ;