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.r039-tajo-167813693000779.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 lolaxred
Input is CANInsertWithFailure-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813693000779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.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 11K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 00:39 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 60M 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-100-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678510359317

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 04:52:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 04:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:52:42] [INFO ] Load time of PNML (sax parser for PT used): 1283 ms
[2023-03-11 04:52:42] [INFO ] Transformed 21204 places.
[2023-03-11 04:52:43] [INFO ] Transformed 60600 transitions.
[2023-03-11 04:52:43] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1634 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 21204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21203 transition count 60600
Applied a total of 1 rules in 7842 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 04:53:20] [INFO ] Computed 102 place invariants in 28990 ms
[2023-03-11 04:53:23] [INFO ] Implicit Places using invariants in 31577 ms returned []
Implicit Place search using SMT only with invariants took 31605 ms to find 0 implicit places.
[2023-03-11 04:53:23] [INFO ] Invariant cache hit.
[2023-03-11 04:53:25] [INFO ] Dead Transitions using invariants and state equation in 1953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21203/21204 places, 60600/60600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41414 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 52 out of 21203 places after structural reductions.
[2023-03-11 04:53:27] [INFO ] Flatten gal took : 1747 ms
[2023-03-11 04:53:29] [INFO ] Flatten gal took : 1711 ms
[2023-03-11 04:53:32] [INFO ] Input system was already deterministic with 60600 transitions.
Support contains 50 out of 21203 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1208 ms. (steps per millisecond=8 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :0
Interrupted probabilistic random walk after 66870 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66870 steps, saw 66015 distinct states, run finished after 3006 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 31 properties.
[2023-03-11 04:53:37] [INFO ] Invariant cache hit.
[2023-03-11 04:53:50] [INFO ] [Real]Absence check using 100 positive place invariants in 280 ms returned sat
[2023-03-11 04:53:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 637 ms returned sat
[2023-03-11 04:53:51] [INFO ] After 13844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-11 04:54:05] [INFO ] [Nat]Absence check using 100 positive place invariants in 391 ms returned sat
[2023-03-11 04:54:06] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 691 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-11 04:54:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:54:16] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:31
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 21203 transition count 59903
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 20506 transition count 59902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 9881 Post agglomeration using F-continuation condition.Transition count delta: 9881
Deduced a syphon composed of 9881 places in 46 ms
Reduce places removed 9881 places and 0 transitions.
Iterating global reduction 3 with 19762 rules applied. Total rules applied 21158 place count 10624 transition count 50021
Partial Free-agglomeration rule applied 10175 times.
Drop transitions removed 10175 transitions
Iterating global reduction 3 with 10175 rules applied. Total rules applied 31333 place count 10624 transition count 50021
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 3 with 100 rules applied. Total rules applied 31433 place count 10624 transition count 50021
Applied a total of 31433 rules in 33826 ms. Remains 10624 /21203 variables (removed 10579) and now considering 50021/60600 (removed 10579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33829 ms. Remains : 10624/21203 places, 50021/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 957 ms. (steps per millisecond=10 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-11 04:54:51] [INFO ] Flow matrix only has 49998 transitions (discarded 23 similar events)
// Phase 1: matrix 49998 rows 10624 cols
[2023-03-11 04:55:00] [INFO ] Computed 102 place invariants in 9089 ms
[2023-03-11 04:55:05] [INFO ] After 4905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-11 04:55:10] [INFO ] [Nat]Absence check using 100 positive place invariants in 146 ms returned sat
[2023-03-11 04:55:10] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-11 04:55:30] [INFO ] After 15845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-11 04:55:31] [INFO ] State equation strengthened by 49414 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-11 04:55:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 04:55:31] [INFO ] After 25692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 10624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10624/10624 places, 50021/50021 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 27 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 10619 transition count 50016
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 10619 transition count 50016
Applied a total of 18 rules in 22515 ms. Remains 10619 /10624 variables (removed 5) and now considering 50016/50021 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22515 ms. Remains : 10619/10624 places, 50016/50021 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 402 stabilizing places and 700 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 28 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 17486 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-11 04:56:11] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-11 04:56:21] [INFO ] Computed 102 place invariants in 9899 ms
[2023-03-11 04:56:22] [INFO ] Implicit Places using invariants in 11007 ms returned []
Implicit Place search using SMT only with invariants took 11017 ms to find 0 implicit places.
[2023-03-11 04:56:22] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-11 04:56:22] [INFO ] Invariant cache hit.
[2023-03-11 04:56:23] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29619 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3764)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 199 reset in 4263 ms.
Product exploration explored 100000 steps with 197 reset in 4193 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 70288 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70288 steps, saw 65216 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:56:36] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-11 04:56:36] [INFO ] Invariant cache hit.
[2023-03-11 04:56:38] [INFO ] [Real]Absence check using 100 positive place invariants in 167 ms returned sat
[2023-03-11 04:56:38] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 193 ms returned sat
[2023-03-11 04:57:01] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 18816 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18819 ms. Remains : 10603/10604 places, 50000/50001 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94257 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94257 steps, saw 92217 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50000 rows 10603 cols
[2023-03-11 04:57:34] [INFO ] Computed 102 place invariants in 10589 ms
[2023-03-11 04:57:36] [INFO ] [Real]Absence check using 100 positive place invariants in 161 ms returned sat
[2023-03-11 04:57:36] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 195 ms returned sat
[2023-03-11 04:57:59] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 6605 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6606 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 5371 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-11 04:58:11] [INFO ] Invariant cache hit.
[2023-03-11 04:58:12] [INFO ] Implicit Places using invariants in 1137 ms returned []
Implicit Place search using SMT only with invariants took 1141 ms to find 0 implicit places.
[2023-03-11 04:58:13] [INFO ] Invariant cache hit.
[2023-03-11 04:58:14] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7652 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4068 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-11 04:58:18] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-11 04:58:28] [INFO ] Computed 102 place invariants in 10260 ms
[2023-03-11 04:58:29] [INFO ] Implicit Places using invariants in 11281 ms returned []
Implicit Place search using SMT only with invariants took 11286 ms to find 0 implicit places.
[2023-03-11 04:58:29] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-11 04:58:29] [INFO ] Invariant cache hit.
[2023-03-11 04:58:30] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16498 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 69533 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69533 steps, saw 65099 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:58:35] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-11 04:58:35] [INFO ] Invariant cache hit.
[2023-03-11 04:58:36] [INFO ] [Real]Absence check using 100 positive place invariants in 161 ms returned sat
[2023-03-11 04:58:36] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 189 ms returned sat
[2023-03-11 04:59:00] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 14111 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14113 ms. Remains : 10603/10604 places, 50000/50001 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 99168 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99168 steps, saw 93344 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50000 rows 10603 cols
[2023-03-11 04:59:27] [INFO ] Computed 102 place invariants in 8864 ms
[2023-03-11 04:59:28] [INFO ] [Real]Absence check using 100 positive place invariants in 161 ms returned sat
[2023-03-11 04:59:28] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 192 ms returned sat
[2023-03-11 04:59:52] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 5238 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5239 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10603/10603 places, 50000/50000 transitions.
Applied a total of 0 rules in 5688 ms. Remains 10603 /10603 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
[2023-03-11 05:00:03] [INFO ] Invariant cache hit.
[2023-03-11 05:00:04] [INFO ] Implicit Places using invariants in 1283 ms returned []
Implicit Place search using SMT only with invariants took 1286 ms to find 0 implicit places.
[2023-03-11 05:00:04] [INFO ] Invariant cache hit.
[2023-03-11 05:00:05] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8001 ms. Remains : 10603/10603 places, 50000/50000 transitions.
Graph (trivial) has 49397 edges and 10603 vertex of which 10199 / 10603 are part of one of the 2 SCC in 36 ms
Free SCC test removed 10197 places
Drop transitions removed 39499 transitions
Ensure Unique test removed 10092 transitions
Reduce isomorphic transitions removed 49591 transitions.
Graph (complete) has 1011 edges and 406 vertex of which 105 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.2 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 105 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 104 transition count 108
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 6 transition count 10
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 6 transition count 7
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 406 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 4 transition count 5
Applied a total of 407 rules in 349 ms. Remains 4 /10603 variables (removed 10599) and now considering 5/50000 (removed 49995) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2023-03-11 05:00:05] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 05:00:05] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 05:00:05] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 05:00:05] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 199 reset in 4900 ms.
Product exploration explored 100000 steps with 198 reset in 4612 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 5786 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-11 05:00:21] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-11 05:00:31] [INFO ] Computed 102 place invariants in 10008 ms
[2023-03-11 05:00:32] [INFO ] Implicit Places using invariants in 10979 ms returned []
Implicit Place search using SMT only with invariants took 10998 ms to find 0 implicit places.
[2023-03-11 05:00:32] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-11 05:00:32] [INFO ] Invariant cache hit.
[2023-03-11 05:00:33] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17636 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-01 finished in 281442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G((F(p1)&&F(p2)))))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6099 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:01:04] [INFO ] Computed 102 place invariants in 22066 ms
[2023-03-11 05:01:05] [INFO ] Implicit Places using invariants in 23728 ms returned []
Implicit Place search using SMT only with invariants took 23761 ms to find 0 implicit places.
[2023-03-11 05:01:05] [INFO ] Invariant cache hit.
[2023-03-11 05:01:07] [INFO ] Dead Transitions using invariants and state equation in 1534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31398 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 s20212), p1:(LEQ s5790 s6935), p2:(LEQ 3 s19191)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-02 finished in 32201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 23 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 16490 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-11 05:01:24] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-11 05:01:33] [INFO ] Computed 102 place invariants in 9240 ms
[2023-03-11 05:01:34] [INFO ] Implicit Places using invariants in 10284 ms returned []
Implicit Place search using SMT only with invariants took 10290 ms to find 0 implicit places.
[2023-03-11 05:01:34] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:01:34] [INFO ] Invariant cache hit.
[2023-03-11 05:01:35] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28019 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-03 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:(GT 3 s3501), p0:(GT s3925 s10165)], 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 198 reset in 5022 ms.
Product exploration explored 100000 steps with 198 reset in 5037 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 260 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 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 70466 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70466 steps, saw 65250 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:01:50] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:01:50] [INFO ] Invariant cache hit.
[2023-03-11 05:01:52] [INFO ] [Real]Absence check using 100 positive place invariants in 156 ms returned sat
[2023-03-11 05:01:52] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-11 05:01:52] [INFO ] After 1986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:01:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-11 05:01:54] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 223 ms returned sat
[2023-03-11 05:02:17] [INFO ] After 22816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:02:17] [INFO ] State equation strengthened by 29896 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:02:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:02:17] [INFO ] After 25384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 13429 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13431 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97919 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97919 steps, saw 93147 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:02:34] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2023-03-11 05:02:46] [INFO ] Computed 102 place invariants in 11472 ms
[2023-03-11 05:02:48] [INFO ] [Real]Absence check using 100 positive place invariants in 156 ms returned sat
[2023-03-11 05:02:48] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 242 ms returned sat
[2023-03-11 05:02:48] [INFO ] After 2077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:02:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-11 05:02:50] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 187 ms returned sat
[2023-03-11 05:03:13] [INFO ] After 22914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:03:14] [INFO ] State equation strengthened by 49694 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:03:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:03:14] [INFO ] After 25747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 5064 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5064 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4718 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-11 05:03:24] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-11 05:03:24] [INFO ] Invariant cache hit.
[2023-03-11 05:03:24] [INFO ] Implicit Places using invariants in 972 ms returned []
Implicit Place search using SMT only with invariants took 987 ms to find 0 implicit places.
[2023-03-11 05:03:25] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-11 05:03:25] [INFO ] Invariant cache hit.
[2023-03-11 05:03:25] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6571 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49389 edges and 10604 vertex of which 10198 / 10604 are part of one of the 2 SCC in 21 ms
Free SCC test removed 10196 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10093 transitions
Reduce isomorphic transitions removed 49586 transitions.
Graph (complete) has 1017 edges and 408 vertex of which 107 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.0 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 106 transition count 114
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 8 transition count 16
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 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 403 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 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 406 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 407 place count 6 transition count 11
Applied a total of 407 rules in 223 ms. Remains 6 /10604 variables (removed 10598) and now considering 11/50001 (removed 49990) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-11 05:03:26] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 05:03:26] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:03:26] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:03:26] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 05:03:26] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 4156 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-11 05:03:30] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-11 05:03:40] [INFO ] Computed 102 place invariants in 9528 ms
[2023-03-11 05:03:41] [INFO ] Implicit Places using invariants in 10766 ms returned []
Implicit Place search using SMT only with invariants took 10769 ms to find 0 implicit places.
[2023-03-11 05:03:41] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:03:41] [INFO ] Invariant cache hit.
[2023-03-11 05:03:42] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15964 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 383 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 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71317 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71317 steps, saw 65347 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:03:47] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:03:47] [INFO ] Invariant cache hit.
[2023-03-11 05:03:48] [INFO ] [Real]Absence check using 100 positive place invariants in 143 ms returned sat
[2023-03-11 05:03:48] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-11 05:03:48] [INFO ] After 1771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:03:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 163 ms returned sat
[2023-03-11 05:03:50] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 193 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:04:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:04:13] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 1 with 10100 rules applied. Total rules applied 10102 place count 10604 transition count 50001
Applied a total of 10102 rules in 14342 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14343 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 96179 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96179 steps, saw 92856 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:04:31] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
// Phase 1: matrix 50000 rows 10604 cols
[2023-03-11 05:04:40] [INFO ] Computed 102 place invariants in 8909 ms
[2023-03-11 05:04:42] [INFO ] [Real]Absence check using 100 positive place invariants in 164 ms returned sat
[2023-03-11 05:04:42] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 247 ms returned sat
[2023-03-11 05:04:42] [INFO ] After 2009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:04:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 144 ms returned sat
[2023-03-11 05:04:44] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 181 ms returned sat
[2023-03-11 05:05:07] [INFO ] After 22987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:05:08] [INFO ] State equation strengthened by 49694 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:05:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:05:08] [INFO ] After 25626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4524 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4524 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4570 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-11 05:05:17] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-11 05:05:17] [INFO ] Invariant cache hit.
[2023-03-11 05:05:18] [INFO ] Implicit Places using invariants in 1116 ms returned []
Implicit Place search using SMT only with invariants took 1117 ms to find 0 implicit places.
[2023-03-11 05:05:18] [INFO ] Flow matrix only has 50000 transitions (discarded 1 similar events)
[2023-03-11 05:05:18] [INFO ] Invariant cache hit.
[2023-03-11 05:05:19] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6836 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49389 edges and 10604 vertex of which 10198 / 10604 are part of one of the 2 SCC in 22 ms
Free SCC test removed 10196 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10093 transitions
Reduce isomorphic transitions removed 49586 transitions.
Graph (complete) has 1017 edges and 408 vertex of which 107 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 106 transition count 114
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 8 transition count 16
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 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 403 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 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 406 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 407 place count 6 transition count 11
Applied a total of 407 rules in 246 ms. Remains 6 /10604 variables (removed 10598) and now considering 11/50001 (removed 49990) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 6 cols
[2023-03-11 05:05:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 05:05:20] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:05:20] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:05:20] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 05:05:20] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 288 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 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 197 reset in 4983 ms.
Product exploration explored 100000 steps with 198 reset in 5476 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 4359 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-11 05:05:35] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-11 05:05:45] [INFO ] Computed 102 place invariants in 9586 ms
[2023-03-11 05:05:46] [INFO ] Implicit Places using invariants in 10846 ms returned []
Implicit Place search using SMT only with invariants took 10847 ms to find 0 implicit places.
[2023-03-11 05:05:46] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:05:46] [INFO ] Invariant cache hit.
[2023-03-11 05:05:47] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16346 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-03 finished in 281728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||X(F((p1&&F(p2)))))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 34 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 15121 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-11 05:06:04] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-11 05:06:13] [INFO ] Computed 102 place invariants in 9225 ms
[2023-03-11 05:06:15] [INFO ] Implicit Places using invariants in 10315 ms returned []
Implicit Place search using SMT only with invariants took 10330 ms to find 0 implicit places.
[2023-03-11 05:06:15] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:06:15] [INFO ] Invariant cache hit.
[2023-03-11 05:06:15] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26292 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 3 s2964), p2:(LEQ s9485 s5763), p1:(LEQ 3 s8585)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 483 steps with 0 reset in 26 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-04 finished in 26720 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&&(p1 U p2))))'
Support contains 6 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4407 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:06:41] [INFO ] Computed 102 place invariants in 20522 ms
[2023-03-11 05:06:42] [INFO ] Implicit Places using invariants in 22121 ms returned []
Implicit Place search using SMT only with invariants took 22149 ms to find 0 implicit places.
[2023-03-11 05:06:42] [INFO ] Invariant cache hit.
[2023-03-11 05:06:44] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28142 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(GT s8491 s5011), p1:(LEQ s1561 s9306), p0:(LEQ s14748 s5353)], 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 2650 steps with 0 reset in 101 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-05 finished in 28551 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)||X((X(G(p2))||F(p3)||p1)))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5006 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-11 05:06:49] [INFO ] Invariant cache hit.
[2023-03-11 05:06:51] [INFO ] Implicit Places using invariants in 2002 ms returned []
Implicit Place search using SMT only with invariants took 2016 ms to find 0 implicit places.
[2023-03-11 05:06:51] [INFO ] Invariant cache hit.
[2023-03-11 05:06:53] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8676 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s7406), p1:(OR (LEQ 3 s14294) (LEQ s18922 s14766)), p3:(LEQ s18922 s14766), p2:(LEQ 3 s14294)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 94610 steps with 31428 reset in 10001 ms.
Product exploration timeout after 98010 steps with 32627 reset in 10007 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 5) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:07:15] [INFO ] Invariant cache hit.
[2023-03-11 05:07:18] [INFO ] [Real]Absence check using 100 positive place invariants in 282 ms returned sat
[2023-03-11 05:07:19] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 651 ms returned sat
[2023-03-11 05:07:19] [INFO ] After 4500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:07:22] [INFO ] [Nat]Absence check using 100 positive place invariants in 295 ms returned sat
[2023-03-11 05:07:23] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 621 ms returned sat
[2023-03-11 05:07:44] [INFO ] After 20852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:07:45] [INFO ] State equation strengthened by 19900 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:07:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:07:45] [INFO ] After 25343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 42 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21193 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31295 place count 10606 transition count 50003
Applied a total of 31295 rules in 25872 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25874 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97430 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97430 steps, saw 93059 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-11 05:08:24] [INFO ] Computed 102 place invariants in 9830 ms
[2023-03-11 05:08:25] [INFO ] [Real]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-11 05:08:26] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 220 ms returned sat
[2023-03-11 05:08:26] [INFO ] After 1758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:08:28] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-11 05:08:28] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-11 05:08:51] [INFO ] After 22752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:08:52] [INFO ] State equation strengthened by 49692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:08:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:08:52] [INFO ] After 25912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5370 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5371 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5345 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-11 05:09:02] [INFO ] Invariant cache hit.
[2023-03-11 05:09:04] [INFO ] Implicit Places using invariants in 1093 ms returned []
Implicit Place search using SMT only with invariants took 1097 ms to find 0 implicit places.
[2023-03-11 05:09:04] [INFO ] Invariant cache hit.
[2023-03-11 05:09:05] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7442 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p3) (NOT p1)))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4676 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:09:32] [INFO ] Computed 102 place invariants in 22256 ms
[2023-03-11 05:09:34] [INFO ] Implicit Places using invariants in 24224 ms returned []
Implicit Place search using SMT only with invariants took 24225 ms to find 0 implicit places.
[2023-03-11 05:09:34] [INFO ] Invariant cache hit.
[2023-03-11 05:09:36] [INFO ] Dead Transitions using invariants and state equation in 1992 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30903 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 79803 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79803 steps, saw 78760 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 05:09:41] [INFO ] Invariant cache hit.
[2023-03-11 05:09:45] [INFO ] [Real]Absence check using 100 positive place invariants in 250 ms returned sat
[2023-03-11 05:09:46] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 634 ms returned sat
[2023-03-11 05:09:46] [INFO ] After 5029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:09:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 288 ms returned sat
[2023-03-11 05:09:51] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 631 ms returned sat
[2023-03-11 05:10:11] [INFO ] After 18878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:10:11] [INFO ] State equation strengthened by 19900 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:10:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:10:11] [INFO ] After 25313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 22 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21193 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31295 place count 10606 transition count 50003
Applied a total of 31295 rules in 26561 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26562 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 77531 steps, run timeout after 3004 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77531 steps, saw 75870 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-11 05:10:52] [INFO ] Computed 102 place invariants in 10053 ms
[2023-03-11 05:10:54] [INFO ] [Real]Absence check using 100 positive place invariants in 122 ms returned sat
[2023-03-11 05:10:54] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-11 05:10:54] [INFO ] After 2397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:10:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-11 05:10:57] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 220 ms returned sat
[2023-03-11 05:11:19] [INFO ] After 21713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:11:20] [INFO ] State equation strengthened by 49692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:11:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:11:20] [INFO ] After 25826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4965 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4966 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4709 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-11 05:11:30] [INFO ] Invariant cache hit.
[2023-03-11 05:11:31] [INFO ] Implicit Places using invariants in 943 ms returned []
Implicit Place search using SMT only with invariants took 958 ms to find 0 implicit places.
[2023-03-11 05:11:31] [INFO ] Invariant cache hit.
[2023-03-11 05:11:32] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6766 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration timeout after 91870 steps with 30530 reset in 10003 ms.
Product exploration timeout after 96330 steps with 32229 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 32 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 18 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 9996 Post agglomeration using F-continuation condition.Transition count delta: -19592
Deduced a syphon composed of 10396 places in 25 ms
Iterating global reduction 1 with 9996 rules applied. Total rules applied 10996 place count 21003 transition count 79992
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11396 place count 20603 transition count 79592
Deduced a syphon composed of 9996 places in 18 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11796 place count 20603 transition count 79592
Deduced a syphon composed of 9996 places in 15 ms
Applied a total of 11796 rules in 35628 ms. Remains 20603 /21203 variables (removed 600) and now considering 79592/60600 (removed -18992) transitions.
[2023-03-11 05:12:29] [INFO ] Flow matrix only has 69894 transitions (discarded 9698 similar events)
// Phase 1: matrix 69894 rows 20603 cols
[2023-03-11 05:12:49] [INFO ] Computed 102 place invariants in 20392 ms
[2023-03-11 05:12:51] [INFO ] Dead Transitions using invariants and state equation in 22415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79592/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58050 ms. Remains : 20603/21203 places, 79592/60600 transitions.
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4686 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:13:14] [INFO ] Computed 102 place invariants in 17838 ms
[2023-03-11 05:13:16] [INFO ] Implicit Places using invariants in 19966 ms returned []
Implicit Place search using SMT only with invariants took 19971 ms to find 0 implicit places.
[2023-03-11 05:13:16] [INFO ] Invariant cache hit.
[2023-03-11 05:13:18] [INFO ] Dead Transitions using invariants and state equation in 2166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26831 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-07 finished in 395417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0||F(G(p1)))))))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6419 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-11 05:13:26] [INFO ] Invariant cache hit.
[2023-03-11 05:13:28] [INFO ] Implicit Places using invariants in 2014 ms returned []
Implicit Place search using SMT only with invariants took 2016 ms to find 0 implicit places.
[2023-03-11 05:13:28] [INFO ] Invariant cache hit.
[2023-03-11 05:13:30] [INFO ] Dead Transitions using invariants and state equation in 2011 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10455 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(LEQ 1 s11305), p1:(GT s7659 s1554)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2268 steps with 0 reset in 127 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-09 finished in 11202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(G(!p0))||X(p2))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4748 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-11 05:13:36] [INFO ] Invariant cache hit.
[2023-03-11 05:13:38] [INFO ] Implicit Places using invariants in 2098 ms returned []
Implicit Place search using SMT only with invariants took 2101 ms to find 0 implicit places.
[2023-03-11 05:13:38] [INFO ] Invariant cache hit.
[2023-03-11 05:13:39] [INFO ] Dead Transitions using invariants and state equation in 1641 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8494 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), p0]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ 3 s15135), p1:(LEQ 2 s18032), p2:(LEQ 1 s9719)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39 reset in 3719 ms.
Product exploration explored 100000 steps with 40 reset in 4403 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167448 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167448 steps, saw 165167 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:13:52] [INFO ] Invariant cache hit.
[2023-03-11 05:13:55] [INFO ] [Real]Absence check using 100 positive place invariants in 258 ms returned sat
[2023-03-11 05:13:55] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 453 ms returned sat
[2023-03-11 05:14:17] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 37 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21201 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 3 with 10100 rules applied. Total rules applied 31302 place count 10602 transition count 49999
Applied a total of 31302 rules in 25147 ms. Remains 10602 /21203 variables (removed 10601) and now considering 49999/60600 (removed 10601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25148 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99431 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99431 steps, saw 93378 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:14:46] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
// Phase 1: matrix 49998 rows 10602 cols
[2023-03-11 05:14:55] [INFO ] Computed 102 place invariants in 9257 ms
[2023-03-11 05:14:57] [INFO ] [Real]Absence check using 100 positive place invariants in 112 ms returned sat
[2023-03-11 05:14:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 160 ms returned sat
[2023-03-11 05:15:20] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 4852 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4852 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 5620 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2023-03-11 05:15:31] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-11 05:15:31] [INFO ] Invariant cache hit.
[2023-03-11 05:15:32] [INFO ] Implicit Places using invariants in 1124 ms returned []
Implicit Place search using SMT only with invariants took 1125 ms to find 0 implicit places.
[2023-03-11 05:15:32] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-11 05:15:32] [INFO ] Invariant cache hit.
[2023-03-11 05:15:33] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8099 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 217 ms :[true, p0, p0, p0, p0]
Support contains 1 out of 21203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4327 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:15:58] [INFO ] Computed 102 place invariants in 19663 ms
[2023-03-11 05:16:00] [INFO ] Implicit Places using invariants in 21723 ms returned []
Implicit Place search using SMT only with invariants took 21725 ms to find 0 implicit places.
[2023-03-11 05:16:00] [INFO ] Invariant cache hit.
[2023-03-11 05:16:02] [INFO ] Dead Transitions using invariants and state equation in 2161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28223 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145951 steps, run timeout after 3002 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145951 steps, saw 143971 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:16:07] [INFO ] Invariant cache hit.
[2023-03-11 05:16:09] [INFO ] [Real]Absence check using 100 positive place invariants in 264 ms returned sat
[2023-03-11 05:16:10] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 452 ms returned sat
[2023-03-11 05:16:32] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 30 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21201 place count 10603 transition count 49999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21202 place count 10602 transition count 49999
Partial Free-agglomeration rule applied 10100 times.
Drop transitions removed 10100 transitions
Iterating global reduction 3 with 10100 rules applied. Total rules applied 31302 place count 10602 transition count 49999
Applied a total of 31302 rules in 24524 ms. Remains 10602 /21203 variables (removed 10601) and now considering 49999/60600 (removed 10601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24526 ms. Remains : 10602/21203 places, 49999/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100426 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100426 steps, saw 93508 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:17:00] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
// Phase 1: matrix 49998 rows 10602 cols
[2023-03-11 05:17:09] [INFO ] Computed 102 place invariants in 8946 ms
[2023-03-11 05:17:10] [INFO ] [Real]Absence check using 100 positive place invariants in 111 ms returned sat
[2023-03-11 05:17:10] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 166 ms returned sat
[2023-03-11 05:17:34] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 4697 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4697 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10602/10602 places, 49999/49999 transitions.
Applied a total of 0 rules in 4724 ms. Remains 10602 /10602 variables (removed 0) and now considering 49999/49999 (removed 0) transitions.
[2023-03-11 05:17:43] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-11 05:17:43] [INFO ] Invariant cache hit.
[2023-03-11 05:17:44] [INFO ] Implicit Places using invariants in 961 ms returned []
Implicit Place search using SMT only with invariants took 965 ms to find 0 implicit places.
[2023-03-11 05:17:44] [INFO ] Flow matrix only has 49998 transitions (discarded 1 similar events)
[2023-03-11 05:17:44] [INFO ] Invariant cache hit.
[2023-03-11 05:17:45] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6841 ms. Remains : 10602/10602 places, 49999/49999 transitions.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 216 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 219 ms :[true, p0, p0, p0, p0]
Product exploration explored 100000 steps with 39 reset in 3301 ms.
Product exploration explored 100000 steps with 39 reset in 3292 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[true, p0, p0, p0, p0]
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 18 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 19 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: -19600
Deduced a syphon composed of 10400 places in 24 ms
Iterating global reduction 1 with 10000 rules applied. Total rules applied 11000 place count 21003 transition count 80000
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11400 place count 20603 transition count 79600
Deduced a syphon composed of 10000 places in 13 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11800 place count 20603 transition count 79600
Deduced a syphon composed of 10000 places in 15 ms
Applied a total of 11800 rules in 32417 ms. Remains 20603 /21203 variables (removed 600) and now considering 79600/60600 (removed -19000) transitions.
[2023-03-11 05:18:25] [INFO ] Flow matrix only has 69898 transitions (discarded 9702 similar events)
// Phase 1: matrix 69898 rows 20603 cols
[2023-03-11 05:18:47] [INFO ] Computed 102 place invariants in 21672 ms
[2023-03-11 05:18:49] [INFO ] Dead Transitions using invariants and state equation in 23741 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79600/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56166 ms. Remains : 20603/21203 places, 79600/60600 transitions.
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4813 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:19:13] [INFO ] Computed 102 place invariants in 19200 ms
[2023-03-11 05:19:15] [INFO ] Implicit Places using invariants in 21221 ms returned []
Implicit Place search using SMT only with invariants took 21222 ms to find 0 implicit places.
[2023-03-11 05:19:15] [INFO ] Invariant cache hit.
[2023-03-11 05:19:17] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27846 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-10 finished in 347755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21203 transition count 59901
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20504 transition count 59901
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 29 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 16604 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-11 05:19:35] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
// Phase 1: matrix 40299 rows 10604 cols
[2023-03-11 05:19:45] [INFO ] Computed 102 place invariants in 9759 ms
[2023-03-11 05:19:46] [INFO ] Implicit Places using invariants in 11000 ms returned []
Implicit Place search using SMT only with invariants took 11001 ms to find 0 implicit places.
[2023-03-11 05:19:46] [INFO ] Flow matrix only has 40299 transitions (discarded 9702 similar events)
[2023-03-11 05:19:46] [INFO ] Invariant cache hit.
[2023-03-11 05:19:48] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28817 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-12 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}]], initial=1, aps=[p0:(LEQ s2611 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 24150 steps with 48 reset in 1119 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-12 finished in 30150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4060 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-11 05:20:12] [INFO ] Computed 102 place invariants in 18670 ms
[2023-03-11 05:20:14] [INFO ] Implicit Places using invariants in 20696 ms returned []
Implicit Place search using SMT only with invariants took 20699 ms to find 0 implicit places.
[2023-03-11 05:20:14] [INFO ] Invariant cache hit.
[2023-03-11 05:20:16] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26617 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-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:(AND (LEQ 2 s14960) (GT 3 s9185))], 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 2354 steps with 0 reset in 96 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-13 finished in 27003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 20 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 15282 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-11 05:20:31] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-11 05:20:41] [INFO ] Computed 102 place invariants in 9563 ms
[2023-03-11 05:20:42] [INFO ] Implicit Places using invariants in 10800 ms returned []
Implicit Place search using SMT only with invariants took 10801 ms to find 0 implicit places.
[2023-03-11 05:20:42] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:20:42] [INFO ] Invariant cache hit.
[2023-03-11 05:21:13] [INFO ] Performed 46638/50002 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-11 05:21:15] [INFO ] Dead Transitions using invariants and state equation in 33251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59338 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8342 s3443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 198 reset in 4659 ms.
Product exploration explored 100000 steps with 198 reset in 4828 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72273 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72273 steps, saw 65533 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:21:29] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:21:29] [INFO ] Invariant cache hit.
[2023-03-11 05:21:30] [INFO ] After 1048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:21:31] [INFO ] [Nat]Absence check using 100 positive place invariants in 101 ms returned sat
[2023-03-11 05:21:31] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 157 ms returned sat
[2023-03-11 05:21:55] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10604 transition count 50001
Applied a total of 10103 rules in 13465 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13466 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100334 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100334 steps, saw 93499 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2023-03-11 05:22:21] [INFO ] Computed 102 place invariants in 8630 ms
[2023-03-11 05:22:22] [INFO ] After 1345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:22:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-11 05:22:24] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 176 ms returned sat
[2023-03-11 05:22:47] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4387 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4387 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4370 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-11 05:22:56] [INFO ] Invariant cache hit.
[2023-03-11 05:22:57] [INFO ] Implicit Places using invariants in 950 ms returned []
Implicit Place search using SMT only with invariants took 951 ms to find 0 implicit places.
[2023-03-11 05:22:57] [INFO ] Invariant cache hit.
[2023-03-11 05:22:58] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6255 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Graph (trivial) has 49394 edges and 10604 vertex of which 10199 / 10604 are part of one of the 2 SCC in 24 ms
Free SCC test removed 10197 places
Drop transitions removed 39497 transitions
Ensure Unique test removed 10092 transitions
Reduce isomorphic transitions removed 49589 transitions.
Graph (complete) has 1014 edges and 407 vertex of which 106 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.1 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 106 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 105 transition count 111
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 7 transition count 13
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 7 transition count 10
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 406 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 5 transition count 8
Applied a total of 407 rules in 229 ms. Remains 5 /10604 variables (removed 10599) and now considering 8/50001 (removed 49993) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 05:22:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 05:22:58] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:22:58] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:22:58] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 05:22:58] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 4253 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-11 05:23:03] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-11 05:23:12] [INFO ] Computed 102 place invariants in 9172 ms
[2023-03-11 05:23:13] [INFO ] Implicit Places using invariants in 10408 ms returned []
Implicit Place search using SMT only with invariants took 10409 ms to find 0 implicit places.
[2023-03-11 05:23:13] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:23:13] [INFO ] Invariant cache hit.
[2023-03-11 05:23:14] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15911 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 7301 steps, including 14 resets, run visited all 1 properties in 574 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 198 reset in 4551 ms.
Product exploration explored 100000 steps with 198 reset in 4468 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 4164 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-11 05:23:29] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:23:29] [INFO ] Invariant cache hit.
[2023-03-11 05:23:30] [INFO ] Implicit Places using invariants in 1125 ms returned []
Implicit Place search using SMT only with invariants took 1127 ms to find 0 implicit places.
[2023-03-11 05:23:30] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-11 05:23:30] [INFO ] Invariant cache hit.
[2023-03-11 05:23:31] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6467 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-14 finished in 196772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(((p1 U p2)&&(!p1 U (p3||G(!p1)))))))'
Support contains 7 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 40 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 16063 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2023-03-11 05:23:49] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2023-03-11 05:23:58] [INFO ] Computed 102 place invariants in 9448 ms
[2023-03-11 05:23:59] [INFO ] Implicit Places using invariants in 10523 ms returned []
Implicit Place search using SMT only with invariants took 10524 ms to find 0 implicit places.
[2023-03-11 05:23:59] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2023-03-11 05:23:59] [INFO ] Invariant cache hit.
[2023-03-11 05:24:00] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27592 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) (NOT p2) (AND p1 (NOT p3))), (NOT p0), (NOT p0), (OR (NOT p2) (AND p1 (NOT p3))), (NOT p2), (AND p1 (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s852 s8369), p2:(LEQ s8093 s731), p1:(LEQ s5991 s706), p3:(AND (GT 1 s1093) (GT s5991 s706))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 514 steps with 0 reset in 36 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-15 finished in 28154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((X(G(p2))||F(p3)||p1)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-100-LTLCardinality-07
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9896 Post agglomeration using F-continuation condition.Transition count delta: 9896
Deduced a syphon composed of 9896 places in 34 ms
Reduce places removed 9896 places and 0 transitions.
Iterating global reduction 2 with 19792 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Applied a total of 21192 rules in 15539 ms. Remains 10607 /21203 variables (removed 10596) and now considering 50004/60600 (removed 10596) transitions.
[2023-03-11 05:24:17] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-11 05:24:26] [INFO ] Computed 102 place invariants in 9316 ms
[2023-03-11 05:24:28] [INFO ] Implicit Places using invariants in 10572 ms returned []
Implicit Place search using SMT only with invariants took 10573 ms to find 0 implicit places.
[2023-03-11 05:24:28] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-11 05:24:28] [INFO ] Invariant cache hit.
[2023-03-11 05:24:29] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10607/21203 places, 50004/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 27258 ms. Remains : 10607/21203 places, 50004/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s3635), p1:(OR (LEQ 3 s7115) (LEQ s9454 s7354)), p3:(LEQ s9454 s7354), p2:(LEQ 3 s7115)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33366 reset in 8343 ms.
Product exploration explored 100000 steps with 33284 reset in 7331 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68945 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68945 steps, saw 65021 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 05:24:49] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-11 05:24:49] [INFO ] Invariant cache hit.
[2023-03-11 05:24:51] [INFO ] [Real]Absence check using 100 positive place invariants in 153 ms returned sat
[2023-03-11 05:24:51] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 221 ms returned sat
[2023-03-11 05:24:51] [INFO ] After 2372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:24:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 141 ms returned sat
[2023-03-11 05:24:54] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 220 ms returned sat
[2023-03-11 05:25:17] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10606 transition count 50003
Applied a total of 10103 rules in 13046 ms. Remains 10606 /10607 variables (removed 1) and now considering 50003/50004 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13048 ms. Remains : 10606/10607 places, 50003/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 94893 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94893 steps, saw 92624 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-11 05:25:42] [INFO ] Computed 102 place invariants in 8249 ms
[2023-03-11 05:25:44] [INFO ] [Real]Absence check using 100 positive place invariants in 152 ms returned sat
[2023-03-11 05:25:44] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 225 ms returned sat
[2023-03-11 05:25:44] [INFO ] After 2538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:25:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 142 ms returned sat
[2023-03-11 05:25:46] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 217 ms returned sat
[2023-03-11 05:26:09] [INFO ] After 21865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:26:10] [INFO ] State equation strengthened by 49692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-11 05:26:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:26:10] [INFO ] After 25519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4642 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4642 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 4723 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-11 05:26:19] [INFO ] Invariant cache hit.
[2023-03-11 05:26:20] [INFO ] Implicit Places using invariants in 1072 ms returned []
Implicit Place search using SMT only with invariants took 1079 ms to find 0 implicit places.
[2023-03-11 05:26:20] [INFO ] Invariant cache hit.
[2023-03-11 05:26:21] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6835 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Graph (trivial) has 49388 edges and 10606 vertex of which 10199 / 10606 are part of one of the 2 SCC in 23 ms
Free SCC test removed 10197 places
Drop transitions removed 39493 transitions
Ensure Unique test removed 10092 transitions
Reduce isomorphic transitions removed 49585 transitions.
Graph (complete) has 1020 edges and 409 vertex of which 108 are kept as prefixes of interest. Removing 301 places using SCC suffix rule.3 ms
Discarding 301 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 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 202 rules applied. Total rules applied 204 place count 108 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 107 transition count 117
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 303 place count 9 transition count 19
Iterating global reduction 2 with 98 rules applied. Total rules applied 401 place count 9 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 9 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 9 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 7 transition count 14
Applied a total of 407 rules in 231 ms. Remains 7 /10606 variables (removed 10599) and now considering 14/50003 (removed 49989) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 14 rows 7 cols
[2023-03-11 05:26:21] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 05:26:21] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:26:22] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 05:26:22] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 05:26:22] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 3973 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-11 05:26:26] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-11 05:26:35] [INFO ] Computed 102 place invariants in 8999 ms
[2023-03-11 05:26:38] [INFO ] Implicit Places using invariants in 11308 ms returned []
Implicit Place search using SMT only with invariants took 11309 ms to find 0 implicit places.
[2023-03-11 05:26:38] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-11 05:26:38] [INFO ] Invariant cache hit.
[2023-03-11 05:26:38] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16131 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 281 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 69659 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69659 steps, saw 65132 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 05:26:43] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-11 05:26:43] [INFO ] Invariant cache hit.
[2023-03-11 05:26:45] [INFO ] [Real]Absence check using 100 positive place invariants in 146 ms returned sat
[2023-03-11 05:26:45] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 261 ms returned sat
[2023-03-11 05:26:46] [INFO ] After 2525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:26:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-11 05:26:48] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 220 ms returned sat
[2023-03-11 05:27:11] [INFO ] After 21662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:27:11] [INFO ] State equation strengthened by 29894 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-11 05:27:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:27:11] [INFO ] After 25392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10607 transition count 50003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10606 transition count 50003
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10606 transition count 50003
Applied a total of 10103 rules in 13417 ms. Remains 10606 /10607 variables (removed 1) and now considering 50003/50004 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13419 ms. Remains : 10606/10607 places, 50003/50004 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 90264 steps, run timeout after 3002 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90264 steps, saw 88289 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50003 rows 10606 cols
[2023-03-11 05:27:38] [INFO ] Computed 102 place invariants in 9293 ms
[2023-03-11 05:27:40] [INFO ] [Real]Absence check using 100 positive place invariants in 147 ms returned sat
[2023-03-11 05:27:40] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 214 ms returned sat
[2023-03-11 05:27:40] [INFO ] After 2614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:27:42] [INFO ] [Nat]Absence check using 100 positive place invariants in 144 ms returned sat
[2023-03-11 05:27:43] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 212 ms returned sat
[2023-03-11 05:28:05] [INFO ] After 21754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:28:06] [INFO ] State equation strengthened by 49692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-11 05:28:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:28:06] [INFO ] After 25596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5053 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5054 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 5016 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-11 05:28:16] [INFO ] Invariant cache hit.
[2023-03-11 05:28:17] [INFO ] Implicit Places using invariants in 1078 ms returned []
Implicit Place search using SMT only with invariants took 1079 ms to find 0 implicit places.
[2023-03-11 05:28:17] [INFO ] Invariant cache hit.
[2023-03-11 05:28:48] [INFO ] Performed 47080/50003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-11 05:28:50] [INFO ] Dead Transitions using invariants and state equation in 33023 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39127 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 33409 reset in 8029 ms.
Product exploration explored 100000 steps with 33260 reset in 7942 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 3943 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-11 05:29:11] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
// Phase 1: matrix 40306 rows 10607 cols
[2023-03-11 05:29:21] [INFO ] Computed 102 place invariants in 9445 ms
[2023-03-11 05:29:22] [INFO ] Dead Transitions using invariants and state equation in 10634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14582 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Support contains 4 out of 10607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10607/10607 places, 50004/50004 transitions.
Applied a total of 0 rules in 3915 ms. Remains 10607 /10607 variables (removed 0) and now considering 50004/50004 (removed 0) transitions.
[2023-03-11 05:29:26] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-11 05:29:26] [INFO ] Invariant cache hit.
[2023-03-11 05:29:27] [INFO ] Implicit Places using invariants in 981 ms returned []
Implicit Place search using SMT only with invariants took 982 ms to find 0 implicit places.
[2023-03-11 05:29:27] [INFO ] Flow matrix only has 40306 transitions (discarded 9698 similar events)
[2023-03-11 05:29:27] [INFO ] Invariant cache hit.
[2023-03-11 05:29:28] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6015 ms. Remains : 10607/10607 places, 50004/50004 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-07 finished in 328360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(G(!p0))||X(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-11 05:29:31] [INFO ] Flatten gal took : 1077 ms
[2023-03-11 05:29:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 05:29:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21203 places, 60600 transitions and 161800 arcs took 172 ms.
Total runtime 2210204 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-100
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

BK_STOP 1678512899694

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:527
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 86 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 91 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 96 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 101 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 106 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 111 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 116 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 0 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 121 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 126 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 131 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 136 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 141 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 146 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 151 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 156 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 161 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 166 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 171 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 176 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 181 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 186 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 191 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 196 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 201 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 206 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 211 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 216 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 221 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 226 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 231 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 236 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 241 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 246 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 251 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 256 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 261 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 266 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 271 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 276 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 281 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 286 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 292 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 298 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 303 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 308 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 313 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 318 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-100-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-100-LTLCardinality-14: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 323 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 2068 Killed lola --conf=$BIN_DIR/configfiles/ltlcardinalityconf --formula=$DIR/LTLCardinality.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANInsertWithFailure-PT-100, 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 r039-tajo-167813693000779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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