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

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S32C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3076.668 316717.00 369858.00 949.90 FTFFFTFFFFFTFFFF 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.r233-tall-167856419600900.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 ltsminxred
Input is MultiCrashLeafsetExtension-PT-S32C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419600900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 14K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 18M 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-S32C03-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679657080075

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 11:24:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 11:24:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 11:24:42] [INFO ] Load time of PNML (sax parser for PT used): 582 ms
[2023-03-24 11:24:42] [INFO ] Transformed 15862 places.
[2023-03-24 11:24:42] [INFO ] Transformed 25109 transitions.
[2023-03-24 11:24:42] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 776 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 15862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 15820 transition count 25109
Discarding 3160 places :
Symmetric choice reduction at 1 with 3160 rule applications. Total rules 3202 place count 12660 transition count 21949
Iterating global reduction 1 with 3160 rules applied. Total rules applied 6362 place count 12660 transition count 21949
Discarding 2967 places :
Symmetric choice reduction at 1 with 2967 rule applications. Total rules 9329 place count 9693 transition count 18982
Iterating global reduction 1 with 2967 rules applied. Total rules applied 12296 place count 9693 transition count 18982
Discarding 980 places :
Symmetric choice reduction at 1 with 980 rule applications. Total rules 13276 place count 8713 transition count 16042
Iterating global reduction 1 with 980 rules applied. Total rules applied 14256 place count 8713 transition count 16042
Applied a total of 14256 rules in 8144 ms. Remains 8713 /15862 variables (removed 7149) and now considering 16042/25109 (removed 9067) transitions.
[2023-03-24 11:24:50] [INFO ] Flow matrix only has 14986 transitions (discarded 1056 similar events)
// Phase 1: matrix 14986 rows 8713 cols
[2023-03-24 11:24:52] [INFO ] Computed 1361 place invariants in 1131 ms
[2023-03-24 11:24:52] [INFO ] Implicit Places using invariants in 2102 ms returned []
Implicit Place search using SMT only with invariants took 2127 ms to find 0 implicit places.
[2023-03-24 11:24:52] [INFO ] Flow matrix only has 14986 transitions (discarded 1056 similar events)
[2023-03-24 11:24:52] [INFO ] Invariant cache hit.
[2023-03-24 11:24:53] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8713/15862 places, 16042/25109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11181 ms. Remains : 8713/15862 places, 16042/25109 transitions.
Support contains 43 out of 8713 places after structural reductions.
[2023-03-24 11:24:55] [INFO ] Flatten gal took : 878 ms
[2023-03-24 11:24:55] [INFO ] Flatten gal took : 540 ms
[2023-03-24 11:24:56] [INFO ] Input system was already deterministic with 16042 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 11061 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{4=1, 17=1, 21=1}
Probabilistic random walk after 11061 steps, saw 5299 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :3
Running SMT prover for 19 properties.
[2023-03-24 11:25:01] [INFO ] Flow matrix only has 14986 transitions (discarded 1056 similar events)
[2023-03-24 11:25:01] [INFO ] Invariant cache hit.
[2023-03-24 11:25:04] [INFO ] [Real]Absence check using 65 positive place invariants in 176 ms returned sat
[2023-03-24 11:25:04] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 547 ms returned sat
[2023-03-24 11:25:22] [INFO ] After 15314ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:16
[2023-03-24 11:25:22] [INFO ] State equation strengthened by 6138 read => feed constraints.
[2023-03-24 11:25:25] [INFO ] After 2235ms SMT Verify possible using 6138 Read/Feed constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-24 11:25:25] [INFO ] After 24081ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-24 11:25:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 136 ms returned sat
[2023-03-24 11:25:28] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 515 ms returned sat
[2023-03-24 11:25:50] [INFO ] After 19398ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
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-24 11:25:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 11:25:50] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:18
Fused 19 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 34 out of 8713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8713 transition count 16040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8711 transition count 16040
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 206 Pre rules applied. Total rules applied 4 place count 8711 transition count 15834
Deduced a syphon composed of 206 places in 13 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 416 place count 8505 transition count 15834
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 419 place count 8502 transition count 15827
Iterating global reduction 2 with 3 rules applied. Total rules applied 422 place count 8502 transition count 15827
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 423 place count 8501 transition count 15824
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 8501 transition count 15824
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 19 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 492 place count 8467 transition count 15790
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 494 place count 8465 transition count 15788
Iterating global reduction 2 with 2 rules applied. Total rules applied 496 place count 8465 transition count 15788
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 496 place count 8465 transition count 15786
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 500 place count 8463 transition count 15786
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 502 place count 8461 transition count 15780
Iterating global reduction 2 with 2 rules applied. Total rules applied 504 place count 8461 transition count 15780
Free-agglomeration rule (complex) applied 570 times.
Iterating global reduction 2 with 570 rules applied. Total rules applied 1074 place count 8461 transition count 17150
Reduce places removed 570 places and 0 transitions.
Iterating post reduction 2 with 570 rules applied. Total rules applied 1644 place count 7891 transition count 17150
Applied a total of 1644 rules in 12548 ms. Remains 7891 /8713 variables (removed 822) and now considering 17150/16042 (removed -1108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12552 ms. Remains : 7891/8713 places, 17150/16042 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 12504 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12504 steps, saw 5760 distinct states, run finished after 3004 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-24 11:26:06] [INFO ] Flow matrix only has 15589 transitions (discarded 1561 similar events)
// Phase 1: matrix 15589 rows 7891 cols
[2023-03-24 11:26:07] [INFO ] Computed 1361 place invariants in 707 ms
[2023-03-24 11:26:09] [INFO ] [Real]Absence check using 65 positive place invariants in 162 ms returned sat
[2023-03-24 11:26:10] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 435 ms returned sat
[2023-03-24 11:26:32] [INFO ] After 24726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-24 11:26:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 156 ms returned sat
[2023-03-24 11:26:35] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 487 ms returned sat
[2023-03-24 11:26:57] [INFO ] After 20226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-24 11:26:57] [INFO ] State equation strengthened by 8068 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-24 11:26:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 11:26:57] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 32 out of 7891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7891/7891 places, 17150/17150 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7891 transition count 17149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7890 transition count 17149
Applied a total of 2 rules in 3326 ms. Remains 7890 /7891 variables (removed 1) and now considering 17149/17150 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3328 ms. Remains : 7890/7891 places, 17149/17150 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 2697 stabilizing places and 4073 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8713 transition count 16040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8711 transition count 16040
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 206 Pre rules applied. Total rules applied 4 place count 8711 transition count 15834
Deduced a syphon composed of 206 places in 12 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 416 place count 8505 transition count 15834
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 424 place count 8497 transition count 15812
Iterating global reduction 2 with 8 rules applied. Total rules applied 432 place count 8497 transition count 15812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 8496 transition count 15809
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 14 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 504 place count 8461 transition count 15774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 506 place count 8459 transition count 15772
Iterating global reduction 2 with 2 rules applied. Total rules applied 508 place count 8459 transition count 15772
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 508 place count 8459 transition count 15770
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 512 place count 8457 transition count 15770
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 514 place count 8455 transition count 15764
Iterating global reduction 2 with 2 rules applied. Total rules applied 516 place count 8455 transition count 15764
Applied a total of 516 rules in 10119 ms. Remains 8455 /8713 variables (removed 258) and now considering 15764/16042 (removed 278) transitions.
[2023-03-24 11:27:11] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2023-03-24 11:27:11] [INFO ] Computed 1361 place invariants in 717 ms
[2023-03-24 11:27:12] [INFO ] Implicit Places using invariants in 1499 ms returned []
Implicit Place search using SMT only with invariants took 1506 ms to find 0 implicit places.
[2023-03-24 11:27:12] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
[2023-03-24 11:27:12] [INFO ] Invariant cache hit.
[2023-03-24 11:27:13] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8455/8713 places, 15764/16042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12407 ms. Remains : 8455/8713 places, 15764/16042 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3704 1) (GEQ s6450 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00 finished in 12655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 8713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 8705 transition count 16024
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 8705 transition count 16024
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 8702 transition count 16019
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 8702 transition count 16019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 8700 transition count 16013
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 8700 transition count 16013
Applied a total of 26 rules in 5259 ms. Remains 8700 /8713 variables (removed 13) and now considering 16013/16042 (removed 29) transitions.
[2023-03-24 11:27:18] [INFO ] Flow matrix only has 14957 transitions (discarded 1056 similar events)
// Phase 1: matrix 14957 rows 8700 cols
[2023-03-24 11:27:19] [INFO ] Computed 1361 place invariants in 671 ms
[2023-03-24 11:27:20] [INFO ] Implicit Places using invariants in 1517 ms returned []
Implicit Place search using SMT only with invariants took 1518 ms to find 0 implicit places.
[2023-03-24 11:27:20] [INFO ] Flow matrix only has 14957 transitions (discarded 1056 similar events)
[2023-03-24 11:27:20] [INFO ] Invariant cache hit.
[2023-03-24 11:27:21] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8700/8713 places, 16013/16042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7564 ms. Remains : 8700/8713 places, 16013/16042 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (OR (LT s4072 1) (LT s8623 1)) (GEQ s4045 1) (GEQ s8588 1)) (NOT (AND (GEQ s4045 1) (GEQ s8588 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5893 ms.
Product exploration explored 100000 steps with 50000 reset in 5483 ms.
Computed a total of 2684 stabilizing places and 4044 stable transitions
Computed a total of 2684 stabilizing places and 4044 stable transitions
Detected a total of 2684/8700 stabilizing places and 4044/16013 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01 finished in 19191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 8704 transition count 16021
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 8704 transition count 16021
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 8701 transition count 16016
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 8701 transition count 16016
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 8699 transition count 16010
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 8699 transition count 16010
Applied a total of 28 rules in 5297 ms. Remains 8699 /8713 variables (removed 14) and now considering 16010/16042 (removed 32) transitions.
[2023-03-24 11:27:38] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
// Phase 1: matrix 14954 rows 8699 cols
[2023-03-24 11:27:38] [INFO ] Computed 1361 place invariants in 662 ms
[2023-03-24 11:27:39] [INFO ] Implicit Places using invariants in 1451 ms returned []
Implicit Place search using SMT only with invariants took 1453 ms to find 0 implicit places.
[2023-03-24 11:27:39] [INFO ] Flow matrix only has 14954 transitions (discarded 1056 similar events)
[2023-03-24 11:27:39] [INFO ] Invariant cache hit.
[2023-03-24 11:27:40] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8699/8713 places, 16010/16042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7531 ms. Remains : 8699/8713 places, 16010/16042 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s7319 1) (GEQ s8692 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 finished in 7714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 8704 transition count 16019
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 8704 transition count 16019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 8702 transition count 16017
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 8702 transition count 16017
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 8700 transition count 16011
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 8700 transition count 16011
Applied a total of 26 rules in 5082 ms. Remains 8700 /8713 variables (removed 13) and now considering 16011/16042 (removed 31) transitions.
[2023-03-24 11:27:45] [INFO ] Flow matrix only has 14955 transitions (discarded 1056 similar events)
// Phase 1: matrix 14955 rows 8700 cols
[2023-03-24 11:27:46] [INFO ] Computed 1361 place invariants in 653 ms
[2023-03-24 11:27:46] [INFO ] Implicit Places using invariants in 1393 ms returned []
Implicit Place search using SMT only with invariants took 1402 ms to find 0 implicit places.
[2023-03-24 11:27:46] [INFO ] Flow matrix only has 14955 transitions (discarded 1056 similar events)
[2023-03-24 11:27:46] [INFO ] Invariant cache hit.
[2023-03-24 11:27:47] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8700/8713 places, 16011/16042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7226 ms. Remains : 8700/8713 places, 16011/16042 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1937 1) (GEQ s1951 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 finished in 7337 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||(p1&&F(G(p1)))))))'
Support contains 4 out of 8713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8713 transition count 16040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8711 transition count 16040
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 206 Pre rules applied. Total rules applied 4 place count 8711 transition count 15834
Deduced a syphon composed of 206 places in 12 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 416 place count 8505 transition count 15834
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 424 place count 8497 transition count 15812
Iterating global reduction 2 with 8 rules applied. Total rules applied 432 place count 8497 transition count 15812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 8496 transition count 15809
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 12 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 504 place count 8461 transition count 15774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 506 place count 8459 transition count 15772
Iterating global reduction 2 with 2 rules applied. Total rules applied 508 place count 8459 transition count 15772
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 508 place count 8459 transition count 15770
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 512 place count 8457 transition count 15770
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 514 place count 8455 transition count 15764
Iterating global reduction 2 with 2 rules applied. Total rules applied 516 place count 8455 transition count 15764
Applied a total of 516 rules in 8952 ms. Remains 8455 /8713 variables (removed 258) and now considering 15764/16042 (removed 278) transitions.
[2023-03-24 11:27:56] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2023-03-24 11:27:57] [INFO ] Computed 1361 place invariants in 659 ms
[2023-03-24 11:27:58] [INFO ] Implicit Places using invariants in 1376 ms returned []
Implicit Place search using SMT only with invariants took 1377 ms to find 0 implicit places.
[2023-03-24 11:27:58] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
[2023-03-24 11:27:58] [INFO ] Invariant cache hit.
[2023-03-24 11:27:58] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8455/8713 places, 15764/16042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11070 ms. Remains : 8455/8713 places, 15764/16042 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s4439 1) (LT s4636 1)), p0:(AND (OR (LT s4439 1) (LT s4636 1)) (OR (LT s2010 1) (LT s5184 1)))], 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 4505 reset in 1757 ms.
Product exploration explored 100000 steps with 4508 reset in 1751 ms.
Computed a total of 2472 stabilizing places and 3828 stable transitions
Computed a total of 2472 stabilizing places and 3828 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 450 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 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 47 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13377 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13377 steps, saw 6264 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 11:28:06] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
[2023-03-24 11:28:06] [INFO ] Invariant cache hit.
[2023-03-24 11:28:07] [INFO ] [Real]Absence check using 65 positive place invariants in 140 ms returned sat
[2023-03-24 11:28:07] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 500 ms returned sat
[2023-03-24 11:28:07] [INFO ] After 1690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 11:28:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 127 ms returned sat
[2023-03-24 11:28:09] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 526 ms returned sat
[2023-03-24 11:28:22] [INFO ] After 12998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 11:28:22] [INFO ] State equation strengthened by 6118 read => feed constraints.
[2023-03-24 11:28:26] [INFO ] After 3537ms SMT Verify possible using 6118 Read/Feed constraints in natural domain returned unsat :2 sat :0
[2023-03-24 11:28:26] [INFO ] After 18399ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 finished in 38718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8713 transition count 16040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8711 transition count 16040
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 206 Pre rules applied. Total rules applied 4 place count 8711 transition count 15834
Deduced a syphon composed of 206 places in 12 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 416 place count 8505 transition count 15834
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 424 place count 8497 transition count 15812
Iterating global reduction 2 with 8 rules applied. Total rules applied 432 place count 8497 transition count 15812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 8496 transition count 15809
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 13 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 502 place count 8462 transition count 15775
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 504 place count 8460 transition count 15773
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 8460 transition count 15773
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 506 place count 8460 transition count 15771
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 510 place count 8458 transition count 15771
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 512 place count 8456 transition count 15765
Iterating global reduction 2 with 2 rules applied. Total rules applied 514 place count 8456 transition count 15765
Applied a total of 514 rules in 8980 ms. Remains 8456 /8713 variables (removed 257) and now considering 15765/16042 (removed 277) transitions.
[2023-03-24 11:28:35] [INFO ] Flow matrix only has 14709 transitions (discarded 1056 similar events)
// Phase 1: matrix 14709 rows 8456 cols
[2023-03-24 11:28:36] [INFO ] Computed 1361 place invariants in 670 ms
[2023-03-24 11:28:36] [INFO ] Implicit Places using invariants in 1434 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-24 11:28:36] [INFO ] Flow matrix only has 14709 transitions (discarded 1056 similar events)
[2023-03-24 11:28:36] [INFO ] Invariant cache hit.
[2023-03-24 11:28:37] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8456/8713 places, 15765/16042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11186 ms. Remains : 8456/8713 places, 15765/16042 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1075 1) (GEQ s4355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06 finished in 11285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U G(p1))||(X(p1) U (p2||G(p1))))))'
Support contains 4 out of 8713 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8713 transition count 16040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8711 transition count 16040
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 206 Pre rules applied. Total rules applied 4 place count 8711 transition count 15834
Deduced a syphon composed of 206 places in 12 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 416 place count 8505 transition count 15834
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 8498 transition count 15815
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 8498 transition count 15815
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 431 place count 8497 transition count 15812
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 8497 transition count 15812
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 13 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 502 place count 8462 transition count 15777
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 504 place count 8460 transition count 15775
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 8460 transition count 15775
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 506 place count 8460 transition count 15773
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 510 place count 8458 transition count 15773
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 512 place count 8456 transition count 15767
Iterating global reduction 2 with 2 rules applied. Total rules applied 514 place count 8456 transition count 15767
Applied a total of 514 rules in 9208 ms. Remains 8456 /8713 variables (removed 257) and now considering 15767/16042 (removed 275) transitions.
[2023-03-24 11:28:47] [INFO ] Flow matrix only has 14711 transitions (discarded 1056 similar events)
// Phase 1: matrix 14711 rows 8456 cols
[2023-03-24 11:28:47] [INFO ] Computed 1361 place invariants in 670 ms
[2023-03-24 11:28:48] [INFO ] Implicit Places using invariants in 1420 ms returned []
Implicit Place search using SMT only with invariants took 1421 ms to find 0 implicit places.
[2023-03-24 11:28:48] [INFO ] Flow matrix only has 14711 transitions (discarded 1056 similar events)
[2023-03-24 11:28:48] [INFO ] Invariant cache hit.
[2023-03-24 11:28:49] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8456/8713 places, 15767/16042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11390 ms. Remains : 8456/8713 places, 15767/16042 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s3380 1) (GEQ s4673 1)), p2:(AND (GEQ s3435 1) (GEQ s6205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 finished in 11504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 4 out of 8713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8713 transition count 16040
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8711 transition count 16040
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 206 Pre rules applied. Total rules applied 4 place count 8711 transition count 15834
Deduced a syphon composed of 206 places in 13 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 416 place count 8505 transition count 15834
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 424 place count 8497 transition count 15812
Iterating global reduction 2 with 8 rules applied. Total rules applied 432 place count 8497 transition count 15812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 8496 transition count 15809
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 8496 transition count 15809
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 12 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 504 place count 8461 transition count 15774
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 506 place count 8459 transition count 15772
Iterating global reduction 2 with 2 rules applied. Total rules applied 508 place count 8459 transition count 15772
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 508 place count 8459 transition count 15770
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 512 place count 8457 transition count 15770
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 514 place count 8455 transition count 15764
Iterating global reduction 2 with 2 rules applied. Total rules applied 516 place count 8455 transition count 15764
Applied a total of 516 rules in 9021 ms. Remains 8455 /8713 variables (removed 258) and now considering 15764/16042 (removed 278) transitions.
[2023-03-24 11:28:58] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2023-03-24 11:28:59] [INFO ] Computed 1361 place invariants in 659 ms
[2023-03-24 11:28:59] [INFO ] Implicit Places using invariants in 1393 ms returned []
Implicit Place search using SMT only with invariants took 1396 ms to find 0 implicit places.
[2023-03-24 11:28:59] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
[2023-03-24 11:28:59] [INFO ] Invariant cache hit.
[2023-03-24 11:29:00] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8455/8713 places, 15764/16042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11232 ms. Remains : 8455/8713 places, 15764/16042 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1216 1) (GEQ s3068 1)), p1:(AND (GEQ s5982 1) (GEQ s6906 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 finished in 11362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 8713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 8703 transition count 16018
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 8703 transition count 16018
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 8700 transition count 16013
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 8700 transition count 16013
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 8698 transition count 16007
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 8698 transition count 16007
Applied a total of 30 rules in 5028 ms. Remains 8698 /8713 variables (removed 15) and now considering 16007/16042 (removed 35) transitions.
[2023-03-24 11:29:05] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2023-03-24 11:29:06] [INFO ] Computed 1361 place invariants in 670 ms
[2023-03-24 11:29:07] [INFO ] Implicit Places using invariants in 1436 ms returned []
Implicit Place search using SMT only with invariants took 1438 ms to find 0 implicit places.
[2023-03-24 11:29:07] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
[2023-03-24 11:29:07] [INFO ] Invariant cache hit.
[2023-03-24 11:29:07] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8698/8713 places, 16007/16042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7214 ms. Remains : 8698/8713 places, 16007/16042 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s264 1) (LT s1550 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3197 reset in 1439 ms.
Product exploration explored 100000 steps with 3198 reset in 1477 ms.
Computed a total of 2682 stabilizing places and 4038 stable transitions
Computed a total of 2682 stabilizing places and 4038 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 320 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12787 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12787 steps, saw 6089 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 11:29:14] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
[2023-03-24 11:29:14] [INFO ] Invariant cache hit.
[2023-03-24 11:29:15] [INFO ] [Real]Absence check using 65 positive place invariants in 120 ms returned sat
[2023-03-24 11:29:16] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 549 ms returned sat
[2023-03-24 11:29:27] [INFO ] After 12613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 11:29:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 120 ms returned sat
[2023-03-24 11:29:28] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 553 ms returned sat
[2023-03-24 11:29:40] [INFO ] After 11447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 11:29:40] [INFO ] State equation strengthened by 6118 read => feed constraints.
[2023-03-24 11:29:40] [INFO ] After 377ms SMT Verify possible using 6118 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-24 11:29:40] [INFO ] After 13516ms 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, true, (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11 finished in 40101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((F(!p1) U X(p2))||p0))))'
Support contains 6 out of 8713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 8706 transition count 16027
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 8706 transition count 16027
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 8703 transition count 16022
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 8703 transition count 16022
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 8701 transition count 16016
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 8701 transition count 16016
Applied a total of 24 rules in 5074 ms. Remains 8701 /8713 variables (removed 12) and now considering 16016/16042 (removed 26) transitions.
[2023-03-24 11:29:45] [INFO ] Flow matrix only has 14960 transitions (discarded 1056 similar events)
// Phase 1: matrix 14960 rows 8701 cols
[2023-03-24 11:29:46] [INFO ] Computed 1361 place invariants in 640 ms
[2023-03-24 11:29:47] [INFO ] Implicit Places using invariants in 1410 ms returned []
Implicit Place search using SMT only with invariants took 1411 ms to find 0 implicit places.
[2023-03-24 11:29:47] [INFO ] Flow matrix only has 14960 transitions (discarded 1056 similar events)
[2023-03-24 11:29:47] [INFO ] Invariant cache hit.
[2023-03-24 11:29:48] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8701/8713 places, 16016/16042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7251 ms. Remains : 8701/8713 places, 16016/16042 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s3748 1) (GEQ s8659 1)) (AND (GEQ s6016 1) (GEQ s8694 1))), p2:(AND (GEQ s1733 1) (GEQ s8589 1))], 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]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12 finished in 7424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(p0)))))))'
Support contains 3 out of 8713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8713/8713 places, 16042/16042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 8704 transition count 16019
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 8704 transition count 16019
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 8702 transition count 16015
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 8702 transition count 16015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 8701 transition count 16012
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 8701 transition count 16012
Applied a total of 24 rules in 5176 ms. Remains 8701 /8713 variables (removed 12) and now considering 16012/16042 (removed 30) transitions.
[2023-03-24 11:29:53] [INFO ] Flow matrix only has 14956 transitions (discarded 1056 similar events)
// Phase 1: matrix 14956 rows 8701 cols
[2023-03-24 11:29:54] [INFO ] Computed 1361 place invariants in 680 ms
[2023-03-24 11:29:54] [INFO ] Implicit Places using invariants in 1474 ms returned []
Implicit Place search using SMT only with invariants took 1475 ms to find 0 implicit places.
[2023-03-24 11:29:54] [INFO ] Flow matrix only has 14956 transitions (discarded 1056 similar events)
[2023-03-24 11:29:54] [INFO ] Invariant cache hit.
[2023-03-24 11:29:55] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8701/8713 places, 16012/16042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7457 ms. Remains : 8701/8713 places, 16012/16042 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2046 1) (GEQ s2622 1)), p1:(LT s4156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 finished in 7692 ms.
All properties solved by simple procedures.
Total runtime 314341 ms.
ITS solved all properties within timeout

BK_STOP 1679657396792

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419600900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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