Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000683.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-090, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 12M 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 CANConstruction-PT-090-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678656554673

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:29:16] [INFO ] Load time of PNML (sax parser for PT used): 602 ms
[2023-03-12 21:29:16] [INFO ] Transformed 17282 places.
[2023-03-12 21:29:17] [INFO ] Transformed 33120 transitions.
[2023-03-12 21:29:17] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 826 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-090-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7899 places :
Symmetric choice reduction at 0 with 7899 rule applications. Total rules 7899 place count 9383 transition count 17322
Iterating global reduction 0 with 7899 rules applied. Total rules applied 15798 place count 9383 transition count 17322
Applied a total of 15798 rules in 6755 ms. Remains 9383 /17282 variables (removed 7899) and now considering 17322/33120 (removed 15798) transitions.
// Phase 1: matrix 17322 rows 9383 cols
[2023-03-12 21:29:24] [INFO ] Computed 181 place invariants in 240 ms
[2023-03-12 21:29:31] [INFO ] Implicit Places using invariants in 7468 ms returned []
Implicit Place search using SMT only with invariants took 7538 ms to find 0 implicit places.
[2023-03-12 21:29:31] [INFO ] Invariant cache hit.
[2023-03-12 21:29:32] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9383/17282 places, 17322/33120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15067 ms. Remains : 9383/17282 places, 17322/33120 transitions.
Support contains 46 out of 9383 places after structural reductions.
[2023-03-12 21:29:33] [INFO ] Flatten gal took : 630 ms
[2023-03-12 21:29:33] [INFO ] Flatten gal took : 491 ms
[2023-03-12 21:29:34] [INFO ] Input system was already deterministic with 17322 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 121308 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :{1=1, 21=1}
Probabilistic random walk after 121308 steps, saw 119384 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :2
Running SMT prover for 23 properties.
[2023-03-12 21:29:38] [INFO ] Invariant cache hit.
[2023-03-12 21:29:42] [INFO ] [Real]Absence check using 91 positive place invariants in 216 ms returned sat
[2023-03-12 21:29:42] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 95 ms returned sat
[2023-03-12 21:29:42] [INFO ] After 3871ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:22
[2023-03-12 21:29:46] [INFO ] [Nat]Absence check using 91 positive place invariants in 279 ms returned sat
[2023-03-12 21:29:46] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 112 ms returned sat
[2023-03-12 21:30:04] [INFO ] After 15636ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :16
[2023-03-12 21:30:04] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-12 21:30:07] [INFO ] After 3396ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :7 sat :16
[2023-03-12 21:30:07] [INFO ] After 3396ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :16
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 21:30:07] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :16
Fused 23 Parikh solutions to 15 different solutions.
Parikh walk visited 1 properties in 922 ms.
Support contains 29 out of 9383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Drop transitions removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 9383 transition count 16698
Reduce places removed 624 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 626 rules applied. Total rules applied 1250 place count 8759 transition count 16696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1252 place count 8757 transition count 16696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1252 place count 8757 transition count 16695
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1254 place count 8756 transition count 16695
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1260 place count 8750 transition count 16683
Iterating global reduction 3 with 6 rules applied. Total rules applied 1266 place count 8750 transition count 16683
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1444 place count 8661 transition count 16594
Free-agglomeration rule applied 150 times.
Iterating global reduction 3 with 150 rules applied. Total rules applied 1594 place count 8661 transition count 16444
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 1744 place count 8511 transition count 16444
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1745 place count 8511 transition count 16443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1746 place count 8510 transition count 16443
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 1777 place count 8510 transition count 16443
Applied a total of 1777 rules in 17586 ms. Remains 8510 /9383 variables (removed 873) and now considering 16443/17322 (removed 879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17589 ms. Remains : 8510/9383 places, 16443/17322 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 16443 rows 8510 cols
[2023-03-12 21:30:27] [INFO ] Computed 181 place invariants in 125 ms
[2023-03-12 21:30:29] [INFO ] After 2236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 21:30:32] [INFO ] [Nat]Absence check using 91 positive place invariants in 252 ms returned sat
[2023-03-12 21:30:32] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2023-03-12 21:30:47] [INFO ] After 13489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 21:30:47] [INFO ] State equation strengthened by 16214 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 21:30:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:30:54] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 9 properties in 58 ms.
Support contains 2 out of 8510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8510/8510 places, 16443/16443 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8510 transition count 16442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8509 transition count 16442
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 34 place count 8493 transition count 16426
Applied a total of 34 rules in 6240 ms. Remains 8493 /8510 variables (removed 17) and now considering 16426/16443 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6240 ms. Remains : 8493/8510 places, 16426/16443 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102652 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102652 steps, saw 91829 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16426 rows 8493 cols
[2023-03-12 21:31:04] [INFO ] Computed 181 place invariants in 168 ms
[2023-03-12 21:31:05] [INFO ] After 948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:31:06] [INFO ] [Nat]Absence check using 91 positive place invariants in 191 ms returned sat
[2023-03-12 21:31:06] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 121 ms returned sat
[2023-03-12 21:31:15] [INFO ] After 8982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:31:15] [INFO ] State equation strengthened by 16229 read => feed constraints.
[2023-03-12 21:31:17] [INFO ] After 1990ms SMT Verify possible using 16229 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:31:18] [INFO ] After 2853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 605 ms.
[2023-03-12 21:31:19] [INFO ] After 13961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-090-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 361 stabilizing places and 450 stable transitions
FORMULA CANConstruction-PT-090-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1281 place count 8732 transition count 16650
Iterating global reduction 2 with 21 rules applied. Total rules applied 1302 place count 8732 transition count 16650
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1482 place count 8642 transition count 16560
Applied a total of 1482 rules in 10155 ms. Remains 8642 /9383 variables (removed 741) and now considering 16560/17322 (removed 762) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2023-03-12 21:31:30] [INFO ] Computed 181 place invariants in 162 ms
[2023-03-12 21:31:31] [INFO ] Implicit Places using invariants in 968 ms returned []
Implicit Place search using SMT only with invariants took 982 ms to find 0 implicit places.
[2023-03-12 21:31:31] [INFO ] Invariant cache hit.
[2023-03-12 21:31:31] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8642/9383 places, 16560/17322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11921 ms. Remains : 8642/9383 places, 16560/17322 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6574 s6035), p1:(LEQ s4934 s3728)], 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 124 reset in 2217 ms.
Product exploration explored 100000 steps with 124 reset in 2571 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
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 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:31:37] [INFO ] Invariant cache hit.
[2023-03-12 21:31:38] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:31:39] [INFO ] [Nat]Absence check using 91 positive place invariants in 230 ms returned sat
[2023-03-12 21:31:39] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 87 ms returned sat
[2023-03-12 21:31:49] [INFO ] After 9843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:31:49] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:31:51] [INFO ] After 2226ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:31:52] [INFO ] After 3038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 796 ms.
[2023-03-12 21:31:53] [INFO ] After 15097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Free-agglomeration rule applied 180 times.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 8642 transition count 16380
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 360 place count 8462 transition count 16380
Applied a total of 360 rules in 6423 ms. Remains 8462 /8642 variables (removed 180) and now considering 16380/16560 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6424 ms. Remains : 8462/8642 places, 16380/16560 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 256 ms. (steps per millisecond=39 ) 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 102946 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102946 steps, saw 91877 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16380 rows 8462 cols
[2023-03-12 21:32:03] [INFO ] Computed 181 place invariants in 156 ms
[2023-03-12 21:32:04] [INFO ] After 911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:32:05] [INFO ] [Nat]Absence check using 91 positive place invariants in 183 ms returned sat
[2023-03-12 21:32:05] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 91 ms returned sat
[2023-03-12 21:32:14] [INFO ] After 9336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:32:15] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:32:17] [INFO ] After 2011ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:32:18] [INFO ] After 2990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 505 ms.
[2023-03-12 21:32:18] [INFO ] After 14234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3412 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3412 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3167 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
[2023-03-12 21:32:25] [INFO ] Invariant cache hit.
[2023-03-12 21:32:31] [INFO ] Implicit Places using invariants in 6464 ms returned []
Implicit Place search using SMT only with invariants took 6465 ms to find 0 implicit places.
[2023-03-12 21:32:31] [INFO ] Invariant cache hit.
[2023-03-12 21:32:41] [INFO ] Dead Transitions using invariants and state equation in 10173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19813 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Graph (trivial) has 16102 edges and 8462 vertex of which 8186 / 8462 are part of one of the 90 SCC in 7 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 819 edges and 366 vertex of which 12 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.1 ms
Discarding 354 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 12 transition count 12
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 12 transition count 12
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 8 transition count 8
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 38 ms. Remains 8 /8462 variables (removed 8454) and now considering 8/16380 (removed 16372) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-12 21:32:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 21:32:41] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:32:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 21:32:41] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:32:41] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 21:32:41] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 150 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 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 3328 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2023-03-12 21:32:45] [INFO ] Computed 181 place invariants in 115 ms
[2023-03-12 21:32:46] [INFO ] Implicit Places using invariants in 927 ms returned []
Implicit Place search using SMT only with invariants took 929 ms to find 0 implicit places.
[2023-03-12 21:32:46] [INFO ] Invariant cache hit.
[2023-03-12 21:32:57] [INFO ] Dead Transitions using invariants and state equation in 10900 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15161 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 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 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 204430 steps, run timeout after 3002 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204430 steps, saw 200789 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 21:33:01] [INFO ] Invariant cache hit.
[2023-03-12 21:33:01] [INFO ] After 905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:33:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 247 ms returned sat
[2023-03-12 21:33:03] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 115 ms returned sat
[2023-03-12 21:33:14] [INFO ] After 10548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:33:14] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:33:17] [INFO ] After 2766ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:33:19] [INFO ] After 4722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1130 ms.
[2023-03-12 21:33:20] [INFO ] After 18440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Free-agglomeration rule applied 180 times.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 8642 transition count 16380
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 360 place count 8462 transition count 16380
Applied a total of 360 rules in 6566 ms. Remains 8462 /8642 variables (removed 180) and now considering 16380/16560 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6567 ms. Remains : 8462/8642 places, 16380/16560 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 2) 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 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 97964 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97964 steps, saw 90645 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16380 rows 8462 cols
[2023-03-12 21:33:30] [INFO ] Computed 181 place invariants in 155 ms
[2023-03-12 21:33:31] [INFO ] After 995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:33:32] [INFO ] [Nat]Absence check using 91 positive place invariants in 195 ms returned sat
[2023-03-12 21:33:32] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 87 ms returned sat
[2023-03-12 21:33:42] [INFO ] After 9600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:33:42] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:33:45] [INFO ] After 2622ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:33:47] [INFO ] After 4464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1140 ms.
[2023-03-12 21:33:48] [INFO ] After 16914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 8462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3407 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3408 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3454 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
[2023-03-12 21:33:55] [INFO ] Invariant cache hit.
[2023-03-12 21:33:56] [INFO ] Implicit Places using invariants in 803 ms returned []
Implicit Place search using SMT only with invariants took 804 ms to find 0 implicit places.
[2023-03-12 21:33:56] [INFO ] Invariant cache hit.
[2023-03-12 21:34:06] [INFO ] Dead Transitions using invariants and state equation in 10674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14936 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Graph (trivial) has 16102 edges and 8462 vertex of which 8186 / 8462 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 819 edges and 366 vertex of which 12 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.0 ms
Discarding 354 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 12 transition count 12
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 12 transition count 12
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 8 transition count 8
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 23 ms. Remains 8 /8462 variables (removed 8454) and now considering 8/16380 (removed 16372) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-12 21:34:06] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 21:34:06] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:34:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 21:34:06] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:34:06] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 21:34:06] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 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 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 124 reset in 2006 ms.
Product exploration explored 100000 steps with 125 reset in 2187 ms.
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 3279 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2023-03-12 21:34:14] [INFO ] Computed 181 place invariants in 155 ms
[2023-03-12 21:34:21] [INFO ] Implicit Places using invariants in 6626 ms returned []
Implicit Place search using SMT only with invariants took 6628 ms to find 0 implicit places.
[2023-03-12 21:34:21] [INFO ] Invariant cache hit.
[2023-03-12 21:34:31] [INFO ] Dead Transitions using invariants and state equation in 10193 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20102 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-01 finished in 192543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1278 place count 8735 transition count 16656
Iterating global reduction 2 with 18 rules applied. Total rules applied 1296 place count 8735 transition count 16656
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1476 place count 8645 transition count 16566
Applied a total of 1476 rules in 9683 ms. Remains 8645 /9383 variables (removed 738) and now considering 16566/17322 (removed 756) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2023-03-12 21:34:42] [INFO ] Computed 181 place invariants in 100 ms
[2023-03-12 21:34:43] [INFO ] Implicit Places using invariants in 935 ms returned []
Implicit Place search using SMT only with invariants took 936 ms to find 0 implicit places.
[2023-03-12 21:34:43] [INFO ] Invariant cache hit.
[2023-03-12 21:34:53] [INFO ] Dead Transitions using invariants and state equation in 10275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9383 places, 16566/17322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20896 ms. Remains : 8645/9383 places, 16566/17322 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s2442 s3357), p0:(LEQ s6348 s1559)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 124 reset in 2243 ms.
Product exploration explored 100000 steps with 124 reset in 2183 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 336 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 21:34:58] [INFO ] Invariant cache hit.
[2023-03-12 21:34:59] [INFO ] After 1025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:35:00] [INFO ] [Nat]Absence check using 91 positive place invariants in 163 ms returned sat
[2023-03-12 21:35:00] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 81 ms returned sat
[2023-03-12 21:35:11] [INFO ] After 10156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:35:11] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:35:14] [INFO ] After 3220ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:35:17] [INFO ] After 6012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2226 ms.
[2023-03-12 21:35:19] [INFO ] After 20144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 21 ms.
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Free-agglomeration rule applied 174 times.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 348 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 354 place count 8471 transition count 16392
Applied a total of 354 rules in 9817 ms. Remains 8471 /8645 variables (removed 174) and now considering 16392/16566 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9817 ms. Remains : 8471/8645 places, 16392/16566 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101369 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101369 steps, saw 91437 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2023-03-12 21:35:33] [INFO ] Computed 181 place invariants in 154 ms
[2023-03-12 21:35:34] [INFO ] After 914ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:35:35] [INFO ] [Nat]Absence check using 91 positive place invariants in 175 ms returned sat
[2023-03-12 21:35:35] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 134 ms returned sat
[2023-03-12 21:35:44] [INFO ] After 9534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:35:45] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2023-03-12 21:35:47] [INFO ] After 1936ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:35:47] [INFO ] After 2889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 663 ms.
[2023-03-12 21:35:48] [INFO ] After 14589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 3424 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3425 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 3226 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
[2023-03-12 21:35:55] [INFO ] Invariant cache hit.
[2023-03-12 21:36:01] [INFO ] Implicit Places using invariants in 6461 ms returned []
Implicit Place search using SMT only with invariants took 6461 ms to find 0 implicit places.
[2023-03-12 21:36:01] [INFO ] Invariant cache hit.
[2023-03-12 21:36:12] [INFO ] Dead Transitions using invariants and state equation in 10272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19962 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Graph (trivial) has 16108 edges and 8471 vertex of which 8186 / 8471 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 834 edges and 375 vertex of which 18 are kept as prefixes of interest. Removing 357 places using SCC suffix rule.1 ms
Discarding 357 places :
Also discarding 261 output transitions
Drop transitions removed 261 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 23 ms. Remains 8 /8471 variables (removed 8463) and now considering 11/16392 (removed 16381) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2023-03-12 21:36:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 21:36:12] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:36:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 21:36:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:36:12] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 21:36:12] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 508 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), true, (NOT p1)]
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Applied a total of 0 rules in 3310 ms. Remains 8645 /8645 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2023-03-12 21:36:16] [INFO ] Computed 181 place invariants in 164 ms
[2023-03-12 21:36:22] [INFO ] Implicit Places using invariants in 6851 ms returned []
Implicit Place search using SMT only with invariants took 6852 ms to find 0 implicit places.
[2023-03-12 21:36:23] [INFO ] Invariant cache hit.
[2023-03-12 21:36:33] [INFO ] Dead Transitions using invariants and state equation in 10549 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20713 ms. Remains : 8645/8645 places, 16566/16566 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 323 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 354 ms. (steps per millisecond=28 ) 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 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 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 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 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 147873 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147873 steps, saw 145174 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 21:36:37] [INFO ] Invariant cache hit.
[2023-03-12 21:36:39] [INFO ] After 1457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:36:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 258 ms returned sat
[2023-03-12 21:36:40] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 111 ms returned sat
[2023-03-12 21:36:53] [INFO ] After 11632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:36:53] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:36:58] [INFO ] After 5067ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:37:03] [INFO ] After 10052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-12 21:37:04] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 2 properties in 45 ms.
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Free-agglomeration rule applied 174 times.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 348 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 354 place count 8471 transition count 16392
Applied a total of 354 rules in 9614 ms. Remains 8471 /8645 variables (removed 174) and now considering 16392/16566 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9615 ms. Remains : 8471/8645 places, 16392/16566 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2023-03-12 21:37:14] [INFO ] Computed 181 place invariants in 146 ms
[2023-03-12 21:37:15] [INFO ] After 1002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:37:16] [INFO ] [Nat]Absence check using 91 positive place invariants in 222 ms returned sat
[2023-03-12 21:37:16] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 90 ms returned sat
[2023-03-12 21:37:26] [INFO ] After 9706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:37:26] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2023-03-12 21:37:28] [INFO ] After 2143ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:37:29] [INFO ] After 3210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 808 ms.
[2023-03-12 21:37:30] [INFO ] After 15253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 3067 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3068 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101279 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101279 steps, saw 91437 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:37:36] [INFO ] Invariant cache hit.
[2023-03-12 21:37:37] [INFO ] After 931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:37:38] [INFO ] [Nat]Absence check using 91 positive place invariants in 237 ms returned sat
[2023-03-12 21:37:39] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2023-03-12 21:37:49] [INFO ] After 9902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:37:49] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2023-03-12 21:37:51] [INFO ] After 2016ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:37:52] [INFO ] After 2887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 756 ms.
[2023-03-12 21:37:52] [INFO ] After 15039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 3108 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3108 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 3055 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
[2023-03-12 21:37:59] [INFO ] Invariant cache hit.
[2023-03-12 21:38:05] [INFO ] Implicit Places using invariants in 6763 ms returned []
Implicit Place search using SMT only with invariants took 6764 ms to find 0 implicit places.
[2023-03-12 21:38:05] [INFO ] Invariant cache hit.
[2023-03-12 21:38:16] [INFO ] Dead Transitions using invariants and state equation in 10841 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20663 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 451 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 124 reset in 2261 ms.
Product exploration explored 100000 steps with 123 reset in 2141 ms.
Support contains 4 out of 8645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8645/8645 places, 16566/16566 transitions.
Applied a total of 0 rules in 3253 ms. Remains 8645 /8645 variables (removed 0) and now considering 16566/16566 (removed 0) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2023-03-12 21:38:25] [INFO ] Computed 181 place invariants in 164 ms
[2023-03-12 21:38:26] [INFO ] Implicit Places using invariants in 1036 ms returned []
Implicit Place search using SMT only with invariants took 1038 ms to find 0 implicit places.
[2023-03-12 21:38:26] [INFO ] Invariant cache hit.
[2023-03-12 21:38:36] [INFO ] Dead Transitions using invariants and state equation in 10619 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14912 ms. Remains : 8645/8645 places, 16566/16566 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-02 finished in 244657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p0&&X(p1))))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 9364 transition count 17284
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 9364 transition count 17284
Applied a total of 38 rules in 6997 ms. Remains 9364 /9383 variables (removed 19) and now considering 17284/17322 (removed 38) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-12 21:38:44] [INFO ] Computed 181 place invariants in 158 ms
[2023-03-12 21:38:45] [INFO ] Implicit Places using invariants in 1156 ms returned []
Implicit Place search using SMT only with invariants took 1158 ms to find 0 implicit places.
[2023-03-12 21:38:45] [INFO ] Invariant cache hit.
[2023-03-12 21:38:46] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9383 places, 17284/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9114 ms. Remains : 9364/9383 places, 17284/17322 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1535 s2060), p1:(LEQ s7334 s303)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5512 ms.
Product exploration explored 100000 steps with 50000 reset in 5577 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 10 factoid took 302 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-04 finished in 20844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 7010 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-12 21:39:05] [INFO ] Computed 181 place invariants in 161 ms
[2023-03-12 21:39:06] [INFO ] Implicit Places using invariants in 1123 ms returned []
Implicit Place search using SMT only with invariants took 1124 ms to find 0 implicit places.
[2023-03-12 21:39:06] [INFO ] Invariant cache hit.
[2023-03-12 21:39:06] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9059 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4387 s3506)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18092 steps with 11 reset in 310 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-05 finished in 9579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(G((G((X(p0) U p1))||p2)))))))'
Support contains 6 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9367 transition count 17290
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9367 transition count 17290
Applied a total of 32 rules in 6911 ms. Remains 9367 /9383 variables (removed 16) and now considering 17290/17322 (removed 32) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2023-03-12 21:39:14] [INFO ] Computed 181 place invariants in 109 ms
[2023-03-12 21:39:15] [INFO ] Implicit Places using invariants in 1033 ms returned []
Implicit Place search using SMT only with invariants took 1035 ms to find 0 implicit places.
[2023-03-12 21:39:15] [INFO ] Invariant cache hit.
[2023-03-12 21:39:16] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9367/9383 places, 17290/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8780 ms. Remains : 9367/9383 places, 17290/17322 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s6261 s4670), p1:(LEQ s4897 s4898), p0:(LEQ s2161 s7821)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 61 reset in 1763 ms.
Product exploration explored 100000 steps with 63 reset in 1817 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 338 ms. (steps per millisecond=29 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 154565 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154565 steps, saw 152141 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 21:39:24] [INFO ] Invariant cache hit.
[2023-03-12 21:39:25] [INFO ] After 1560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:39:27] [INFO ] [Nat]Absence check using 91 positive place invariants in 265 ms returned sat
[2023-03-12 21:39:27] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 139 ms returned sat
[2023-03-12 21:39:41] [INFO ] After 13114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:39:41] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-12 21:39:48] [INFO ] After 6453ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:39:50] [INFO ] After 8981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 21:39:50] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 37 ms.
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9367 transition count 16660
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8737 transition count 16660
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1440 place count 8647 transition count 16570
Free-agglomeration rule applied 170 times.
Iterating global reduction 2 with 170 rules applied. Total rules applied 1610 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 2 with 170 rules applied. Total rules applied 1780 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1790 place count 8477 transition count 16400
Applied a total of 1790 rules in 11769 ms. Remains 8477 /9367 variables (removed 890) and now considering 16400/17290 (removed 890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11769 ms. Remains : 8477/9367 places, 16400/17290 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 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
Running SMT prover for 2 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2023-03-12 21:40:03] [INFO ] Computed 181 place invariants in 149 ms
[2023-03-12 21:40:04] [INFO ] After 1100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:40:05] [INFO ] [Nat]Absence check using 91 positive place invariants in 214 ms returned sat
[2023-03-12 21:40:05] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 146 ms returned sat
[2023-03-12 21:40:16] [INFO ] After 10215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:40:16] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-12 21:40:19] [INFO ] After 2797ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:40:21] [INFO ] After 4757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1343 ms.
[2023-03-12 21:40:22] [INFO ] After 18285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2576 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2576 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 98400 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98400 steps, saw 90733 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 21:40:28] [INFO ] Invariant cache hit.
[2023-03-12 21:40:29] [INFO ] After 1030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:40:30] [INFO ] [Nat]Absence check using 91 positive place invariants in 243 ms returned sat
[2023-03-12 21:40:30] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 100 ms returned sat
[2023-03-12 21:40:40] [INFO ] After 9618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:40:40] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-12 21:40:43] [INFO ] After 2629ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:40:45] [INFO ] After 4348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1273 ms.
[2023-03-12 21:40:46] [INFO ] After 17055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2690 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2690 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2556 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-12 21:40:51] [INFO ] Invariant cache hit.
[2023-03-12 21:40:52] [INFO ] Implicit Places using invariants in 750 ms returned []
Implicit Place search using SMT only with invariants took 751 ms to find 0 implicit places.
[2023-03-12 21:40:52] [INFO ] Invariant cache hit.
[2023-03-12 21:40:53] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4194 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Graph (trivial) has 16108 edges and 8477 vertex of which 8184 / 8477 are part of one of the 90 SCC in 7 ms
Free SCC test removed 8094 places
Drop transitions removed 16098 transitions
Reduce isomorphic transitions removed 16098 transitions.
Graph (complete) has 848 edges and 383 vertex of which 28 are kept as prefixes of interest. Removing 355 places using SCC suffix rule.1 ms
Discarding 355 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 28 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 23 transition count 28
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 24 place count 23 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 18 transition count 23
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 18 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 12 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 12 transition count 17
Applied a total of 52 rules in 39 ms. Remains 12 /8477 variables (removed 8465) and now considering 17/16400 (removed 16383) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 12 cols
[2023-03-12 21:40:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 21:40:53] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:40:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 21:40:53] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:40:53] [INFO ] After 17ms 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-12 21:40:53] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Applied a total of 0 rules in 2870 ms. Remains 9367 /9367 variables (removed 0) and now considering 17290/17290 (removed 0) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2023-03-12 21:40:57] [INFO ] Computed 181 place invariants in 104 ms
[2023-03-12 21:40:57] [INFO ] Implicit Places using invariants in 958 ms returned []
Implicit Place search using SMT only with invariants took 959 ms to find 0 implicit places.
[2023-03-12 21:40:57] [INFO ] Invariant cache hit.
[2023-03-12 21:40:58] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4664 ms. Remains : 9367/9367 places, 17290/17290 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 21:40:59] [INFO ] Invariant cache hit.
[2023-03-12 21:41:00] [INFO ] After 1045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:41:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 201 ms returned sat
[2023-03-12 21:41:02] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2023-03-12 21:41:13] [INFO ] After 11201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:41:13] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-12 21:41:18] [INFO ] After 4888ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:41:21] [INFO ] After 8094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2128 ms.
[2023-03-12 21:41:23] [INFO ] After 23198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 25 ms.
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9367 transition count 16660
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8737 transition count 16660
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1440 place count 8647 transition count 16570
Free-agglomeration rule applied 170 times.
Iterating global reduction 2 with 170 rules applied. Total rules applied 1610 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 2 with 170 rules applied. Total rules applied 1780 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1790 place count 8477 transition count 16400
Applied a total of 1790 rules in 10750 ms. Remains 8477 /9367 variables (removed 890) and now considering 16400/17290 (removed 890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10750 ms. Remains : 8477/9367 places, 16400/17290 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2023-03-12 21:41:35] [INFO ] Computed 181 place invariants in 153 ms
[2023-03-12 21:41:36] [INFO ] After 928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:41:37] [INFO ] [Nat]Absence check using 91 positive place invariants in 208 ms returned sat
[2023-03-12 21:41:37] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 96 ms returned sat
[2023-03-12 21:41:46] [INFO ] After 8883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:41:46] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-12 21:41:48] [INFO ] After 2112ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:41:49] [INFO ] After 2984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 670 ms.
[2023-03-12 21:41:50] [INFO ] After 14050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 8475 transition count 16398
Applied a total of 4 rules in 4923 ms. Remains 8475 /8477 variables (removed 2) and now considering 16398/16400 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4924 ms. Remains : 8475/8477 places, 16398/16400 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 264 ms. (steps per millisecond=37 ) 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 100789 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100789 steps, saw 91347 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16398 rows 8475 cols
[2023-03-12 21:41:58] [INFO ] Computed 181 place invariants in 131 ms
[2023-03-12 21:41:59] [INFO ] After 801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:42:00] [INFO ] [Nat]Absence check using 91 positive place invariants in 215 ms returned sat
[2023-03-12 21:42:00] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 79 ms returned sat
[2023-03-12 21:42:09] [INFO ] After 8979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:42:09] [INFO ] State equation strengthened by 16207 read => feed constraints.
[2023-03-12 21:42:12] [INFO ] After 2404ms SMT Verify possible using 16207 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:42:13] [INFO ] After 3301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 660 ms.
[2023-03-12 21:42:13] [INFO ] After 14410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8475/8475 places, 16398/16398 transitions.
Applied a total of 0 rules in 2562 ms. Remains 8475 /8475 variables (removed 0) and now considering 16398/16398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2562 ms. Remains : 8475/8475 places, 16398/16398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8475/8475 places, 16398/16398 transitions.
Applied a total of 0 rules in 2469 ms. Remains 8475 /8475 variables (removed 0) and now considering 16398/16398 (removed 0) transitions.
[2023-03-12 21:42:18] [INFO ] Invariant cache hit.
[2023-03-12 21:42:19] [INFO ] Implicit Places using invariants in 777 ms returned []
Implicit Place search using SMT only with invariants took 778 ms to find 0 implicit places.
[2023-03-12 21:42:19] [INFO ] Invariant cache hit.
[2023-03-12 21:42:20] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4050 ms. Remains : 8475/8475 places, 16398/16398 transitions.
Graph (trivial) has 16112 edges and 8475 vertex of which 8188 / 8475 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8098 places
Drop transitions removed 16104 transitions
Reduce isomorphic transitions removed 16104 transitions.
Graph (complete) has 840 edges and 377 vertex of which 18 are kept as prefixes of interest. Removing 359 places using SCC suffix rule.0 ms
Discarding 359 places :
Also discarding 265 output transitions
Drop transitions removed 265 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 22 ms. Remains 8 /8475 variables (removed 8467) and now considering 11/16398 (removed 16387) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2023-03-12 21:42:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 21:42:20] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 21:42:20] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:42:20] [INFO ] After 5ms 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-12 21:42:20] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 61 reset in 1621 ms.
Product exploration explored 100000 steps with 61 reset in 1790 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 9367 transition count 17290
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 450 place count 9367 transition count 17290
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 540 place count 9367 transition count 17290
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9187 transition count 17110
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9187 transition count 17110
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 540 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 1080 place count 9187 transition count 17110
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1440 place count 8827 transition count 16750
Deduced a syphon composed of 180 places in 3 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 1800 place count 8827 transition count 16750
Deduced a syphon composed of 180 places in 3 ms
Applied a total of 1800 rules in 13274 ms. Remains 8827 /9367 variables (removed 540) and now considering 16750/17290 (removed 540) transitions.
// Phase 1: matrix 16750 rows 8827 cols
[2023-03-12 21:42:38] [INFO ] Computed 181 place invariants in 162 ms
[2023-03-12 21:42:39] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8827/9367 places, 16750/17290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14324 ms. Remains : 8827/9367 places, 16750/17290 transitions.
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Applied a total of 0 rules in 3300 ms. Remains 9367 /9367 variables (removed 0) and now considering 17290/17290 (removed 0) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2023-03-12 21:42:42] [INFO ] Computed 181 place invariants in 119 ms
[2023-03-12 21:42:43] [INFO ] Implicit Places using invariants in 1060 ms returned []
Implicit Place search using SMT only with invariants took 1061 ms to find 0 implicit places.
[2023-03-12 21:42:43] [INFO ] Invariant cache hit.
[2023-03-12 21:42:44] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5144 ms. Remains : 9367/9367 places, 17290/17290 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-06 finished in 217305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 6592 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-12 21:42:51] [INFO ] Computed 181 place invariants in 134 ms
[2023-03-12 21:42:52] [INFO ] Implicit Places using invariants in 973 ms returned []
Implicit Place search using SMT only with invariants took 974 ms to find 0 implicit places.
[2023-03-12 21:42:52] [INFO ] Invariant cache hit.
[2023-03-12 21:42:53] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8472 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s8860 s9349)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2796 steps with 1 reset in 61 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-07 finished in 8697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 6493 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-12 21:43:00] [INFO ] Computed 181 place invariants in 161 ms
[2023-03-12 21:43:01] [INFO ] Implicit Places using invariants in 1105 ms returned []
Implicit Place search using SMT only with invariants took 1106 ms to find 0 implicit places.
[2023-03-12 21:43:01] [INFO ] Invariant cache hit.
[2023-03-12 21:43:01] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8409 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 1 s9058) (LEQ s8912 s2838))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-10 finished in 8580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 6378 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-12 21:43:08] [INFO ] Computed 181 place invariants in 161 ms
[2023-03-12 21:43:09] [INFO ] Implicit Places using invariants in 1052 ms returned []
Implicit Place search using SMT only with invariants took 1053 ms to find 0 implicit places.
[2023-03-12 21:43:09] [INFO ] Invariant cache hit.
[2023-03-12 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 11079 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18513 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s6815 s984)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3824 ms.
Product exploration explored 100000 steps with 33333 reset in 3996 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-12 finished in 26584 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(p0) U p1)))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1280 place count 8733 transition count 16652
Iterating global reduction 2 with 20 rules applied. Total rules applied 1300 place count 8733 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1480 place count 8643 transition count 16562
Applied a total of 1480 rules in 8997 ms. Remains 8643 /9383 variables (removed 740) and now considering 16562/17322 (removed 760) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2023-03-12 21:43:37] [INFO ] Computed 181 place invariants in 152 ms
[2023-03-12 21:43:44] [INFO ] Implicit Places using invariants in 6599 ms returned []
Implicit Place search using SMT only with invariants took 6600 ms to find 0 implicit places.
[2023-03-12 21:43:44] [INFO ] Invariant cache hit.
[2023-03-12 21:43:45] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9383 places, 16562/17322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16414 ms. Remains : 8643/9383 places, 16562/17322 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ 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=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s6997 s5082), p1:(GT s5969 s1991)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1725 steps with 1 reset in 58 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-13 finished in 16700 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(F(p0))))))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 6428 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-12 21:43:51] [INFO ] Computed 181 place invariants in 177 ms
[2023-03-12 21:43:52] [INFO ] Implicit Places using invariants in 1091 ms returned []
Implicit Place search using SMT only with invariants took 1092 ms to find 0 implicit places.
[2023-03-12 21:43:52] [INFO ] Invariant cache hit.
[2023-03-12 21:43:53] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8444 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT s414 s5043)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 29513 steps with 172 reset in 464 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-15 finished in 9163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U 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(X(X(G(G((G((X(p0) U p1))||p2)))))))'
Found a Lengthening insensitive property : CANConstruction-PT-090-LTLCardinality-06
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1276 place count 8737 transition count 16660
Iterating global reduction 2 with 16 rules applied. Total rules applied 1292 place count 8737 transition count 16660
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1472 place count 8647 transition count 16570
Applied a total of 1472 rules in 8832 ms. Remains 8647 /9383 variables (removed 736) and now considering 16570/17322 (removed 752) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2023-03-12 21:44:04] [INFO ] Computed 181 place invariants in 169 ms
[2023-03-12 21:44:10] [INFO ] Implicit Places using invariants in 6503 ms returned []
Implicit Place search using SMT only with invariants took 6503 ms to find 0 implicit places.
[2023-03-12 21:44:10] [INFO ] Invariant cache hit.
[2023-03-12 21:44:20] [INFO ] Dead Transitions using invariants and state equation in 10156 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8647/9383 places, 16570/17322 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 25492 ms. Remains : 8647/9383 places, 16570/17322 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s5541 s3950), p1:(LEQ s4177 s4178), p0:(LEQ s1441 s7101)], 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 123 reset in 2180 ms.
Product exploration explored 100000 steps with 124 reset in 2171 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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
Running SMT prover for 2 properties.
[2023-03-12 21:44:25] [INFO ] Invariant cache hit.
[2023-03-12 21:44:26] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:44:28] [INFO ] [Nat]Absence check using 91 positive place invariants in 258 ms returned sat
[2023-03-12 21:44:28] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 106 ms returned sat
[2023-03-12 21:44:38] [INFO ] After 10090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:44:38] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:44:41] [INFO ] After 2333ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:44:43] [INFO ] After 4073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1159 ms.
[2023-03-12 21:44:44] [INFO ] After 17274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 12 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2892 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
[2023-03-12 21:44:47] [INFO ] Invariant cache hit.
[2023-03-12 21:44:54] [INFO ] Implicit Places using invariants in 6549 ms returned []
Implicit Place search using SMT only with invariants took 6549 ms to find 0 implicit places.
[2023-03-12 21:44:54] [INFO ] Invariant cache hit.
[2023-03-12 21:45:04] [INFO ] Dead Transitions using invariants and state equation in 10399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19841 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 398 ms. (steps per millisecond=25 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 153290 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153290 steps, saw 150504 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 21:45:08] [INFO ] Invariant cache hit.
[2023-03-12 21:45:09] [INFO ] After 1447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:45:11] [INFO ] [Nat]Absence check using 91 positive place invariants in 256 ms returned sat
[2023-03-12 21:45:11] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 106 ms returned sat
[2023-03-12 21:45:24] [INFO ] After 11804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:45:24] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-12 21:45:29] [INFO ] After 5162ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:45:34] [INFO ] After 9899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 406 ms.
[2023-03-12 21:45:34] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 22 ms.
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Free-agglomeration rule applied 170 times.
Iterating global reduction 0 with 170 rules applied. Total rules applied 170 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 0 with 170 rules applied. Total rules applied 340 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 350 place count 8477 transition count 16400
Applied a total of 350 rules in 9129 ms. Remains 8477 /8647 variables (removed 170) and now considering 16400/16570 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9132 ms. Remains : 8477/8647 places, 16400/16570 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 97305 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97305 steps, saw 90469 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2023-03-12 21:45:47] [INFO ] Computed 181 place invariants in 154 ms
[2023-03-12 21:45:48] [INFO ] After 1129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:45:49] [INFO ] [Nat]Absence check using 91 positive place invariants in 165 ms returned sat
[2023-03-12 21:45:50] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 136 ms returned sat
[2023-03-12 21:46:00] [INFO ] After 9911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:46:00] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-12 21:46:03] [INFO ] After 3176ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:46:06] [INFO ] After 5650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1802 ms.
[2023-03-12 21:46:07] [INFO ] After 19130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 3012 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3012 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 3046 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-12 21:46:14] [INFO ] Invariant cache hit.
[2023-03-12 21:46:14] [INFO ] Implicit Places using invariants in 833 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2023-03-12 21:46:14] [INFO ] Invariant cache hit.
[2023-03-12 21:46:15] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4656 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Graph (trivial) has 16108 edges and 8477 vertex of which 8184 / 8477 are part of one of the 90 SCC in 7 ms
Free SCC test removed 8094 places
Drop transitions removed 16098 transitions
Reduce isomorphic transitions removed 16098 transitions.
Graph (complete) has 848 edges and 383 vertex of which 28 are kept as prefixes of interest. Removing 355 places using SCC suffix rule.1 ms
Discarding 355 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 28 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 23 transition count 28
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 24 place count 23 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 18 transition count 23
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 18 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 12 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 12 transition count 17
Applied a total of 52 rules in 35 ms. Remains 12 /8477 variables (removed 8465) and now considering 17/16400 (removed 16383) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 12 cols
[2023-03-12 21:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 21:46:15] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:46:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 21:46:15] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:46:15] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 21:46:15] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 124 reset in 2062 ms.
Product exploration explored 100000 steps with 125 reset in 2122 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 3219 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2023-03-12 21:46:24] [INFO ] Computed 181 place invariants in 168 ms
[2023-03-12 21:46:35] [INFO ] Dead Transitions using invariants and state equation in 10850 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14070 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2724 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
[2023-03-12 21:46:37] [INFO ] Invariant cache hit.
[2023-03-12 21:46:44] [INFO ] Implicit Places using invariants in 6624 ms returned []
Implicit Place search using SMT only with invariants took 6624 ms to find 0 implicit places.
[2023-03-12 21:46:44] [INFO ] Invariant cache hit.
[2023-03-12 21:46:55] [INFO ] Dead Transitions using invariants and state equation in 10901 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20249 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-06 finished in 180916 ms.
[2023-03-12 21:46:56] [INFO ] Flatten gal took : 431 ms
[2023-03-12 21:46:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 21:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9383 places, 17322 transitions and 67404 arcs took 80 ms.
Total runtime 1060053 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1944/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1944/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1944/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANConstruction-PT-090-LTLCardinality-01
Could not compute solution for formula : CANConstruction-PT-090-LTLCardinality-02
Could not compute solution for formula : CANConstruction-PT-090-LTLCardinality-06

BK_STOP 1678657676517

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANConstruction-PT-090-LTLCardinality-01
ltl formula formula --ltl=/tmp/1944/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 9383 places, 17322 transitions and 67404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.210 real 0.460 user 0.780 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1944/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1944/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1944/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1944/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CANConstruction-PT-090-LTLCardinality-02
ltl formula formula --ltl=/tmp/1944/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 9383 places, 17322 transitions and 67404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.570 real 0.630 user 0.730 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1944/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1944/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1944/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1944/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name CANConstruction-PT-090-LTLCardinality-06
ltl formula formula --ltl=/tmp/1944/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 9383 places, 17322 transitions and 67404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1944/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1944/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.860 real 0.670 user 0.760 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1944/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1944/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-090, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695000683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-090.tgz
mv CANConstruction-PT-090 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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