About the Execution of LTSMin+red for CANInsertWithFailure-PT-060
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5274.212 | 1334213.00 | 1687736.00 | 441.10 | ?FFF?FFFFF?FFFF? | 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-167813695100748.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-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100748
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K 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 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 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 22M 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-060-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678663308051
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 23:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:21:51] [INFO ] Load time of PNML (sax parser for PT used): 1063 ms
[2023-03-12 23:21:51] [INFO ] Transformed 7924 places.
[2023-03-12 23:21:51] [INFO ] Transformed 21960 transitions.
[2023-03-12 23:21:51] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 1429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 7924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7923 transition count 21960
Applied a total of 1 rules in 1959 ms. Remains 7923 /7924 variables (removed 1) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:21:56] [INFO ] Computed 62 place invariants in 2419 ms
[2023-03-12 23:21:59] [INFO ] Implicit Places using invariants in 5167 ms returned []
Implicit Place search using SMT only with invariants took 5246 ms to find 0 implicit places.
[2023-03-12 23:21:59] [INFO ] Invariant cache hit.
[2023-03-12 23:22:00] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7923/7924 places, 21960/21960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8230 ms. Remains : 7923/7924 places, 21960/21960 transitions.
Support contains 31 out of 7923 places after structural reductions.
[2023-03-12 23:22:02] [INFO ] Flatten gal took : 1233 ms
[2023-03-12 23:22:03] [INFO ] Flatten gal took : 841 ms
[2023-03-12 23:22:05] [INFO ] Input system was already deterministic with 21960 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1037 ms. (steps per millisecond=9 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-12 23:22:06] [INFO ] Invariant cache hit.
[2023-03-12 23:22:10] [INFO ] [Real]Absence check using 60 positive place invariants in 94 ms returned sat
[2023-03-12 23:22:10] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 142 ms returned sat
[2023-03-12 23:22:31] [INFO ] After 18574ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-12 23:22:31] [INFO ] State equation strengthened by 7140 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:22:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:22:31] [INFO ] After 25189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 17 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 22 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 7923 transition count 21544
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 7507 transition count 21544
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 832 place count 7507 transition count 21543
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 834 place count 7506 transition count 21543
Performed 3529 Post agglomeration using F-continuation condition.Transition count delta: 3529
Deduced a syphon composed of 3529 places in 28 ms
Reduce places removed 3529 places and 0 transitions.
Iterating global reduction 2 with 7058 rules applied. Total rules applied 7892 place count 3977 transition count 18014
Drop transitions removed 3413 transitions
Redundant transition composition rules discarded 3413 transitions
Iterating global reduction 2 with 3413 rules applied. Total rules applied 11305 place count 3977 transition count 14601
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11309 place count 3977 transition count 14597
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11313 place count 3973 transition count 14597
Partial Free-agglomeration rule applied 3654 times.
Drop transitions removed 3654 transitions
Iterating global reduction 3 with 3654 rules applied. Total rules applied 14967 place count 3973 transition count 14597
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15027 place count 3973 transition count 14597
Applied a total of 15027 rules in 11148 ms. Remains 3973 /7923 variables (removed 3950) and now considering 14597/21960 (removed 7363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11154 ms. Remains : 3973/7923 places, 14597/21960 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 14597 rows 3973 cols
[2023-03-12 23:22:44] [INFO ] Computed 62 place invariants in 555 ms
[2023-03-12 23:22:45] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2023-03-12 23:22:46] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2023-03-12 23:22:55] [INFO ] After 8787ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:2
[2023-03-12 23:22:55] [INFO ] State equation strengthened by 14379 read => feed constraints.
[2023-03-12 23:23:04] [INFO ] After 9044ms SMT Verify possible using 14379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:23:04] [INFO ] After 19506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 23:23:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-12 23:23:05] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 74 ms returned sat
[2023-03-12 23:23:21] [INFO ] After 15513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 23:23:29] [INFO ] After 8088ms SMT Verify possible using 14379 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 23:23:29] [INFO ] After 8089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 23:23:29] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 6 properties in 80 ms.
Support contains 5 out of 3973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3973/3973 places, 14597/14597 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 3963 transition count 14587
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 3963 transition count 14587
Applied a total of 26 rules in 2664 ms. Remains 3963 /3973 variables (removed 10) and now considering 14587/14597 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2665 ms. Remains : 3963/3973 places, 14587/14597 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14587 rows 3963 cols
[2023-03-12 23:23:32] [INFO ] Computed 62 place invariants in 520 ms
[2023-03-12 23:23:33] [INFO ] [Real]Absence check using 60 positive place invariants in 76 ms returned sat
[2023-03-12 23:23:33] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 73 ms returned sat
[2023-03-12 23:23:44] [INFO ] After 10256ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:23:44] [INFO ] State equation strengthened by 14405 read => feed constraints.
[2023-03-12 23:23:46] [INFO ] After 2573ms SMT Verify possible using 14405 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:23:46] [INFO ] After 13846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:23:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 42 ms returned sat
[2023-03-12 23:23:47] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-12 23:23:53] [INFO ] After 5826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:24:02] [INFO ] After 9274ms SMT Verify possible using 14405 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:24:03] [INFO ] After 10318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 991 ms.
[2023-03-12 23:24:04] [INFO ] After 17794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14587/14587 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3963 transition count 14587
Applied a total of 1 rules in 1624 ms. Remains 3963 /3963 variables (removed 0) and now considering 14587/14587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1626 ms. Remains : 3963/3963 places, 14587/14587 transitions.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 420 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 7923 transition count 21541
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 9 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Applied a total of 11337 rules in 4667 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14581/21960 (removed 7379) transitions.
// Phase 1: matrix 14581 rows 3965 cols
[2023-03-12 23:24:12] [INFO ] Computed 62 place invariants in 1046 ms
[2023-03-12 23:24:13] [INFO ] Implicit Places using invariants in 2250 ms returned []
Implicit Place search using SMT only with invariants took 2254 ms to find 0 implicit places.
[2023-03-12 23:24:13] [INFO ] Invariant cache hit.
[2023-03-12 23:24:22] [INFO ] Dead Transitions using invariants and state equation in 8597 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14581/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15523 ms. Remains : 3965/7923 places, 14581/21960 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LT s3852 1), p0:(AND (GEQ s287 1) (GEQ s3591 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 332 reset in 1986 ms.
Product exploration explored 100000 steps with 329 reset in 2449 ms.
Computed a total of 184 stabilizing places and 301 stable transitions
Computed a total of 184 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:24:27] [INFO ] Invariant cache hit.
[2023-03-12 23:24:28] [INFO ] [Real]Absence check using 60 positive place invariants in 66 ms returned sat
[2023-03-12 23:24:28] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 93 ms returned sat
[2023-03-12 23:24:36] [INFO ] After 8553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:24:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2023-03-12 23:24:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-12 23:24:46] [INFO ] After 9577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:24:46] [INFO ] State equation strengthened by 10737 read => feed constraints.
[2023-03-12 23:24:50] [INFO ] After 3744ms SMT Verify possible using 10737 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:24:51] [INFO ] After 4457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 607 ms.
[2023-03-12 23:24:51] [INFO ] After 15399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14581/14581 transitions.
Applied a total of 0 rules in 1060 ms. Remains 3965 /3965 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-12 23:24:53] [INFO ] Invariant cache hit.
[2023-03-12 23:24:54] [INFO ] Implicit Places using invariants in 1330 ms returned []
Implicit Place search using SMT only with invariants took 1340 ms to find 0 implicit places.
[2023-03-12 23:24:54] [INFO ] Invariant cache hit.
[2023-03-12 23:25:06] [INFO ] Dead Transitions using invariants and state equation in 12132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14565 ms. Remains : 3965/3965 places, 14581/14581 transitions.
Computed a total of 184 stabilizing places and 301 stable transitions
Computed a total of 184 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 506 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:25:07] [INFO ] Invariant cache hit.
[2023-03-12 23:25:08] [INFO ] [Real]Absence check using 60 positive place invariants in 67 ms returned sat
[2023-03-12 23:25:08] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 75 ms returned sat
[2023-03-12 23:25:14] [INFO ] After 6153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:25:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 64 ms returned sat
[2023-03-12 23:25:15] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 73 ms returned sat
[2023-03-12 23:25:25] [INFO ] After 10402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:25:25] [INFO ] State equation strengthened by 10737 read => feed constraints.
[2023-03-12 23:25:29] [INFO ] After 3771ms SMT Verify possible using 10737 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:25:30] [INFO ] After 4609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 543 ms.
[2023-03-12 23:25:30] [INFO ] After 16870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 531 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 333 reset in 1824 ms.
Product exploration explored 100000 steps with 333 reset in 2431 ms.
Support contains 3 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14581/14581 transitions.
Applied a total of 0 rules in 758 ms. Remains 3965 /3965 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-12 23:25:36] [INFO ] Invariant cache hit.
[2023-03-12 23:25:38] [INFO ] Implicit Places using invariants in 1722 ms returned []
Implicit Place search using SMT only with invariants took 1725 ms to find 0 implicit places.
[2023-03-12 23:25:38] [INFO ] Invariant cache hit.
[2023-03-12 23:25:48] [INFO ] Dead Transitions using invariants and state equation in 9882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12369 ms. Remains : 3965/3965 places, 14581/14581 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-00 finished in 103058 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))||(F(p0)&&(X(p1)||G(!p1)))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1077 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:25:53] [INFO ] Computed 62 place invariants in 2323 ms
[2023-03-12 23:25:54] [INFO ] Implicit Places using invariants in 3865 ms returned []
Implicit Place search using SMT only with invariants took 3884 ms to find 0 implicit places.
[2023-03-12 23:25:54] [INFO ] Invariant cache hit.
[2023-03-12 23:25:56] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6192 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), p1, (AND p1 (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s278 1) (GEQ s287 1)), p1:(GEQ s6580 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1529 steps with 0 reset in 32 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-01 finished in 6738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X(G(p1))))))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1248 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:25:57] [INFO ] Invariant cache hit.
[2023-03-12 23:25:59] [INFO ] Implicit Places using invariants in 1558 ms returned []
Implicit Place search using SMT only with invariants took 1567 ms to find 0 implicit places.
[2023-03-12 23:25:59] [INFO ] Invariant cache hit.
[2023-03-12 23:26:00] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3891 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 539 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LT s4513 1), p1:(LT s2572 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3779 steps with 2 reset in 87 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-02 finished in 4634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 12 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7918 place count 3964 transition count 18001
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Applied a total of 11339 rules in 4896 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2023-03-12 23:26:07] [INFO ] Computed 62 place invariants in 1157 ms
[2023-03-12 23:26:08] [INFO ] Implicit Places using invariants in 2817 ms returned []
Implicit Place search using SMT only with invariants took 2833 ms to find 0 implicit places.
[2023-03-12 23:26:08] [INFO ] Invariant cache hit.
[2023-03-12 23:26:23] [INFO ] Dead Transitions using invariants and state equation in 14996 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3964/7923 places, 14580/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22736 ms. Remains : 3964/7923 places, 14580/21960 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1447 1), p1:(GEQ s1581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 306 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-03 finished in 22972 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 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 12 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Applied a total of 11336 rules in 4537 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2023-03-12 23:26:29] [INFO ] Computed 62 place invariants in 800 ms
[2023-03-12 23:26:34] [INFO ] Implicit Places using invariants in 5239 ms returned []
Implicit Place search using SMT only with invariants took 5247 ms to find 0 implicit places.
[2023-03-12 23:26:34] [INFO ] Invariant cache hit.
[2023-03-12 23:26:46] [INFO ] Dead Transitions using invariants and state equation in 12237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22054 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s612 1) (AND (GEQ s2423 1) (LT s2423 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 330 reset in 1939 ms.
Product exploration explored 100000 steps with 330 reset in 1866 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 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 109 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5699 steps, including 18 resets, run visited all 1 properties in 131 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 243 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Applied a total of 0 rules in 783 ms. Remains 3965 /3965 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2023-03-12 23:26:52] [INFO ] Invariant cache hit.
[2023-03-12 23:26:53] [INFO ] Implicit Places using invariants in 1864 ms returned []
Implicit Place search using SMT only with invariants took 1869 ms to find 0 implicit places.
[2023-03-12 23:26:53] [INFO ] Invariant cache hit.
[2023-03-12 23:27:05] [INFO ] Dead Transitions using invariants and state equation in 11940 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14596 ms. Remains : 3965/3965 places, 14582/14582 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 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 89 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 69529 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69529 steps, saw 34632 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:27:09] [INFO ] Invariant cache hit.
[2023-03-12 23:27:10] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-12 23:27:10] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 58 ms returned sat
[2023-03-12 23:27:17] [INFO ] After 7215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:27:17] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2023-03-12 23:27:19] [INFO ] After 1816ms SMT Verify possible using 10736 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:27:19] [INFO ] After 9770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:27:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 34 ms returned sat
[2023-03-12 23:27:19] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-12 23:27:24] [INFO ] After 4739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:27:26] [INFO ] After 1724ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:27:26] [INFO ] After 2374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 473 ms.
[2023-03-12 23:27:27] [INFO ] After 8164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 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 116 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 331 reset in 2113 ms.
Product exploration explored 100000 steps with 331 reset in 1950 ms.
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Applied a total of 0 rules in 701 ms. Remains 3965 /3965 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2023-03-12 23:27:32] [INFO ] Invariant cache hit.
[2023-03-12 23:27:33] [INFO ] Implicit Places using invariants in 1073 ms returned []
Implicit Place search using SMT only with invariants took 1075 ms to find 0 implicit places.
[2023-03-12 23:27:33] [INFO ] Invariant cache hit.
[2023-03-12 23:27:43] [INFO ] Dead Transitions using invariants and state equation in 9982 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11762 ms. Remains : 3965/3965 places, 14582/14582 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-04 finished in 80108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 9 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 4123 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2023-03-12 23:27:49] [INFO ] Computed 62 place invariants in 1096 ms
[2023-03-12 23:27:50] [INFO ] Implicit Places using invariants in 2460 ms returned []
Implicit Place search using SMT only with invariants took 2475 ms to find 0 implicit places.
[2023-03-12 23:27:50] [INFO ] Invariant cache hit.
[2023-03-12 23:28:04] [INFO ] Dead Transitions using invariants and state equation in 13912 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20527 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s899 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 299 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-06 finished in 20620 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))&&G(p1))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1196 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:28:08] [INFO ] Computed 62 place invariants in 2193 ms
[2023-03-12 23:28:10] [INFO ] Implicit Places using invariants in 3873 ms returned []
Implicit Place search using SMT only with invariants took 3876 ms to find 0 implicit places.
[2023-03-12 23:28:10] [INFO ] Invariant cache hit.
[2023-03-12 23:28:11] [INFO ] Dead Transitions using invariants and state equation in 1572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6652 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s1570 1), p0:(AND (LT s1570 1) (LT s5308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-07 finished in 7004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 10 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7918 place count 3964 transition count 18001
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11339 place count 3964 transition count 14580
Applied a total of 11339 rules in 4068 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14580/21960 (removed 7380) transitions.
// Phase 1: matrix 14580 rows 3964 cols
[2023-03-12 23:28:17] [INFO ] Computed 62 place invariants in 1022 ms
[2023-03-12 23:28:20] [INFO ] Implicit Places using invariants in 4922 ms returned []
Implicit Place search using SMT only with invariants took 4925 ms to find 0 implicit places.
[2023-03-12 23:28:20] [INFO ] Invariant cache hit.
[2023-03-12 23:28:29] [INFO ] Dead Transitions using invariants and state equation in 8610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3964/7923 places, 14580/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17605 ms. Remains : 3964/7923 places, 14580/21960 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1896 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-09 finished in 17702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||X(!p0))&&(X(!p0)||F((p1&&X(p2))))))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1140 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:28:32] [INFO ] Computed 62 place invariants in 2050 ms
[2023-03-12 23:28:33] [INFO ] Implicit Places using invariants in 2969 ms returned []
Implicit Place search using SMT only with invariants took 2984 ms to find 0 implicit places.
[2023-03-12 23:28:33] [INFO ] Invariant cache hit.
[2023-03-12 23:28:35] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5672 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s7687 1), p1:(OR (LT s245 1) (LT s376 1)), p2:(LT s7872 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33290 reset in 3670 ms.
Product exploration explored 100000 steps with 33315 reset in 3650 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1290 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 23:28:46] [INFO ] Invariant cache hit.
[2023-03-12 23:28:47] [INFO ] [Real]Absence check using 60 positive place invariants in 109 ms returned sat
[2023-03-12 23:28:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 152 ms returned sat
[2023-03-12 23:29:06] [INFO ] After 18512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-12 23:29:06] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:29:11] [INFO ] After 4476ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-12 23:29:11] [INFO ] After 4478ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 23:29:11] [INFO ] After 25119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-12 23:29:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 128 ms returned sat
[2023-03-12 23:29:12] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 146 ms returned sat
[2023-03-12 23:29:30] [INFO ] After 17030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:29:36] [INFO ] After 5599ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:29:36] [INFO ] After 5600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 23:29:36] [INFO ] After 25086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 9 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11338 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11340 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 3 with 3661 rules applied. Total rules applied 15001 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15061 place count 3964 transition count 14579
Applied a total of 15061 rules in 6669 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14579/21960 (removed 7381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6673 ms. Remains : 3964/7923 places, 14579/21960 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2023-03-12 23:29:44] [INFO ] Computed 62 place invariants in 626 ms
[2023-03-12 23:29:44] [INFO ] [Real]Absence check using 60 positive place invariants in 42 ms returned sat
[2023-03-12 23:29:44] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 63 ms returned sat
[2023-03-12 23:29:49] [INFO ] After 5854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:29:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2023-03-12 23:29:50] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 72 ms returned sat
[2023-03-12 23:29:56] [INFO ] After 6054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:29:57] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:30:06] [INFO ] After 9460ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:30:10] [INFO ] After 13002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2172 ms.
[2023-03-12 23:30:12] [INFO ] After 22349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 904 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 43385 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43385 steps, saw 28201 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 23:30:17] [INFO ] Invariant cache hit.
[2023-03-12 23:30:17] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2023-03-12 23:30:17] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 51 ms returned sat
[2023-03-12 23:30:24] [INFO ] After 6140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 23:30:24] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:30:26] [INFO ] After 1851ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:30:26] [INFO ] After 9050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:30:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 43 ms returned sat
[2023-03-12 23:30:26] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 61 ms returned sat
[2023-03-12 23:30:38] [INFO ] After 10975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:30:45] [INFO ] After 7232ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:30:48] [INFO ] After 10375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2307 ms.
[2023-03-12 23:30:50] [INFO ] After 24690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 801 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 801 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 809 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2023-03-12 23:30:52] [INFO ] Invariant cache hit.
[2023-03-12 23:30:55] [INFO ] Implicit Places using invariants in 2985 ms returned []
Implicit Place search using SMT only with invariants took 2987 ms to find 0 implicit places.
[2023-03-12 23:30:55] [INFO ] Invariant cache hit.
[2023-03-12 23:31:04] [INFO ] Dead Transitions using invariants and state equation in 9100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12902 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1483 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 401 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1215 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:31:10] [INFO ] Computed 62 place invariants in 2205 ms
[2023-03-12 23:31:12] [INFO ] Implicit Places using invariants in 4591 ms returned []
Implicit Place search using SMT only with invariants took 4602 ms to find 0 implicit places.
[2023-03-12 23:31:12] [INFO ] Invariant cache hit.
[2023-03-12 23:31:13] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6798 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 735 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:31:15] [INFO ] Invariant cache hit.
[2023-03-12 23:31:17] [INFO ] [Real]Absence check using 60 positive place invariants in 109 ms returned sat
[2023-03-12 23:31:17] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 156 ms returned sat
[2023-03-12 23:31:32] [INFO ] After 14334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2023-03-12 23:31:32] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:31:36] [INFO ] After 3566ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:31:36] [INFO ] After 20436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:31:38] [INFO ] [Nat]Absence check using 60 positive place invariants in 123 ms returned sat
[2023-03-12 23:31:38] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 118 ms returned sat
[2023-03-12 23:31:57] [INFO ] After 18089ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:32:01] [INFO ] After 4229ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:32:01] [INFO ] After 4230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:32:01] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11338 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11340 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 3 with 3661 rules applied. Total rules applied 15001 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15061 place count 3964 transition count 14579
Applied a total of 15061 rules in 7421 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14579/21960 (removed 7381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7422 ms. Remains : 3964/7923 places, 14579/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 46406 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 46406 steps, saw 28581 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2023-03-12 23:32:13] [INFO ] Computed 62 place invariants in 673 ms
[2023-03-12 23:32:14] [INFO ] [Real]Absence check using 60 positive place invariants in 50 ms returned sat
[2023-03-12 23:32:14] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-12 23:32:19] [INFO ] After 6059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:32:20] [INFO ] [Nat]Absence check using 60 positive place invariants in 46 ms returned sat
[2023-03-12 23:32:20] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 54 ms returned sat
[2023-03-12 23:32:30] [INFO ] After 10001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:32:31] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:32:43] [INFO ] After 12047ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
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.refineResultsWithTraps(DeadlockTester.java:722)
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:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:32:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:32:44] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 803 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 804 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 46189 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46189 steps, saw 28552 distinct states, run finished after 3002 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 23:32:49] [INFO ] Invariant cache hit.
[2023-03-12 23:32:50] [INFO ] [Real]Absence check using 60 positive place invariants in 33 ms returned sat
[2023-03-12 23:32:50] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 43 ms returned sat
[2023-03-12 23:32:56] [INFO ] After 6061ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 23:32:56] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:32:58] [INFO ] After 1821ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:32:58] [INFO ] After 8997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:32:59] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2023-03-12 23:32:59] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2023-03-12 23:33:11] [INFO ] After 11776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:33:19] [INFO ] After 8116ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:33:22] [INFO ] After 11453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 984 ms.
[2023-03-12 23:33:23] [INFO ] After 25107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 1048 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1050 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 870 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2023-03-12 23:33:25] [INFO ] Invariant cache hit.
[2023-03-12 23:33:29] [INFO ] Implicit Places using invariants in 3458 ms returned []
Implicit Place search using SMT only with invariants took 3461 ms to find 0 implicit places.
[2023-03-12 23:33:29] [INFO ] Invariant cache hit.
[2023-03-12 23:33:37] [INFO ] Dead Transitions using invariants and state equation in 8329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12677 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 988 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 33369 reset in 3929 ms.
Product exploration explored 100000 steps with 33319 reset in 3757 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1077 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:33:50] [INFO ] Computed 62 place invariants in 2060 ms
[2023-03-12 23:33:52] [INFO ] Implicit Places using invariants in 3546 ms returned []
Implicit Place search using SMT only with invariants took 3547 ms to find 0 implicit places.
[2023-03-12 23:33:52] [INFO ] Invariant cache hit.
[2023-03-12 23:33:52] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5540 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-10 finished in 323876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 7 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Applied a total of 11336 rules in 4206 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2023-03-12 23:33:58] [INFO ] Computed 62 place invariants in 830 ms
[2023-03-12 23:34:02] [INFO ] Implicit Places using invariants in 4283 ms returned []
Implicit Place search using SMT only with invariants took 4287 ms to find 0 implicit places.
[2023-03-12 23:34:02] [INFO ] Invariant cache hit.
[2023-03-12 23:34:09] [INFO ] Dead Transitions using invariants and state equation in 7891 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16385 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1059 1), p0:(LT s2090 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 312 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-12 finished in 16514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1078 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:34:13] [INFO ] Computed 62 place invariants in 2267 ms
[2023-03-12 23:34:14] [INFO ] Implicit Places using invariants in 3574 ms returned []
Implicit Place search using SMT only with invariants took 3583 ms to find 0 implicit places.
[2023-03-12 23:34:14] [INFO ] Invariant cache hit.
[2023-03-12 23:34:15] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5531 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s6128 1), p1:(OR (GEQ s6128 1) (GEQ s522 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1263 steps with 0 reset in 33 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-13 finished in 5743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 10 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 3877 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2023-03-12 23:34:20] [INFO ] Computed 62 place invariants in 935 ms
[2023-03-12 23:34:21] [INFO ] Implicit Places using invariants in 2005 ms returned []
Implicit Place search using SMT only with invariants took 2007 ms to find 0 implicit places.
[2023-03-12 23:34:21] [INFO ] Invariant cache hit.
[2023-03-12 23:34:29] [INFO ] Dead Transitions using invariants and state equation in 8327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14212 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1997 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 317 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-14 finished in 14317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(p1))))))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1045 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:34:33] [INFO ] Computed 62 place invariants in 1906 ms
[2023-03-12 23:34:34] [INFO ] Implicit Places using invariants in 3428 ms returned []
Implicit Place search using SMT only with invariants took 3429 ms to find 0 implicit places.
[2023-03-12 23:34:34] [INFO ] Invariant cache hit.
[2023-03-12 23:34:35] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5221 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LT s7851 1), p1:(OR (LT s26 1) (LT s595 1) (LT s833 1) (LT s3201 1))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3227 ms.
Product exploration explored 100000 steps with 25000 reset in 2744 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 82005 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82005 steps, saw 77667 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 23:34:45] [INFO ] Invariant cache hit.
[2023-03-12 23:34:46] [INFO ] [Real]Absence check using 60 positive place invariants in 126 ms returned sat
[2023-03-12 23:34:46] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 142 ms returned sat
[2023-03-12 23:35:03] [INFO ] After 16741ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 23:35:03] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:35:07] [INFO ] After 3169ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:35:07] [INFO ] After 21742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:35:08] [INFO ] [Nat]Absence check using 60 positive place invariants in 123 ms returned sat
[2023-03-12 23:35:08] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 149 ms returned sat
[2023-03-12 23:35:25] [INFO ] After 16770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:35:32] [INFO ] After 6364ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 23:35:32] [INFO ] After 6365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 23:35:32] [INFO ] After 25154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 7923 transition count 21543
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 7506 transition count 21543
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 834 place count 7506 transition count 21542
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 10 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11339 place count 3966 transition count 14578
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Partial Free-agglomeration rule applied 3660 times.
Drop transitions removed 3660 transitions
Iterating global reduction 3 with 3660 rules applied. Total rules applied 15002 place count 3963 transition count 14578
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15062 place count 3963 transition count 14578
Applied a total of 15062 rules in 6468 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6469 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14578 rows 3963 cols
[2023-03-12 23:35:39] [INFO ] Computed 62 place invariants in 604 ms
[2023-03-12 23:35:40] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-12 23:35:40] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 50 ms returned sat
[2023-03-12 23:35:45] [INFO ] After 4576ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 23:35:45] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2023-03-12 23:35:50] [INFO ] After 5322ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:35:50] [INFO ] After 10810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:35:51] [INFO ] [Nat]Absence check using 60 positive place invariants in 47 ms returned sat
[2023-03-12 23:35:51] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-12 23:35:58] [INFO ] After 6723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:36:11] [INFO ] After 12959ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:36:12] [INFO ] After 13953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 884 ms.
[2023-03-12 23:36:13] [INFO ] After 22439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 1 properties in 37 ms.
Support contains 5 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 868 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 869 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 59743 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59743 steps, saw 31504 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 23:36:17] [INFO ] Invariant cache hit.
[2023-03-12 23:36:17] [INFO ] [Real]Absence check using 60 positive place invariants in 42 ms returned sat
[2023-03-12 23:36:17] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 61 ms returned sat
[2023-03-12 23:36:24] [INFO ] After 6750ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 23:36:24] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2023-03-12 23:36:27] [INFO ] After 2438ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:36:27] [INFO ] After 9990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:36:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2023-03-12 23:36:27] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-12 23:36:34] [INFO ] After 7112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:36:45] [INFO ] After 10382ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-12 23:36:45] [INFO ] After 18134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 919 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 741 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-12 23:36:46] [INFO ] Invariant cache hit.
[2023-03-12 23:36:50] [INFO ] Implicit Places using invariants in 3380 ms returned []
Implicit Place search using SMT only with invariants took 3388 ms to find 0 implicit places.
[2023-03-12 23:36:50] [INFO ] Invariant cache hit.
[2023-03-12 23:36:57] [INFO ] Dead Transitions using invariants and state equation in 7335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11483 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1237 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:37:01] [INFO ] Computed 62 place invariants in 2107 ms
[2023-03-12 23:37:04] [INFO ] Implicit Places using invariants in 4740 ms returned []
Implicit Place search using SMT only with invariants took 4746 ms to find 0 implicit places.
[2023-03-12 23:37:04] [INFO ] Invariant cache hit.
[2023-03-12 23:37:05] [INFO ] Dead Transitions using invariants and state equation in 998 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6984 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 23:37:06] [INFO ] Invariant cache hit.
[2023-03-12 23:37:07] [INFO ] [Real]Absence check using 60 positive place invariants in 115 ms returned sat
[2023-03-12 23:37:07] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 144 ms returned sat
[2023-03-12 23:37:25] [INFO ] After 17277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 23:37:25] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:37:27] [INFO ] After 2366ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:37:27] [INFO ] After 21517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:37:28] [INFO ] [Nat]Absence check using 60 positive place invariants in 87 ms returned sat
[2023-03-12 23:37:29] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 113 ms returned sat
[2023-03-12 23:37:45] [INFO ] After 16306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:37:53] [INFO ] After 7435ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:37:53] [INFO ] After 7436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 23:37:53] [INFO ] After 25094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 7923 transition count 21543
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 7506 transition count 21543
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 834 place count 7506 transition count 21542
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 7 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11339 place count 3966 transition count 14578
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Partial Free-agglomeration rule applied 3660 times.
Drop transitions removed 3660 transitions
Iterating global reduction 3 with 3660 rules applied. Total rules applied 15002 place count 3963 transition count 14578
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15062 place count 3963 transition count 14578
Applied a total of 15062 rules in 6321 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6322 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 54960 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54960 steps, saw 30777 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 14578 rows 3963 cols
[2023-03-12 23:38:03] [INFO ] Computed 62 place invariants in 617 ms
[2023-03-12 23:38:04] [INFO ] [Real]Absence check using 60 positive place invariants in 70 ms returned sat
[2023-03-12 23:38:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 93 ms returned sat
[2023-03-12 23:38:09] [INFO ] After 4892ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 23:38:09] [INFO ] State equation strengthened by 14396 read => feed constraints.
[2023-03-12 23:38:15] [INFO ] After 5651ms SMT Verify possible using 14396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:38:15] [INFO ] After 12071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:38:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 44 ms returned sat
[2023-03-12 23:38:16] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 61 ms returned sat
[2023-03-12 23:38:22] [INFO ] After 6219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:38:32] [INFO ] After 10485ms SMT Verify possible using 14396 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 23:38:34] [INFO ] After 12211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1445 ms.
[2023-03-12 23:38:36] [INFO ] After 20716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 40 ms.
Support contains 5 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 942 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 850 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-12 23:38:37] [INFO ] Invariant cache hit.
[2023-03-12 23:38:40] [INFO ] Implicit Places using invariants in 2840 ms returned []
Implicit Place search using SMT only with invariants took 2841 ms to find 0 implicit places.
[2023-03-12 23:38:40] [INFO ] Invariant cache hit.
[2023-03-12 23:38:47] [INFO ] Dead Transitions using invariants and state equation in 6788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10483 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 2961 ms.
Product exploration explored 100000 steps with 25000 reset in 2946 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1141 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:38:58] [INFO ] Computed 62 place invariants in 2288 ms
[2023-03-12 23:38:59] [INFO ] Implicit Places using invariants in 3695 ms returned []
Implicit Place search using SMT only with invariants took 3710 ms to find 0 implicit places.
[2023-03-12 23:38:59] [INFO ] Invariant cache hit.
[2023-03-12 23:39:00] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5571 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-15 finished in 270634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
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' '!(F(G(((p0||X(!p0))&&(X(!p0)||F((p1&&X(p2))))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLFireability-10
Stuttering acceptance computed with spot in 358 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 8 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Applied a total of 11336 rules in 3693 ms. Remains 3966 /7923 variables (removed 3957) and now considering 14581/21960 (removed 7379) transitions.
// Phase 1: matrix 14581 rows 3966 cols
[2023-03-12 23:39:06] [INFO ] Computed 62 place invariants in 1073 ms
[2023-03-12 23:39:07] [INFO ] Implicit Places using invariants in 2101 ms returned []
Implicit Place search using SMT only with invariants took 2102 ms to find 0 implicit places.
[2023-03-12 23:39:07] [INFO ] Invariant cache hit.
[2023-03-12 23:39:14] [INFO ] Dead Transitions using invariants and state equation in 7737 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3966/7923 places, 14581/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13548 ms. Remains : 3966/7923 places, 14581/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s3845 1), p1:(OR (LT s107 1) (LT s163 1)), p2:(LT s3939 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33379 reset in 2923 ms.
Product exploration explored 100000 steps with 33274 reset in 2808 ms.
Computed a total of 181 stabilizing places and 300 stable transitions
Computed a total of 181 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1001 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 9) seen :5
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 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 23:39:22] [INFO ] Invariant cache hit.
[2023-03-12 23:39:23] [INFO ] [Real]Absence check using 60 positive place invariants in 51 ms returned sat
[2023-03-12 23:39:23] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-12 23:39:34] [INFO ] After 10606ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 23:39:34] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2023-03-12 23:39:36] [INFO ] After 2288ms SMT Verify possible using 10735 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:39:36] [INFO ] After 13977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:39:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 43 ms returned sat
[2023-03-12 23:39:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-12 23:39:47] [INFO ] After 9844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:39:52] [INFO ] After 4579ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:39:55] [INFO ] After 7853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2294 ms.
[2023-03-12 23:39:57] [INFO ] After 21031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3665 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 3725 place count 3964 transition count 14579
Applied a total of 3725 rules in 3161 ms. Remains 3964 /3966 variables (removed 2) and now considering 14579/14581 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3162 ms. Remains : 3964/3966 places, 14579/14581 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 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
Interrupted probabilistic random walk after 60418 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60418 steps, saw 30468 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2023-03-12 23:40:05] [INFO ] Computed 62 place invariants in 647 ms
[2023-03-12 23:40:05] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2023-03-12 23:40:05] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-12 23:40:11] [INFO ] After 6404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:40:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 45 ms returned sat
[2023-03-12 23:40:12] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 64 ms returned sat
[2023-03-12 23:40:19] [INFO ] After 6652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:40:19] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:40:31] [INFO ] After 12029ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:40:34] [INFO ] After 15372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1746 ms.
[2023-03-12 23:40:36] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 962 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 962 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 865 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2023-03-12 23:40:38] [INFO ] Invariant cache hit.
[2023-03-12 23:40:41] [INFO ] Implicit Places using invariants in 2656 ms returned []
Implicit Place search using SMT only with invariants took 2658 ms to find 0 implicit places.
[2023-03-12 23:40:41] [INFO ] Invariant cache hit.
[2023-03-12 23:40:48] [INFO ] Dead Transitions using invariants and state equation in 7476 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11003 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Graph (trivial) has 14094 edges and 3964 vertex of which 3656 / 3964 are part of one of the 2 SCC in 9 ms
Free SCC test removed 3654 places
Drop transitions removed 10439 transitions
Ensure Unique test removed 3645 transitions
Reduce isomorphic transitions removed 14084 transitions.
Graph (complete) has 858 edges and 310 vertex of which 133 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.0 ms
Discarding 177 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Drop transitions removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 133 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 179 place count 133 transition count 259
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 132 transition count 259
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 296 place count 17 transition count 87
Iterating global reduction 1 with 115 rules applied. Total rules applied 411 place count 17 transition count 87
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 468 place count 17 transition count 30
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 470 place count 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 473 place count 16 transition count 26
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 16 transition count 24
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 478 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 480 place count 13 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 13 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 483 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 484 place count 12 transition count 19
Applied a total of 484 rules in 109 ms. Remains 12 /3964 variables (removed 3952) and now considering 19/14579 (removed 14560) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 19 rows 12 cols
[2023-03-12 23:40:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 23:40:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 23:40:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:40:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 23:40:48] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:40:48] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 23:40:48] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1028 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 361 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Applied a total of 0 rules in 781 ms. Remains 3966 /3966 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
// Phase 1: matrix 14581 rows 3966 cols
[2023-03-12 23:40:52] [INFO ] Computed 62 place invariants in 1040 ms
[2023-03-12 23:40:53] [INFO ] Implicit Places using invariants in 1662 ms returned []
Implicit Place search using SMT only with invariants took 1663 ms to find 0 implicit places.
[2023-03-12 23:40:53] [INFO ] Invariant cache hit.
[2023-03-12 23:40:59] [INFO ] Dead Transitions using invariants and state equation in 6340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8789 ms. Remains : 3966/3966 places, 14581/14581 transitions.
Computed a total of 181 stabilizing places and 300 stable transitions
Computed a total of 181 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 756 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 23:41:01] [INFO ] Invariant cache hit.
[2023-03-12 23:41:01] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-12 23:41:01] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 60 ms returned sat
[2023-03-12 23:41:11] [INFO ] After 9694ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-12 23:41:11] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2023-03-12 23:41:14] [INFO ] After 2646ms SMT Verify possible using 10735 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:41:14] [INFO ] After 13470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:41:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 69 ms returned sat
[2023-03-12 23:41:15] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 73 ms returned sat
[2023-03-12 23:41:28] [INFO ] After 12118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:41:33] [INFO ] After 5042ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:41:37] [INFO ] After 9506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2133 ms.
[2023-03-12 23:41:39] [INFO ] After 25129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 27 ms.
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3665 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 3725 place count 3964 transition count 14579
Applied a total of 3725 rules in 3936 ms. Remains 3964 /3966 variables (removed 2) and now considering 14579/14581 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3936 ms. Remains : 3964/3966 places, 14579/14581 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 393 ms. (steps per millisecond=25 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 57658 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57658 steps, saw 30086 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2023-03-12 23:41:47] [INFO ] Computed 62 place invariants in 478 ms
[2023-03-12 23:41:48] [INFO ] [Real]Absence check using 60 positive place invariants in 53 ms returned sat
[2023-03-12 23:41:48] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 63 ms returned sat
[2023-03-12 23:41:53] [INFO ] After 5579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:41:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2023-03-12 23:41:53] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 57 ms returned sat
[2023-03-12 23:41:59] [INFO ] After 5587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:41:59] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:42:10] [INFO ] After 10718ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 23:42:13] [INFO ] After 13676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1797 ms.
[2023-03-12 23:42:15] [INFO ] After 22046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 1250 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 1320 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2023-03-12 23:42:18] [INFO ] Invariant cache hit.
[2023-03-12 23:42:24] [INFO ] Implicit Places using invariants in 6328 ms returned []
Implicit Place search using SMT only with invariants took 6331 ms to find 0 implicit places.
[2023-03-12 23:42:24] [INFO ] Invariant cache hit.
[2023-03-12 23:42:32] [INFO ] Dead Transitions using invariants and state equation in 8372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16030 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Graph (trivial) has 14094 edges and 3964 vertex of which 3656 / 3964 are part of one of the 2 SCC in 4 ms
Free SCC test removed 3654 places
Drop transitions removed 10439 transitions
Ensure Unique test removed 3645 transitions
Reduce isomorphic transitions removed 14084 transitions.
Graph (complete) has 858 edges and 310 vertex of which 133 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.1 ms
Discarding 177 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Drop transitions removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 133 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 179 place count 133 transition count 259
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 132 transition count 259
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 296 place count 17 transition count 87
Iterating global reduction 1 with 115 rules applied. Total rules applied 411 place count 17 transition count 87
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 468 place count 17 transition count 30
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 470 place count 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 473 place count 16 transition count 26
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 16 transition count 24
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 478 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 480 place count 13 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 13 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 483 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 484 place count 12 transition count 19
Applied a total of 484 rules in 58 ms. Remains 12 /3964 variables (removed 3952) and now considering 19/14579 (removed 14560) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 19 rows 12 cols
[2023-03-12 23:42:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 23:42:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 23:42:32] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 23:42:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 23:42:32] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 23:42:32] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 23:42:32] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1139 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 305 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 310 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 33332 reset in 2700 ms.
Product exploration explored 100000 steps with 33449 reset in 2961 ms.
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Applied a total of 0 rules in 821 ms. Remains 3966 /3966 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
// Phase 1: matrix 14581 rows 3966 cols
[2023-03-12 23:42:42] [INFO ] Computed 62 place invariants in 1063 ms
[2023-03-12 23:42:43] [INFO ] Implicit Places using invariants in 2269 ms returned []
Implicit Place search using SMT only with invariants took 2271 ms to find 0 implicit places.
[2023-03-12 23:42:43] [INFO ] Invariant cache hit.
[2023-03-12 23:42:50] [INFO ] Dead Transitions using invariants and state equation in 6952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10052 ms. Remains : 3966/3966 places, 14581/14581 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-10 finished in 230408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(p1))))))'
[2023-03-12 23:42:52] [INFO ] Flatten gal took : 508 ms
[2023-03-12 23:42:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 23:42:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7923 places, 21960 transitions and 58680 arcs took 84 ms.
Total runtime 1261855 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLFireability-00
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLFireability-04
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLFireability-10
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLFireability-15
BK_STOP 1678664642264
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-060-LTLFireability-00
ltl formula formula --ltl=/tmp/2329/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 7923 places, 21960 transitions and 58680 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 2.790 real 0.850 user 0.980 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-060-LTLFireability-04
ltl formula formula --ltl=/tmp/2329/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 7923 places, 21960 transitions and 58680 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 2.880 real 0.880 user 0.920 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_1_
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
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d1bcafa3f4]
1: pnml2lts-mc(+0xa2496) [0x55d1bcafa496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7efe0937e140]
3: pnml2lts-mc(+0x405b30) [0x55d1bce5db30]
4: pnml2lts-mc(+0x16b3f9) [0x55d1bcbc33f9]
5: pnml2lts-mc(+0x164ac4) [0x55d1bcbbcac4]
6: pnml2lts-mc(+0x272e0a) [0x55d1bcccae0a]
7: pnml2lts-mc(+0xb61f0) [0x55d1bcb0e1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7efe091d14d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7efe091d167a]
10: pnml2lts-mc(+0xa1581) [0x55d1bcaf9581]
11: pnml2lts-mc(+0xa1910) [0x55d1bcaf9910]
12: pnml2lts-mc(+0xa32a2) [0x55d1bcafb2a2]
13: pnml2lts-mc(+0xa50f4) [0x55d1bcafd0f4]
14: pnml2lts-mc(+0xa516b) [0x55d1bcafd16b]
15: pnml2lts-mc(+0x3f34b3) [0x55d1bce4b4b3]
16: pnml2lts-mc(+0x7c63d) [0x55d1bcad463d]
17: pnml2lts-mc(+0x67d86) [0x55d1bcabfd86]
18: pnml2lts-mc(+0x60a8a) [0x55d1bcab8a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d1bcab6b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7efe091b9d0a]
21: pnml2lts-mc(+0x6075e) [0x55d1bcab875e]
ltl formula name CANInsertWithFailure-PT-060-LTLFireability-10
ltl formula formula --ltl=/tmp/2329/ltl_2_
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 7923 places, 21960 transitions and 58680 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 2.920 real 0.790 user 0.970 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-060-LTLFireability-15
ltl formula formula --ltl=/tmp/2329/ltl_3_
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 7923 places, 21960 transitions and 58680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.880 real 0.720 user 1.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55591ebea3f4]
1: pnml2lts-mc(+0xa2496) [0x55591ebea496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f9db6ca8140]
3: pnml2lts-mc(+0x405be5) [0x55591ef4dbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55591ecb33f9]
5: pnml2lts-mc(+0x164ac4) [0x55591ecacac4]
6: pnml2lts-mc(+0x272e0a) [0x55591edbae0a]
7: pnml2lts-mc(+0xb61f0) [0x55591ebfe1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f9db6afb4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f9db6afb67a]
10: pnml2lts-mc(+0xa1581) [0x55591ebe9581]
11: pnml2lts-mc(+0xa1910) [0x55591ebe9910]
12: pnml2lts-mc(+0xa32a2) [0x55591ebeb2a2]
13: pnml2lts-mc(+0xa50f4) [0x55591ebed0f4]
14: pnml2lts-mc(+0xa516b) [0x55591ebed16b]
15: pnml2lts-mc(+0x3f34b3) [0x55591ef3b4b3]
16: pnml2lts-mc(+0x7c63d) [0x55591ebc463d]
17: pnml2lts-mc(+0x67d86) [0x55591ebafd86]
18: pnml2lts-mc(+0x60a8a) [0x55591eba8a8a]
19: pnml2lts-mc(+0x5eb15) [0x55591eba6b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f9db6ae3d0a]
21: pnml2lts-mc(+0x6075e) [0x55591eba875e]
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-060"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-060, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;