fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r231-tall-167856416700907
Last Updated
May 14, 2023

About the Execution of LoLa+red for MultiCrashLeafsetExtension-PT-S32C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2856.991 238576.00 279281.00 5868.30 TFTTTFTTFTFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416700907.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is MultiCrashLeafsetExtension-PT-S32C04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416700907
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 15K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 03:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M 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 MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679511356655

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 18:55:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 18:55:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:55:59] [INFO ] Load time of PNML (sax parser for PT used): 794 ms
[2023-03-22 18:55:59] [INFO ] Transformed 18180 places.
[2023-03-22 18:55:59] [INFO ] Transformed 28411 transitions.
[2023-03-22 18:55:59] [INFO ] Parsed PT model containing 18180 places and 28411 transitions and 115534 arcs in 997 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 18180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18180/18180 places, 28411/28411 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 18137 transition count 28411
Applied a total of 43 rules in 2099 ms. Remains 18137 /18180 variables (removed 43) and now considering 28411/28411 (removed 0) transitions.
[2023-03-22 18:56:03] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18137 cols
[2023-03-22 18:56:05] [INFO ] Computed 1430 place invariants in 2446 ms
[2023-03-22 18:56:08] [INFO ] Implicit Places using invariants in 4995 ms returned []
Implicit Place search using SMT only with invariants took 6577 ms to find 0 implicit places.
[2023-03-22 18:56:08] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2023-03-22 18:56:08] [INFO ] Invariant cache hit.
[2023-03-22 18:56:09] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 18137/18180 places, 28411/28411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10190 ms. Remains : 18137/18180 places, 28411/28411 transitions.
Support contains 46 out of 18137 places after structural reductions.
[2023-03-22 18:56:11] [INFO ] Flatten gal took : 1014 ms
[2023-03-22 18:56:12] [INFO ] Flatten gal took : 766 ms
[2023-03-22 18:56:13] [INFO ] Input system was already deterministic with 28411 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 33) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :2
Running SMT prover for 23 properties.
[2023-03-22 18:56:15] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2023-03-22 18:56:15] [INFO ] Invariant cache hit.
[2023-03-22 18:56:22] [INFO ] After 7171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-22 18:56:29] [INFO ] [Nat]Absence check using 63 positive place invariants in 306 ms returned sat
[2023-03-22 18:56:30] [INFO ] [Nat]Absence check using 63 positive and 1367 generalized place invariants in 1093 ms returned sat
[2023-03-22 18:56:47] [INFO ] After 14526ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :9
[2023-03-22 18:56:47] [INFO ] State equation strengthened by 9154 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 18:56:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 18:56:47] [INFO ] After 25164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 19 out of 18137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18137/18137 places, 28411/28411 transitions.
Graph (complete) has 65901 edges and 18137 vertex of which 18136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.70 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4213 transitions
Trivial Post-agglo rules discarded 4213 transitions
Performed 4213 trivial Post agglomeration. Transition count delta: 4213
Iterating post reduction 0 with 4213 rules applied. Total rules applied 4214 place count 18136 transition count 24198
Reduce places removed 4213 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 4218 rules applied. Total rules applied 8432 place count 13923 transition count 24193
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 8437 place count 13918 transition count 24193
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 264 Pre rules applied. Total rules applied 8437 place count 13918 transition count 23929
Deduced a syphon composed of 264 places in 23 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 8965 place count 13654 transition count 23929
Discarding 3949 places :
Symmetric choice reduction at 3 with 3949 rule applications. Total rules 12914 place count 9705 transition count 19980
Iterating global reduction 3 with 3949 rules applied. Total rules applied 16863 place count 9705 transition count 19980
Discarding 978 places :
Symmetric choice reduction at 3 with 978 rule applications. Total rules 17841 place count 8727 transition count 16068
Iterating global reduction 3 with 978 rules applied. Total rules applied 18819 place count 8727 transition count 16068
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 18885 place count 8694 transition count 16035
Free-agglomeration rule (complex) applied 585 times.
Iterating global reduction 3 with 585 rules applied. Total rules applied 19470 place count 8694 transition count 18339
Reduce places removed 585 places and 0 transitions.
Iterating post reduction 3 with 585 rules applied. Total rules applied 20055 place count 8109 transition count 18339
Partial Free-agglomeration rule applied 264 times.
Drop transitions removed 264 transitions
Iterating global reduction 4 with 264 rules applied. Total rules applied 20319 place count 8109 transition count 18339
Applied a total of 20319 rules in 12436 ms. Remains 8109 /18137 variables (removed 10028) and now considering 18339/28411 (removed 10072) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12445 ms. Remains : 8109/18137 places, 18339/28411 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-22 18:57:01] [INFO ] Flow matrix only has 16774 transitions (discarded 1565 similar events)
// Phase 1: matrix 16774 rows 8109 cols
[2023-03-22 18:57:01] [INFO ] Computed 1429 place invariants in 774 ms
[2023-03-22 18:57:03] [INFO ] After 1537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 18:57:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 107 ms returned sat
[2023-03-22 18:57:05] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 510 ms returned sat
[2023-03-22 18:57:24] [INFO ] After 17850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 18:57:24] [INFO ] State equation strengthened by 9109 read => feed constraints.
[2023-03-22 18:57:28] [INFO ] After 3912ms SMT Verify possible using 9109 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 18:57:28] [INFO ] After 3913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 18:57:28] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 59 ms.
Support contains 17 out of 8109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8109/8109 places, 18339/18339 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 8109 transition count 18338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8108 transition count 18338
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8108 transition count 18336
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 8106 transition count 18336
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 8105 transition count 18335
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 8105 transition count 18335
Applied a total of 8 rules in 5147 ms. Remains 8105 /8109 variables (removed 4) and now considering 18335/18339 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5148 ms. Remains : 8105/8109 places, 18335/18339 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 18:57:34] [INFO ] Flow matrix only has 16770 transitions (discarded 1565 similar events)
// Phase 1: matrix 16770 rows 8105 cols
[2023-03-22 18:57:35] [INFO ] Computed 1429 place invariants in 825 ms
[2023-03-22 18:57:37] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 18:57:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 126 ms returned sat
[2023-03-22 18:57:39] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 529 ms returned sat
[2023-03-22 18:57:56] [INFO ] After 16861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 18:57:56] [INFO ] State equation strengthened by 9109 read => feed constraints.
[2023-03-22 18:58:02] [INFO ] After 5245ms SMT Verify possible using 9109 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 18:58:02] [INFO ] After 5247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 18:58:02] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 12 ms.
Support contains 13 out of 8105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8105/8105 places, 18335/18335 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 8105 transition count 18334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8104 transition count 18334
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 8104 transition count 18331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 8101 transition count 18331
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 8098 transition count 18328
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 8098 transition count 18328
Applied a total of 14 rules in 4959 ms. Remains 8098 /8105 variables (removed 7) and now considering 18328/18335 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4959 ms. Remains : 8098/8105 places, 18328/18335 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12121 stabilizing places and 16442 stable transitions
Graph (complete) has 85803 edges and 18137 vertex of which 18136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.140 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C04-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' '!(X((G(X((X(p0) U p1)))&&p2)))'
Support contains 5 out of 18137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18137/18137 places, 28411/28411 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18136 transition count 28411
Applied a total of 1 rules in 1573 ms. Remains 18136 /18137 variables (removed 1) and now considering 28411/28411 (removed 0) transitions.
[2023-03-22 18:58:09] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18136 cols
[2023-03-22 18:58:11] [INFO ] Computed 1429 place invariants in 2180 ms
[2023-03-22 18:58:12] [INFO ] Implicit Places using invariants in 3660 ms returned []
Implicit Place search using SMT only with invariants took 3661 ms to find 0 implicit places.
[2023-03-22 18:58:12] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2023-03-22 18:58:12] [INFO ] Invariant cache hit.
[2023-03-22 18:58:14] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 18136/18137 places, 28411/28411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6661 ms. Remains : 18136/18137 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s5432 s4189), p1:(LEQ 1 s1636), p0:(LEQ s10205 s2601)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-01 finished in 7172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Support contains 4 out of 18137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18137/18137 places, 28411/28411 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18136 transition count 28411
Applied a total of 1 rules in 1511 ms. Remains 18136 /18137 variables (removed 1) and now considering 28411/28411 (removed 0) transitions.
[2023-03-22 18:58:16] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2023-03-22 18:58:16] [INFO ] Invariant cache hit.
[2023-03-22 18:58:17] [INFO ] Implicit Places using invariants in 1473 ms returned []
Implicit Place search using SMT only with invariants took 1474 ms to find 0 implicit places.
[2023-03-22 18:58:17] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2023-03-22 18:58:17] [INFO ] Invariant cache hit.
[2023-03-22 18:58:19] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 18136/18137 places, 28411/28411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4433 ms. Remains : 18136/18137 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s16156 s17335), p1:(LEQ s12265 s218)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 77280 steps with 38640 reset in 10001 ms.
Product exploration timeout after 79250 steps with 39625 reset in 10002 ms.
Computed a total of 12120 stabilizing places and 16442 stable transitions
Computed a total of 12120 stabilizing places and 16442 stable transitions
Detected a total of 12120/18136 stabilizing places and 16442/28411 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-02 finished in 24900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 18137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18137/18137 places, 28411/28411 transitions.
Graph (complete) has 85803 edges and 18137 vertex of which 18136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.71 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4222 transitions
Trivial Post-agglo rules discarded 4222 transitions
Performed 4222 trivial Post agglomeration. Transition count delta: 4222
Iterating post reduction 0 with 4222 rules applied. Total rules applied 4223 place count 18136 transition count 24189
Reduce places removed 4222 places and 0 transitions.
Iterating post reduction 1 with 4222 rules applied. Total rules applied 8445 place count 13914 transition count 24189
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8445 place count 13914 transition count 23925
Deduced a syphon composed of 264 places in 18 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8973 place count 13650 transition count 23925
Discarding 3958 places :
Symmetric choice reduction at 2 with 3958 rule applications. Total rules 12931 place count 9692 transition count 19967
Iterating global reduction 2 with 3958 rules applied. Total rules applied 16889 place count 9692 transition count 19967
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16889 place count 9692 transition count 19961
Deduced a syphon composed of 6 places in 43 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16901 place count 9686 transition count 19961
Discarding 987 places :
Symmetric choice reduction at 2 with 987 rule applications. Total rules 17888 place count 8699 transition count 16013
Iterating global reduction 2 with 987 rules applied. Total rules applied 18875 place count 8699 transition count 16013
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 18941 place count 8666 transition count 15980
Applied a total of 18941 rules in 11030 ms. Remains 8666 /18137 variables (removed 9471) and now considering 15980/28411 (removed 12431) transitions.
[2023-03-22 18:58:50] [INFO ] Flow matrix only has 14924 transitions (discarded 1056 similar events)
// Phase 1: matrix 14924 rows 8666 cols
[2023-03-22 18:58:51] [INFO ] Computed 1429 place invariants in 714 ms
[2023-03-22 18:58:52] [INFO ] Implicit Places using invariants in 1506 ms returned []
Implicit Place search using SMT only with invariants took 1511 ms to find 0 implicit places.
[2023-03-22 18:58:52] [INFO ] Flow matrix only has 14924 transitions (discarded 1056 similar events)
[2023-03-22 18:58:52] [INFO ] Invariant cache hit.
[2023-03-22 18:58:52] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8666/18137 places, 15980/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13307 ms. Remains : 8666/18137 places, 15980/28411 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5488 s5609), p1:(GT 1 s1772), p2:(AND (GT 1 s1772) (NOT (OR (LEQ 1 s1772) (LEQ 2 s6470))))], 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 3281 reset in 1838 ms.
Product exploration explored 100000 steps with 3276 reset in 1782 ms.
Computed a total of 2683 stabilizing places and 4044 stable transitions
Computed a total of 2683 stabilizing places and 4044 stable transitions
Detected a total of 2683/8666 stabilizing places and 4044/15980 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:58:57] [INFO ] Flow matrix only has 14924 transitions (discarded 1056 similar events)
[2023-03-22 18:58:57] [INFO ] Invariant cache hit.
[2023-03-22 18:58:58] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:58:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 142 ms returned sat
[2023-03-22 18:58:59] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 532 ms returned sat
[2023-03-22 18:58:59] [INFO ] After 1484ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))
Knowledge based reduction with 9 factoid took 2894 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-03 finished in 23029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 18137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18137/18137 places, 28411/28411 transitions.
Graph (complete) has 85803 edges and 18137 vertex of which 18136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4224 transitions
Trivial Post-agglo rules discarded 4224 transitions
Performed 4224 trivial Post agglomeration. Transition count delta: 4224
Iterating post reduction 0 with 4224 rules applied. Total rules applied 4225 place count 18136 transition count 24187
Reduce places removed 4224 places and 0 transitions.
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8449 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8449 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 21 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8977 place count 13648 transition count 23923
Discarding 3960 places :
Symmetric choice reduction at 2 with 3960 rule applications. Total rules 12937 place count 9688 transition count 19963
Iterating global reduction 2 with 3960 rules applied. Total rules applied 16897 place count 9688 transition count 19963
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16897 place count 9688 transition count 19955
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 16913 place count 9680 transition count 19955
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 17903 place count 8690 transition count 15995
Iterating global reduction 2 with 990 rules applied. Total rules applied 18893 place count 8690 transition count 15995
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 18959 place count 8657 transition count 15962
Applied a total of 18959 rules in 10548 ms. Remains 8657 /18137 variables (removed 9480) and now considering 15962/28411 (removed 12449) transitions.
[2023-03-22 18:59:13] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2023-03-22 18:59:13] [INFO ] Computed 1429 place invariants in 704 ms
[2023-03-22 18:59:14] [INFO ] Implicit Places using invariants in 1467 ms returned []
Implicit Place search using SMT only with invariants took 1468 ms to find 0 implicit places.
[2023-03-22 18:59:14] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2023-03-22 18:59:14] [INFO ] Invariant cache hit.
[2023-03-22 18:59:15] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8657/18137 places, 15962/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12781 ms. Remains : 8657/18137 places, 15962/28411 transitions.
Stuttering acceptance computed with spot in 662 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s4496)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-05 finished in 13498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 18137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18137/18137 places, 28411/28411 transitions.
Graph (complete) has 85803 edges and 18137 vertex of which 18136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.31 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4223 transitions
Trivial Post-agglo rules discarded 4223 transitions
Performed 4223 trivial Post agglomeration. Transition count delta: 4223
Iterating post reduction 0 with 4223 rules applied. Total rules applied 4224 place count 18136 transition count 24188
Reduce places removed 4223 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8448 place count 13913 transition count 24187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8449 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 264 Pre rules applied. Total rules applied 8449 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 18 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 8977 place count 13648 transition count 23923
Discarding 3959 places :
Symmetric choice reduction at 3 with 3959 rule applications. Total rules 12936 place count 9689 transition count 19964
Iterating global reduction 3 with 3959 rules applied. Total rules applied 16895 place count 9689 transition count 19964
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16895 place count 9689 transition count 19957
Deduced a syphon composed of 7 places in 15 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 16909 place count 9682 transition count 19957
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 17898 place count 8693 transition count 16001
Iterating global reduction 3 with 989 rules applied. Total rules applied 18887 place count 8693 transition count 16001
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 18953 place count 8660 transition count 15968
Applied a total of 18953 rules in 11077 ms. Remains 8660 /18137 variables (removed 9477) and now considering 15968/28411 (removed 12443) transitions.
[2023-03-22 18:59:27] [INFO ] Flow matrix only has 14912 transitions (discarded 1056 similar events)
// Phase 1: matrix 14912 rows 8660 cols
[2023-03-22 18:59:28] [INFO ] Computed 1429 place invariants in 745 ms
[2023-03-22 18:59:28] [INFO ] Implicit Places using invariants in 1507 ms returned []
Implicit Place search using SMT only with invariants took 1508 ms to find 0 implicit places.
[2023-03-22 18:59:28] [INFO ] Flow matrix only has 14912 transitions (discarded 1056 similar events)
[2023-03-22 18:59:28] [INFO ] Invariant cache hit.
[2023-03-22 18:59:29] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8660/18137 places, 15968/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13348 ms. Remains : 8660/18137 places, 15968/28411 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s7771 s4288)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3383 reset in 1797 ms.
Product exploration explored 100000 steps with 3384 reset in 1813 ms.
Computed a total of 2677 stabilizing places and 4032 stable transitions
Computed a total of 2677 stabilizing places and 4032 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12869 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12869 steps, saw 6092 distinct states, run finished after 3002 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:59:36] [INFO ] Flow matrix only has 14912 transitions (discarded 1056 similar events)
[2023-03-22 18:59:36] [INFO ] Invariant cache hit.
[2023-03-22 18:59:37] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:59:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 137 ms returned sat
[2023-03-22 18:59:39] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 549 ms returned sat
[2023-03-22 18:59:51] [INFO ] After 12354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:59:51] [INFO ] State equation strengthened by 6187 read => feed constraints.
[2023-03-22 18:59:54] [INFO ] After 2517ms SMT Verify possible using 6187 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-22 18:59:54] [INFO ] After 16545ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLCardinality-11 finished in 38114 ms.
All properties solved by simple procedures.
Total runtime 236032 ms.
ITS solved all properties within timeout

BK_STOP 1679511595231

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C04, 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 r231-tall-167856416700907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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