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

--------------------
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-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678663119352

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:18:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:18:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:18:42] [INFO ] Load time of PNML (sax parser for PT used): 738 ms
[2023-03-12 23:18:42] [INFO ] Transformed 7924 places.
[2023-03-12 23:18:42] [INFO ] Transformed 21960 transitions.
[2023-03-12 23:18:42] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 1037 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 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 2297 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:18:48] [INFO ] Computed 62 place invariants in 2985 ms
[2023-03-12 23:19:02] [INFO ] Implicit Places using invariants in 16597 ms returned []
Implicit Place search using SMT only with invariants took 16648 ms to find 0 implicit places.
[2023-03-12 23:19:02] [INFO ] Invariant cache hit.
[2023-03-12 23:19:03] [INFO ] Dead Transitions using invariants and state equation in 1151 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 20135 ms. Remains : 7923/7924 places, 21960/21960 transitions.
Support contains 44 out of 7923 places after structural reductions.
[2023-03-12 23:19:04] [INFO ] Flatten gal took : 822 ms
[2023-03-12 23:19:05] [INFO ] Flatten gal took : 561 ms
[2023-03-12 23:19:06] [INFO ] Input system was already deterministic with 21960 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 27) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 23:19:07] [INFO ] Invariant cache hit.
[2023-03-12 23:19:11] [INFO ] After 4070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-12 23:19:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 408 ms returned sat
[2023-03-12 23:19:16] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 150 ms returned sat
[2023-03-12 23:19:36] [INFO ] After 16499ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2023-03-12 23:19:36] [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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 23:19:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:19:36] [INFO ] After 25188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 34 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 417 rules applied. Total rules applied 833 place count 7507 transition count 21543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 with 1 Pre rules applied. Total rules applied 834 place count 7506 transition count 21542
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3525 Post agglomeration using F-continuation condition.Transition count delta: 3525
Deduced a syphon composed of 3525 places in 20 ms
Reduce places removed 3525 places and 0 transitions.
Iterating global reduction 3 with 7050 rules applied. Total rules applied 7886 place count 3980 transition count 18017
Drop transitions removed 3408 transitions
Redundant transition composition rules discarded 3408 transitions
Iterating global reduction 3 with 3408 rules applied. Total rules applied 11294 place count 3980 transition count 14609
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11296 place count 3980 transition count 14607
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11298 place count 3978 transition count 14607
Partial Free-agglomeration rule applied 3644 times.
Drop transitions removed 3644 transitions
Iterating global reduction 4 with 3644 rules applied. Total rules applied 14942 place count 3978 transition count 14607
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 15002 place count 3978 transition count 14607
Applied a total of 15002 rules in 7859 ms. Remains 3978 /7923 variables (removed 3945) and now considering 14607/21960 (removed 7353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7861 ms. Remains : 3978/7923 places, 14607/21960 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) 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 14) 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 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) 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 13) 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 13) 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 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 14607 rows 3978 cols
[2023-03-12 23:19:46] [INFO ] Computed 62 place invariants in 771 ms
[2023-03-12 23:19:47] [INFO ] [Real]Absence check using 60 positive place invariants in 45 ms returned sat
[2023-03-12 23:19:47] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 50 ms returned sat
[2023-03-12 23:19:47] [INFO ] After 1084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 23:19:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2023-03-12 23:19:48] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 54 ms returned sat
[2023-03-12 23:19:59] [INFO ] After 10073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 23:19:59] [INFO ] State equation strengthened by 14305 read => feed constraints.
[2023-03-12 23:20:10] [INFO ] After 11061ms SMT Verify possible using 14305 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-12 23:20:12] [INFO ] After 13214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 23:20:12] [INFO ] After 25108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 172 ms.
Support contains 18 out of 3978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3978/3978 places, 14607/14607 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 3971 transition count 14600
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 23 place count 3971 transition count 14600
Applied a total of 23 rules in 2382 ms. Remains 3971 /3978 variables (removed 7) and now considering 14600/14607 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2383 ms. Remains : 3971/3978 places, 14600/14607 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 58751 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58751 steps, saw 31657 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 14600 rows 3971 cols
[2023-03-12 23:20:19] [INFO ] Computed 62 place invariants in 536 ms
[2023-03-12 23:20:20] [INFO ] [Real]Absence check using 60 positive place invariants in 51 ms returned sat
[2023-03-12 23:20:20] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-12 23:20:20] [INFO ] After 1493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 23:20:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 47 ms returned sat
[2023-03-12 23:20:22] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 61 ms returned sat
[2023-03-12 23:20:32] [INFO ] After 9514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 23:20:32] [INFO ] State equation strengthened by 14385 read => feed constraints.
[2023-03-12 23:20:45] [INFO ] After 12717ms SMT Verify possible using 14385 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-12 23:20:45] [INFO ] After 13399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:20:45] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 2 properties in 195 ms.
Support contains 14 out of 3971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3971/3971 places, 14600/14600 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3968 transition count 14597
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 3968 transition count 14597
Applied a total of 7 rules in 2175 ms. Remains 3968 /3971 variables (removed 3) and now considering 14597/14600 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2175 ms. Remains : 3968/3971 places, 14597/14600 transitions.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(((p0&&G(F(((p1&&X(p2))||G(p2))))) U p3))'
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 1034 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:20:51] [INFO ] Computed 62 place invariants in 2270 ms
[2023-03-12 23:20:52] [INFO ] Implicit Places using invariants in 3111 ms returned []
Implicit Place search using SMT only with invariants took 3113 ms to find 0 implicit places.
[2023-03-12 23:20:52] [INFO ] Invariant cache hit.
[2023-03-12 23:20:53] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4933 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s6628), p0:(LEQ s5665 s3225), p2:(GT 2 s3418), p1:(GT 2 s7503)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 69 reset in 1780 ms.
Product exploration explored 100000 steps with 69 reset in 1897 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 p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1137 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 82875 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 82875 steps, saw 77897 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 6 properties.
[2023-03-12 23:21:02] [INFO ] Invariant cache hit.
[2023-03-12 23:21:04] [INFO ] [Real]Absence check using 60 positive place invariants in 88 ms returned sat
[2023-03-12 23:21:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 121 ms returned sat
[2023-03-12 23:21:20] [INFO ] After 15607ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 23:21:20] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:21:27] [INFO ] After 7588ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-12 23:21:27] [INFO ] After 7590ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 23:21:27] [INFO ] After 25114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-12 23:21:29] [INFO ] [Nat]Absence check using 60 positive place invariants in 91 ms returned sat
[2023-03-12 23:21:29] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 125 ms returned sat
[2023-03-12 23:21:51] [INFO ] After 21479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:21:53] [INFO ] After 1583ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:21:53] [INFO ] After 1585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 23:21:53] [INFO ] After 25130ms 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 57 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 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 11 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11338 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 14996 place count 3964 transition count 14581
Applied a total of 14996 rules in 6112 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6114 ms. Remains : 3964/7923 places, 14581/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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
Interrupted probabilistic random walk after 64845 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64845 steps, saw 31023 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2023-03-12 23:22:03] [INFO ] Computed 62 place invariants in 518 ms
[2023-03-12 23:22:04] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2023-03-12 23:22:04] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-12 23:22:10] [INFO ] After 6889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:22:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 33 ms returned sat
[2023-03-12 23:22:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-12 23:22:18] [INFO ] After 7430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:22:18] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-12 23:22:25] [INFO ] After 6990ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:22:32] [INFO ] After 13754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2829 ms.
[2023-03-12 23:22:35] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 84 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 818 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 818 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 747 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-12 23:22:37] [INFO ] Invariant cache hit.
[2023-03-12 23:22:43] [INFO ] Implicit Places using invariants in 6341 ms returned []
Implicit Place search using SMT only with invariants took 6342 ms to find 0 implicit places.
[2023-03-12 23:22:43] [INFO ] Invariant cache hit.
[2023-03-12 23:22:51] [INFO ] Dead Transitions using invariants and state equation in 8038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15145 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 792 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:22:54] [INFO ] Computed 62 place invariants in 2063 ms
Could not prove EG (NOT p3)
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 1067 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:23:11] [INFO ] Invariant cache hit.
[2023-03-12 23:23:12] [INFO ] Implicit Places using invariants in 1422 ms returned []
Implicit Place search using SMT only with invariants took 1423 ms to find 0 implicit places.
[2023-03-12 23:23:12] [INFO ] Invariant cache hit.
[2023-03-12 23:23:13] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3430 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 (NOT p3) p1 p2), (X (AND p0 (NOT p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 805 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 23:23:14] [INFO ] Invariant cache hit.
[2023-03-12 23:23:16] [INFO ] [Real]Absence check using 60 positive place invariants in 119 ms returned sat
[2023-03-12 23:23:16] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 148 ms returned sat
[2023-03-12 23:23:33] [INFO ] After 16342ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-12 23:23:33] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:23:40] [INFO ] After 6624ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-12 23:23:40] [INFO ] After 6625ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 23:23:40] [INFO ] After 25074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-12 23:23:41] [INFO ] [Nat]Absence check using 60 positive place invariants in 76 ms returned sat
[2023-03-12 23:23:41] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 143 ms returned sat
[2023-03-12 23:23:57] [INFO ] After 14858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 23:24:05] [INFO ] After 7544ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:24:05] [INFO ] After 7547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 23:24:05] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 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 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11338 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 14996 place count 3964 transition count 14581
Applied a total of 14996 rules in 5718 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5721 ms. Remains : 3964/7923 places, 14581/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2023-03-12 23:24:12] [INFO ] Computed 62 place invariants in 551 ms
[2023-03-12 23:24:13] [INFO ] [Real]Absence check using 60 positive place invariants in 48 ms returned sat
[2023-03-12 23:24:13] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-12 23:24:19] [INFO ] After 7764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:24:20] [INFO ] [Nat]Absence check using 60 positive place invariants in 42 ms returned sat
[2023-03-12 23:24:20] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 59 ms returned sat
[2023-03-12 23:24:29] [INFO ] After 8419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:24:29] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-12 23:24:37] [INFO ] After 7254ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:24:44] [INFO ] After 14284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 768 ms.
[2023-03-12 23:24:45] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 93 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 961 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 962 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 448 ms. (steps per millisecond=22 ) 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
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 28 ms. (steps per millisecond=357 ) 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
Interrupted probabilistic random walk after 60908 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60908 steps, saw 30503 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 23:24:49] [INFO ] Invariant cache hit.
[2023-03-12 23:24:50] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2023-03-12 23:24:50] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-12 23:24:56] [INFO ] After 7231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:24:57] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2023-03-12 23:24:57] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-12 23:25:05] [INFO ] After 7629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:25:05] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-12 23:25:12] [INFO ] After 6712ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:25:17] [INFO ] After 11179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2892 ms.
[2023-03-12 23:25:20] [INFO ] After 23074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 931 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 767 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-12 23:25:21] [INFO ] Invariant cache hit.
[2023-03-12 23:25:24] [INFO ] Implicit Places using invariants in 2723 ms returned []
Implicit Place search using SMT only with invariants took 2725 ms to find 0 implicit places.
[2023-03-12 23:25:24] [INFO ] Invariant cache hit.
[2023-03-12 23:25:32] [INFO ] Dead Transitions using invariants and state equation in 7666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11176 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (AND p0 (NOT p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 692 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-12 23:25:35] [INFO ] Computed 62 place invariants in 2212 ms
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 68 reset in 1854 ms.
Product exploration explored 100000 steps with 69 reset in 1724 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 980 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:25:55] [INFO ] Invariant cache hit.
[2023-03-12 23:25:56] [INFO ] Implicit Places using invariants in 924 ms returned []
Implicit Place search using SMT only with invariants took 926 ms to find 0 implicit places.
[2023-03-12 23:25:56] [INFO ] Invariant cache hit.
[2023-03-12 23:25:57] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2863 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-03 finished in 309617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 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 970 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:25:59] [INFO ] Invariant cache hit.
[2023-03-12 23:26:00] [INFO ] Implicit Places using invariants in 914 ms returned []
Implicit Place search using SMT only with invariants took 932 ms to find 0 implicit places.
[2023-03-12 23:26:00] [INFO ] Invariant cache hit.
[2023-03-12 23:26:01] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2820 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4446 s654)], 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 24317 steps with 16 reset in 472 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-04 finished in 3523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&(X(p1) U ((p0&&X(p1))||X(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 935 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:26:02] [INFO ] Invariant cache hit.
[2023-03-12 23:26:03] [INFO ] Implicit Places using invariants in 901 ms returned []
Implicit Place search using SMT only with invariants took 903 ms to find 0 implicit places.
[2023-03-12 23:26:03] [INFO ] Invariant cache hit.
[2023-03-12 23:26:04] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2762 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(GT s2431 s2340), p1:(LEQ 3 s6099)], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1609 steps with 0 reset in 37 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-06 finished in 3139 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(F(p0)))))'
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 965 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:26:05] [INFO ] Invariant cache hit.
[2023-03-12 23:26:06] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 868 ms to find 0 implicit places.
[2023-03-12 23:26:06] [INFO ] Invariant cache hit.
[2023-03-12 23:26:07] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2840 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (LEQ 2 s2721) (LEQ s7360 s1693))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1523 steps with 0 reset in 30 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-08 finished in 3140 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||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 1045 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:26:09] [INFO ] Invariant cache hit.
[2023-03-12 23:26:09] [INFO ] Implicit Places using invariants in 807 ms returned []
Implicit Place search using SMT only with invariants took 816 ms to find 0 implicit places.
[2023-03-12 23:26:09] [INFO ] Invariant cache hit.
[2023-03-12 23:26:10] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2605 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-10 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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s1841 s4069), p0:(LEQ 1 s5539)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 69 reset in 1602 ms.
Product exploration explored 100000 steps with 73 reset in 1598 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 168 ms. (steps per millisecond=59 ) 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.
[2023-03-12 23:26:14] [INFO ] Invariant cache hit.
[2023-03-12 23:26:15] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:26:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 97 ms returned sat
[2023-03-12 23:26:16] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 123 ms returned sat
[2023-03-12 23:26:28] [INFO ] After 11994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:26:28] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 23:26:38] [INFO ] After 9787ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:26:39] [INFO ] After 10679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 684 ms.
[2023-03-12 23:26:40] [INFO ] After 24604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 6 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
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11343 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11344 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 15002 place count 3962 transition count 14577
Applied a total of 15002 rules in 5267 ms. Remains 3962 /7923 variables (removed 3961) and now considering 14577/21960 (removed 7383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5267 ms. Remains : 3962/7923 places, 14577/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 64332 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64332 steps, saw 30958 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2023-03-12 23:26:49] [INFO ] Computed 62 place invariants in 737 ms
[2023-03-12 23:26:49] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:26:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 52 ms returned sat
[2023-03-12 23:26:50] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 62 ms returned sat
[2023-03-12 23:26:55] [INFO ] After 5218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:26:55] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:26:59] [INFO ] After 3485ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:26:59] [INFO ] After 4356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 542 ms.
[2023-03-12 23:27:00] [INFO ] After 10814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND 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 247 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT 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 1053 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:27:04] [INFO ] Computed 62 place invariants in 2318 ms
[2023-03-12 23:27:05] [INFO ] Implicit Places using invariants in 3132 ms returned []
Implicit Place search using SMT only with invariants took 3135 ms to find 0 implicit places.
[2023-03-12 23:27:05] [INFO ] Invariant cache hit.
[2023-03-12 23:27:06] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5112 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) 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 2) seen :0
Finished probabilistic random walk after 76182 steps, run visited all 2 properties in 1469 ms. (steps per millisecond=51 )
Probabilistic random walk after 76182 steps, saw 73910 distinct states, run finished after 1470 ms. (steps per millisecond=51 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 70 reset in 1607 ms.
Product exploration explored 100000 steps with 71 reset in 1587 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT 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.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 7923 transition count 21960
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 300 place count 7923 transition count 21960
Deduced a syphon composed of 360 places in 6 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 360 place count 7923 transition count 21960
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 480 place count 7803 transition count 21840
Deduced a syphon composed of 240 places in 5 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 600 place count 7803 transition count 21840
Performed 3600 Post agglomeration using F-continuation condition.Transition count delta: -6960
Deduced a syphon composed of 3840 places in 7 ms
Iterating global reduction 1 with 3600 rules applied. Total rules applied 4200 place count 7803 transition count 28800
Discarding 240 places :
Symmetric choice reduction at 1 with 240 rule applications. Total rules 4440 place count 7563 transition count 28560
Deduced a syphon composed of 3600 places in 6 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 4680 place count 7563 transition count 28560
Deduced a syphon composed of 3600 places in 5 ms
Applied a total of 4680 rules in 6565 ms. Remains 7563 /7923 variables (removed 360) and now considering 28560/21960 (removed -6600) transitions.
[2023-03-12 23:27:18] [INFO ] Flow matrix only has 25138 transitions (discarded 3422 similar events)
// Phase 1: matrix 25138 rows 7563 cols
[2023-03-12 23:27:21] [INFO ] Computed 62 place invariants in 3051 ms
[2023-03-12 23:27:38] [INFO ] Dead Transitions using invariants and state equation in 19746 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7563/7923 places, 28560/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26327 ms. Remains : 7563/7923 places, 28560/21960 transitions.
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 1528 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:27:42] [INFO ] Computed 62 place invariants in 2289 ms
[2023-03-12 23:27:43] [INFO ] Implicit Places using invariants in 3607 ms returned []
Implicit Place search using SMT only with invariants took 3608 ms to find 0 implicit places.
[2023-03-12 23:27:43] [INFO ] Invariant cache hit.
[2023-03-12 23:27:44] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5864 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-10 finished in 96967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 6 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 1384 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:27:46] [INFO ] Invariant cache hit.
[2023-03-12 23:27:47] [INFO ] Implicit Places using invariants in 796 ms returned []
Implicit Place search using SMT only with invariants took 827 ms to find 0 implicit places.
[2023-03-12 23:27:47] [INFO ] Invariant cache hit.
[2023-03-12 23:28:01] [INFO ] Dead Transitions using invariants and state equation in 14358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16585 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 2 s2690), p0:(LEQ s5391 s707), p2:(AND (OR (LEQ 2 s2690) (LEQ s1310 s975)) (LEQ 2 s1549))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1402 steps with 0 reset in 19 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-11 finished in 16818 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)))'
Support contains 1 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 1278 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:28:03] [INFO ] Invariant cache hit.
[2023-03-12 23:28:03] [INFO ] Implicit Places using invariants in 755 ms returned []
Implicit Place search using SMT only with invariants took 782 ms to find 0 implicit places.
[2023-03-12 23:28:03] [INFO ] Invariant cache hit.
[2023-03-12 23:28:04] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2769 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s981)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-12 finished in 2920 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||((p1&&F(p2)) U G(p0))))))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1270 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-12 23:28:05] [INFO ] Invariant cache hit.
[2023-03-12 23:28:06] [INFO ] Implicit Places using invariants in 777 ms returned []
Implicit Place search using SMT only with invariants took 796 ms to find 0 implicit places.
[2023-03-12 23:28:06] [INFO ] Invariant cache hit.
[2023-03-12 23:28:07] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2775 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s6855)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1195 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-13 finished in 2919 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||G(p1)))))'
Support contains 4 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 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 3537 Post agglomeration using F-continuation condition.Transition count delta: 3537
Deduced a syphon composed of 3537 places in 9 ms
Reduce places removed 3537 places and 0 transitions.
Iterating global reduction 2 with 7074 rules applied. Total rules applied 7912 place count 3967 transition count 18004
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11332 place count 3967 transition count 14584
Applied a total of 11332 rules in 5871 ms. Remains 3967 /7923 variables (removed 3956) and now considering 14584/21960 (removed 7376) transitions.
// Phase 1: matrix 14584 rows 3967 cols
[2023-03-12 23:28:14] [INFO ] Computed 62 place invariants in 1086 ms
[2023-03-12 23:28:15] [INFO ] Implicit Places using invariants in 2266 ms returned []
Implicit Place search using SMT only with invariants took 2268 ms to find 0 implicit places.
[2023-03-12 23:28:15] [INFO ] Invariant cache hit.
[2023-03-12 23:28:23] [INFO ] Dead Transitions using invariants and state equation in 8091 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3967/7923 places, 14584/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16233 ms. Remains : 3967/7923 places, 14584/21960 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2495 s2847), p0:(LEQ s342 s1812)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 328 reset in 1877 ms.
Product exploration explored 100000 steps with 324 reset in 1805 ms.
Computed a total of 180 stabilizing places and 299 stable transitions
Computed a total of 180 stabilizing places and 299 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5378 steps, including 17 resets, run visited all 2 properties in 99 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 14584/14584 transitions.
Applied a total of 0 rules in 1025 ms. Remains 3967 /3967 variables (removed 0) and now considering 14584/14584 (removed 0) transitions.
[2023-03-12 23:28:29] [INFO ] Invariant cache hit.
[2023-03-12 23:28:30] [INFO ] Implicit Places using invariants in 942 ms returned []
Implicit Place search using SMT only with invariants took 943 ms to find 0 implicit places.
[2023-03-12 23:28:30] [INFO ] Invariant cache hit.
[2023-03-12 23:28:38] [INFO ] Dead Transitions using invariants and state equation in 7643 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9618 ms. Remains : 3967/3967 places, 14584/14584 transitions.
Computed a total of 180 stabilizing places and 299 stable transitions
Computed a total of 180 stabilizing places and 299 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3209 steps, including 10 resets, run visited all 2 properties in 84 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 326 reset in 1781 ms.
Product exploration explored 100000 steps with 329 reset in 1665 ms.
Support contains 4 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 14584/14584 transitions.
Applied a total of 0 rules in 1003 ms. Remains 3967 /3967 variables (removed 0) and now considering 14584/14584 (removed 0) transitions.
[2023-03-12 23:28:43] [INFO ] Invariant cache hit.
[2023-03-12 23:28:44] [INFO ] Implicit Places using invariants in 954 ms returned []
Implicit Place search using SMT only with invariants took 968 ms to find 0 implicit places.
[2023-03-12 23:28:44] [INFO ] Invariant cache hit.
[2023-03-12 23:28:52] [INFO ] Dead Transitions using invariants and state equation in 7661 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9636 ms. Remains : 3967/3967 places, 14584/14584 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-14 finished in 44918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(p1||X(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 1382 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:56] [INFO ] Computed 62 place invariants in 2234 ms
[2023-03-12 23:28:57] [INFO ] Implicit Places using invariants in 3574 ms returned []
Implicit Place search using SMT only with invariants took 3587 ms to find 0 implicit places.
[2023-03-12 23:28:57] [INFO ] Invariant cache hit.
[2023-03-12 23:28:58] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5693 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s1356 s4806), p1:(LEQ 1 s3897)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-15 finished in 5922 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' '!(((p0&&G(F(((p1&&X(p2))||G(p2))))) U p3))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLCardinality-03
Stuttering acceptance computed with spot in 152 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 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 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 9 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 4351 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:29:04] [INFO ] Computed 62 place invariants in 1018 ms
[2023-03-12 23:29:05] [INFO ] Implicit Places using invariants in 2116 ms returned []
Implicit Place search using SMT only with invariants took 2118 ms to find 0 implicit places.
[2023-03-12 23:29:05] [INFO ] Invariant cache hit.
[2023-03-12 23:29:13] [INFO ] Dead Transitions using invariants and state equation in 7994 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14480 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s3306), p0:(LEQ s2815 s1574), p2:(GT 2 s1672), p1:(GT 2 s3751)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 328 reset in 1949 ms.
Product exploration explored 100000 steps with 328 reset in 1905 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 : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1032 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) 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 6) 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 6) 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 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
Running SMT prover for 6 properties.
[2023-03-12 23:29:18] [INFO ] Invariant cache hit.
[2023-03-12 23:29:19] [INFO ] [Real]Absence check using 60 positive place invariants in 37 ms returned sat
[2023-03-12 23:29:19] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2023-03-12 23:29:25] [INFO ] After 6596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:29:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2023-03-12 23:29:26] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-12 23:29:33] [INFO ] After 6965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:29:33] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2023-03-12 23:29:45] [INFO ] After 11056ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:29:50] [INFO ] After 16625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 23:29:50] [INFO ] After 25103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 125 ms.
Support contains 5 out of 3965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3964 transition count 14581
Applied a total of 3660 rules in 3011 ms. Remains 3964 /3965 variables (removed 1) and now considering 14581/14582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3011 ms. Remains : 3964/3965 places, 14581/14582 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 564 ms. (steps per millisecond=17 ) 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 24 ms. (steps per millisecond=416 ) 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 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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
Interrupted probabilistic random walk after 57644 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57644 steps, saw 30058 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2023-03-12 23:29:58] [INFO ] Computed 62 place invariants in 674 ms
[2023-03-12 23:29:59] [INFO ] [Real]Absence check using 60 positive place invariants in 42 ms returned sat
[2023-03-12 23:29:59] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-12 23:30:05] [INFO ] After 7269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:30:06] [INFO ] [Nat]Absence check using 60 positive place invariants in 70 ms returned sat
[2023-03-12 23:30:06] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 69 ms returned sat
[2023-03-12 23:30:15] [INFO ] After 8118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:30:15] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-12 23:30:22] [INFO ] After 6987ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:30:29] [INFO ] After 14172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1241 ms.
[2023-03-12 23:30:30] [INFO ] After 25101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 101 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1107 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1107 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1137 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-12 23:30:32] [INFO ] Invariant cache hit.
[2023-03-12 23:30:38] [INFO ] Implicit Places using invariants in 5871 ms returned []
Implicit Place search using SMT only with invariants took 5875 ms to find 0 implicit places.
[2023-03-12 23:30:38] [INFO ] Invariant cache hit.
[2023-03-12 23:30:46] [INFO ] Dead Transitions using invariants and state equation in 7303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14319 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Graph (trivial) has 14202 edges and 3964 vertex of which 3716 / 3964 are part of one of the 2 SCC in 7 ms
Free SCC test removed 3714 places
Drop transitions removed 10668 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14320 transitions.
Graph (complete) has 623 edges and 250 vertex of which 69 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 69 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 68 transition count 80
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 10 transition count 22
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 8 transition count 17
Applied a total of 247 rules in 52 ms. Remains 8 /3964 variables (removed 3956) and now considering 17/14581 (removed 14564) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2023-03-12 23:30:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 23:30:46] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:30:46] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:30:46] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:30:46] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 815 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 14582 rows 3965 cols
[2023-03-12 23:30:48] [INFO ] Computed 62 place invariants in 1072 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 18 factoid took 386 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-03 finished in 118703 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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||G(p1)))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLCardinality-10
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 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 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 18 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 4679 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:31:03] [INFO ] Computed 62 place invariants in 1092 ms
[2023-03-12 23:31:04] [INFO ] Implicit Places using invariants in 2176 ms returned []
Implicit Place search using SMT only with invariants took 2177 ms to find 0 implicit places.
[2023-03-12 23:31:04] [INFO ] Invariant cache hit.
[2023-03-12 23:31:34] [INFO ] Performed 6457/14578 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-12 23:31:50] [INFO ] Dead Transitions using invariants and state equation in 45942 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 52802 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-10 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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s870 s2003), p0:(LEQ 1 s2750)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 335 reset in 1714 ms.
Product exploration explored 100000 steps with 332 reset in 1619 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 276 ms. (steps per millisecond=36 ) 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.
[2023-03-12 23:31:54] [INFO ] Invariant cache hit.
[2023-03-12 23:31:54] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:31:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 32 ms returned sat
[2023-03-12 23:31:55] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2023-03-12 23:32:01] [INFO ] After 5828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:32:01] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2023-03-12 23:32:06] [INFO ] After 5785ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:32:07] [INFO ] After 6453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 550 ms.
[2023-03-12 23:32:08] [INFO ] After 13464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3962 transition count 14577
Applied a total of 3660 rules in 2877 ms. Remains 3962 /3963 variables (removed 1) and now considering 14577/14578 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2877 ms. Remains : 3962/3963 places, 14577/14578 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 63696 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63696 steps, saw 30866 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14577 rows 3962 cols
[2023-03-12 23:32:14] [INFO ] Computed 62 place invariants in 741 ms
[2023-03-12 23:32:15] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:32:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2023-03-12 23:32:16] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 57 ms returned sat
[2023-03-12 23:32:21] [INFO ] After 5637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:32:21] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2023-03-12 23:32:25] [INFO ] After 3665ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 23:32:26] [INFO ] After 4488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-12 23:32:26] [INFO ] After 11347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 3962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 1090 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1090 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3962/3962 places, 14577/14577 transitions.
Applied a total of 0 rules in 980 ms. Remains 3962 /3962 variables (removed 0) and now considering 14577/14577 (removed 0) transitions.
[2023-03-12 23:32:28] [INFO ] Invariant cache hit.
[2023-03-12 23:32:31] [INFO ] Implicit Places using invariants in 2781 ms returned []
Implicit Place search using SMT only with invariants took 2783 ms to find 0 implicit places.
[2023-03-12 23:32:31] [INFO ] Invariant cache hit.
[2023-03-12 23:32:39] [INFO ] Dead Transitions using invariants and state equation in 7937 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11704 ms. Remains : 3962/3962 places, 14577/14577 transitions.
Graph (trivial) has 14206 edges and 3962 vertex of which 3716 / 3962 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3714 places
Drop transitions removed 10670 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14322 transitions.
Graph (complete) has 617 edges and 248 vertex of which 67 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 67 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 66 transition count 74
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 8 transition count 16
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 6 transition count 11
Applied a total of 247 rules in 34 ms. Remains 6 /3962 variables (removed 3956) and now considering 11/14577 (removed 14566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-12 23:32:39] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-12 23:32:39] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 23:32:39] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 23:32:39] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 23:32:39] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 782 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2023-03-12 23:32:41] [INFO ] Computed 62 place invariants in 1074 ms
[2023-03-12 23:32:43] [INFO ] Implicit Places using invariants in 2166 ms returned []
Implicit Place search using SMT only with invariants took 2168 ms to find 0 implicit places.
[2023-03-12 23:32:43] [INFO ] Invariant cache hit.
[2023-03-12 23:32:50] [INFO ] Dead Transitions using invariants and state equation in 7591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10547 ms. Remains : 3963/3963 places, 14578/14578 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 : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 57737 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57737 steps, saw 32993 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 23:32:54] [INFO ] Invariant cache hit.
[2023-03-12 23:32:54] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 23:32:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2023-03-12 23:32:55] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-12 23:33:01] [INFO ] After 6022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 23:33:01] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2023-03-12 23:33:07] [INFO ] After 6085ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 23:33:09] [INFO ] After 7518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 958 ms.
[2023-03-12 23:33:10] [INFO ] After 15361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 338 reset in 1726 ms.
Product exploration explored 100000 steps with 340 reset in 1501 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 1050 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-12 23:33:15] [INFO ] Invariant cache hit.
[2023-03-12 23:33:21] [INFO ] Dead Transitions using invariants and state equation in 6371 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7425 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 769 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-12 23:33:22] [INFO ] Invariant cache hit.
[2023-03-12 23:33:23] [INFO ] Implicit Places using invariants in 1035 ms returned []
Implicit Place search using SMT only with invariants took 1037 ms to find 0 implicit places.
[2023-03-12 23:33:23] [INFO ] Invariant cache hit.
[2023-03-12 23:33:31] [INFO ] Dead Transitions using invariants and state equation in 8004 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9812 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-10 finished in 154884 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||G(p1)))))'
[2023-03-12 23:33:32] [INFO ] Flatten gal took : 522 ms
[2023-03-12 23:33:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 23:33:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7923 places, 21960 transitions and 58680 arcs took 78 ms.
Total runtime 891064 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLCardinality-03
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLCardinality-10
Could not compute solution for formula : CANInsertWithFailure-PT-060-LTLCardinality-14

BK_STOP 1678664074273

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-060-LTLCardinality-03
ltl formula formula --ltl=/tmp/1981/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 4.100 real 0.800 user 1.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_0_
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) [0x5560ed8353f4]
1: pnml2lts-mc(+0xa2496) [0x5560ed835496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f631b684140]
3: pnml2lts-mc(+0x405be5) [0x5560edb98be5]
4: pnml2lts-mc(+0x16b3f9) [0x5560ed8fe3f9]
5: pnml2lts-mc(+0x164ac4) [0x5560ed8f7ac4]
6: pnml2lts-mc(+0x272e0a) [0x5560eda05e0a]
7: pnml2lts-mc(+0xb61f0) [0x5560ed8491f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f631b4d74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f631b4d767a]
10: pnml2lts-mc(+0xa1581) [0x5560ed834581]
11: pnml2lts-mc(+0xa1910) [0x5560ed834910]
12: pnml2lts-mc(+0xa32a2) [0x5560ed8362a2]
13: pnml2lts-mc(+0xa50f4) [0x5560ed8380f4]
14: pnml2lts-mc(+0xa516b) [0x5560ed83816b]
15: pnml2lts-mc(+0x3f34b3) [0x5560edb864b3]
16: pnml2lts-mc(+0x7c63d) [0x5560ed80f63d]
17: pnml2lts-mc(+0x67d86) [0x5560ed7fad86]
18: pnml2lts-mc(+0x60a8a) [0x5560ed7f3a8a]
19: pnml2lts-mc(+0x5eb15) [0x5560ed7f1b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f631b4bfd0a]
21: pnml2lts-mc(+0x6075e) [0x5560ed7f375e]
ltl formula name CANInsertWithFailure-PT-060-LTLCardinality-10
ltl formula formula --ltl=/tmp/1981/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( 2/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.390 real 0.650 user 0.770 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CANInsertWithFailure-PT-060-LTLCardinality-14
ltl formula formula --ltl=/tmp/1981/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 3.960 real 0.680 user 0.910 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-060, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100747"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;