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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3540.779 362765.00 520632.00 1125.30 TFTFFF?FT?FFFFFT 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-167856419500892.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-S32C02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419500892
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 16K Feb 26 03:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 03:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 03:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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-S32C02-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679654408241

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-S32C02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 10:40:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 10:40:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 10:40:10] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2023-03-24 10:40:10] [INFO ] Transformed 13544 places.
[2023-03-24 10:40:10] [INFO ] Transformed 21807 transitions.
[2023-03-24 10:40:10] [INFO ] Parsed PT model containing 13544 places and 21807 transitions and 93598 arcs in 679 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 45 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 13544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 13504 transition count 21807
Discarding 2105 places :
Symmetric choice reduction at 1 with 2105 rule applications. Total rules 2145 place count 11399 transition count 19702
Iterating global reduction 1 with 2105 rules applied. Total rules applied 4250 place count 11399 transition count 19702
Discarding 1971 places :
Symmetric choice reduction at 1 with 1971 rule applications. Total rules 6221 place count 9428 transition count 17731
Iterating global reduction 1 with 1971 rules applied. Total rules applied 8192 place count 9428 transition count 17731
Discarding 978 places :
Symmetric choice reduction at 1 with 978 rule applications. Total rules 9170 place count 8450 transition count 15775
Iterating global reduction 1 with 978 rules applied. Total rules applied 10148 place count 8450 transition count 15775
Applied a total of 10148 rules in 9946 ms. Remains 8450 /13544 variables (removed 5094) and now considering 15775/21807 (removed 6032) transitions.
[2023-03-24 10:40:21] [INFO ] Flow matrix only has 14719 transitions (discarded 1056 similar events)
// Phase 1: matrix 14719 rows 8450 cols
[2023-03-24 10:40:22] [INFO ] Computed 1293 place invariants in 1065 ms
[2023-03-24 10:40:23] [INFO ] Implicit Places using invariants in 2548 ms returned []
Implicit Place search using SMT only with invariants took 2648 ms to find 0 implicit places.
[2023-03-24 10:40:23] [INFO ] Flow matrix only has 14719 transitions (discarded 1056 similar events)
[2023-03-24 10:40:23] [INFO ] Invariant cache hit.
[2023-03-24 10:40:24] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8450/13544 places, 15775/21807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13651 ms. Remains : 8450/13544 places, 15775/21807 transitions.
Support contains 58 out of 8450 places after structural reductions.
[2023-03-24 10:40:26] [INFO ] Flatten gal took : 1080 ms
[2023-03-24 10:40:27] [INFO ] Flatten gal took : 679 ms
[2023-03-24 10:40:28] [INFO ] Input system was already deterministic with 15775 transitions.
Support contains 56 out of 8450 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 472 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 30) seen :10
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-24 10:40:29] [INFO ] Flow matrix only has 14719 transitions (discarded 1056 similar events)
[2023-03-24 10:40:29] [INFO ] Invariant cache hit.
[2023-03-24 10:40:33] [INFO ] [Real]Absence check using 63 positive place invariants in 178 ms returned sat
[2023-03-24 10:40:33] [INFO ] [Real]Absence check using 63 positive and 1230 generalized place invariants in 537 ms returned sat
[2023-03-24 10:40:54] [INFO ] After 18401ms SMT Verify possible using state equation in real domain returned unsat :1 sat :13 real:5
[2023-03-24 10:40:55] [INFO ] State equation strengthened by 6064 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:339)
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 10:40:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 10:40:55] [INFO ] After 25167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 33 out of 8450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8450 transition count 15774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8449 transition count 15774
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 2 place count 8449 transition count 15642
Deduced a syphon composed of 132 places in 12 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 266 place count 8317 transition count 15642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 269 place count 8314 transition count 15638
Iterating global reduction 2 with 3 rules applied. Total rules applied 272 place count 8314 transition count 15638
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 272 place count 8314 transition count 15637
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 8313 transition count 15637
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 276 place count 8311 transition count 15633
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 8311 transition count 15633
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 14 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 344 place count 8278 transition count 15600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 345 place count 8277 transition count 15599
Iterating global reduction 2 with 1 rules applied. Total rules applied 346 place count 8277 transition count 15599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 8276 transition count 15597
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 8276 transition count 15597
Free-agglomeration rule (complex) applied 563 times.
Iterating global reduction 2 with 563 rules applied. Total rules applied 911 place count 8276 transition count 16016
Reduce places removed 563 places and 0 transitions.
Iterating post reduction 2 with 563 rules applied. Total rules applied 1474 place count 7713 transition count 16016
Partial Free-agglomeration rule applied 63 times.
Drop transitions removed 63 transitions
Iterating global reduction 3 with 63 rules applied. Total rules applied 1537 place count 7713 transition count 16016
Applied a total of 1537 rules in 16629 ms. Remains 7713 /8450 variables (removed 737) and now considering 16016/15775 (removed -241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16635 ms. Remains : 7713/8450 places, 16016/15775 transitions.
Incomplete random walk after 10000 steps, including 761 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-24 10:41:12] [INFO ] Flow matrix only has 14469 transitions (discarded 1547 similar events)
// Phase 1: matrix 14469 rows 7713 cols
[2023-03-24 10:41:13] [INFO ] Computed 1293 place invariants in 671 ms
[2023-03-24 10:41:16] [INFO ] [Real]Absence check using 65 positive place invariants in 154 ms returned sat
[2023-03-24 10:41:16] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 481 ms returned sat
[2023-03-24 10:41:34] [INFO ] After 15957ms SMT Verify possible using state equation in real domain returned unsat :1 sat :7 real:6
[2023-03-24 10:41:34] [INFO ] State equation strengthened by 7042 read => feed constraints.
[2023-03-24 10:41:37] [INFO ] After 2899ms SMT Verify possible using 7042 Read/Feed constraints in real domain returned unsat :4 sat :0 real:10
[2023-03-24 10:41:37] [INFO ] After 23753ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:10
[2023-03-24 10:41:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 226 ms returned sat
[2023-03-24 10:41:39] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 452 ms returned sat
[2023-03-24 10:41:54] [INFO ] After 13806ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :10
[2023-03-24 10:42:02] [INFO ] After 7793ms SMT Verify possible using 7042 Read/Feed constraints in natural domain returned unsat :8 sat :5
[2023-03-24 10:42:02] [INFO ] After 7794ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-24 10:42:02] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :5
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 10 out of 7713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7713/7713 places, 16016/16016 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 7713 transition count 16014
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7711 transition count 16014
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 7709 transition count 16012
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 7709 transition count 16012
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 7708 transition count 16011
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 7708 transition count 16004
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 24 place count 7701 transition count 16004
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 7701 transition count 16004
Applied a total of 26 rules in 8400 ms. Remains 7701 /7713 variables (removed 12) and now considering 16004/16016 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8400 ms. Remains : 7701/7713 places, 16004/16016 transitions.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2434 stabilizing places and 3806 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 8450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8450 transition count 15772
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8447 transition count 15772
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 134 Pre rules applied. Total rules applied 6 place count 8447 transition count 15638
Deduced a syphon composed of 134 places in 12 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 274 place count 8313 transition count 15638
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 282 place count 8305 transition count 15627
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 8305 transition count 15627
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 295 place count 8300 transition count 15617
Iterating global reduction 2 with 5 rules applied. Total rules applied 300 place count 8300 transition count 15617
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 370 place count 8265 transition count 15582
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 373 place count 8262 transition count 15579
Iterating global reduction 2 with 3 rules applied. Total rules applied 376 place count 8262 transition count 15579
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 376 place count 8262 transition count 15577
Deduced a syphon composed of 2 places in 23 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 380 place count 8260 transition count 15577
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 383 place count 8257 transition count 15571
Iterating global reduction 2 with 3 rules applied. Total rules applied 386 place count 8257 transition count 15571
Applied a total of 386 rules in 10730 ms. Remains 8257 /8450 variables (removed 193) and now considering 15571/15775 (removed 204) transitions.
[2023-03-24 10:42:21] [INFO ] Flow matrix only has 14515 transitions (discarded 1056 similar events)
// Phase 1: matrix 14515 rows 8257 cols
[2023-03-24 10:42:22] [INFO ] Computed 1293 place invariants in 699 ms
[2023-03-24 10:42:23] [INFO ] Implicit Places using invariants in 1536 ms returned []
Implicit Place search using SMT only with invariants took 1543 ms to find 0 implicit places.
[2023-03-24 10:42:23] [INFO ] Flow matrix only has 14515 transitions (discarded 1056 similar events)
[2023-03-24 10:42:23] [INFO ] Invariant cache hit.
[2023-03-24 10:42:24] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8257/8450 places, 15571/15775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13031 ms. Remains : 8257/8450 places, 15571/15775 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4008 1) (GEQ s4017 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-01 finished in 13303 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&&X(p0))))'
Support contains 2 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 8439 transition count 15761
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 8439 transition count 15761
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 8431 transition count 15748
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 8431 transition count 15748
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 8428 transition count 15742
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 8428 transition count 15742
Applied a total of 44 rules in 5465 ms. Remains 8428 /8450 variables (removed 22) and now considering 15742/15775 (removed 33) transitions.
[2023-03-24 10:42:29] [INFO ] Flow matrix only has 14686 transitions (discarded 1056 similar events)
// Phase 1: matrix 14686 rows 8428 cols
[2023-03-24 10:42:30] [INFO ] Computed 1293 place invariants in 623 ms
[2023-03-24 10:42:31] [INFO ] Implicit Places using invariants in 1553 ms returned []
Implicit Place search using SMT only with invariants took 1579 ms to find 0 implicit places.
[2023-03-24 10:42:31] [INFO ] Flow matrix only has 14686 transitions (discarded 1056 similar events)
[2023-03-24 10:42:31] [INFO ] Invariant cache hit.
[2023-03-24 10:42:32] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8428/8450 places, 15742/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7877 ms. Remains : 8428/8450 places, 15742/15775 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(OR (LT s4073 1) (LT s4101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 7551 ms.
Product exploration explored 100000 steps with 50000 reset in 7284 ms.
Computed a total of 2412 stabilizing places and 3773 stable transitions
Computed a total of 2412 stabilizing places and 3773 stable transitions
Detected a total of 2412/8428 stabilizing places and 3773/15742 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 : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-02 finished in 23120 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 X(p1)))'
Support contains 7 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 8440 transition count 15762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 8440 transition count 15762
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 8433 transition count 15751
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 8433 transition count 15751
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 8430 transition count 15745
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 8430 transition count 15745
Applied a total of 40 rules in 5517 ms. Remains 8430 /8450 variables (removed 20) and now considering 15745/15775 (removed 30) transitions.
[2023-03-24 10:42:53] [INFO ] Flow matrix only has 14689 transitions (discarded 1056 similar events)
// Phase 1: matrix 14689 rows 8430 cols
[2023-03-24 10:42:53] [INFO ] Computed 1293 place invariants in 645 ms
[2023-03-24 10:42:54] [INFO ] Implicit Places using invariants in 1412 ms returned []
Implicit Place search using SMT only with invariants took 1427 ms to find 0 implicit places.
[2023-03-24 10:42:54] [INFO ] Flow matrix only has 14689 transitions (discarded 1056 similar events)
[2023-03-24 10:42:54] [INFO ] Invariant cache hit.
[2023-03-24 10:42:55] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8430/8450 places, 15745/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7730 ms. Remains : 8430/8450 places, 15745/15775 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3304 1) (GEQ s3443 1)), p1:(AND (GEQ s4562 1) (GEQ s4572 1) (NOT (AND (GEQ s1078 1) (GEQ s1081 1) (GEQ s1532 1))))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-03 finished in 7989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 4 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 8438 transition count 15760
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 8438 transition count 15760
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 8429 transition count 15745
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 8429 transition count 15745
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 8426 transition count 15739
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 8426 transition count 15739
Applied a total of 48 rules in 5429 ms. Remains 8426 /8450 variables (removed 24) and now considering 15739/15775 (removed 36) transitions.
[2023-03-24 10:43:00] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
// Phase 1: matrix 14683 rows 8426 cols
[2023-03-24 10:43:01] [INFO ] Computed 1293 place invariants in 610 ms
[2023-03-24 10:43:02] [INFO ] Implicit Places using invariants in 1419 ms returned []
Implicit Place search using SMT only with invariants took 1426 ms to find 0 implicit places.
[2023-03-24 10:43:02] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
[2023-03-24 10:43:02] [INFO ] Invariant cache hit.
[2023-03-24 10:43:03] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8426/8450 places, 15739/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7629 ms. Remains : 8426/8450 places, 15739/15775 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1078 1) (GEQ s4459 1)), p1:(OR (LT s2272 1) (LT s8387 1) (AND (GEQ s1078 1) (GEQ s4459 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4722 reset in 1542 ms.
Product exploration explored 100000 steps with 4727 reset in 1494 ms.
Computed a total of 2410 stabilizing places and 3770 stable transitions
Computed a total of 2410 stabilizing places and 3770 stable transitions
Detected a total of 2410/8426 stabilizing places and 3770/15739 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 2550 steps, including 120 resets, run visited all 2 properties in 68 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 8426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8426/8426 places, 15739/15739 transitions.
Applied a total of 0 rules in 1333 ms. Remains 8426 /8426 variables (removed 0) and now considering 15739/15739 (removed 0) transitions.
[2023-03-24 10:43:08] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
[2023-03-24 10:43:08] [INFO ] Invariant cache hit.
[2023-03-24 10:43:09] [INFO ] Implicit Places using invariants in 770 ms returned []
Implicit Place search using SMT only with invariants took 785 ms to find 0 implicit places.
[2023-03-24 10:43:09] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
[2023-03-24 10:43:09] [INFO ] Invariant cache hit.
[2023-03-24 10:43:10] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2889 ms. Remains : 8426/8426 places, 15739/15739 transitions.
Computed a total of 2410 stabilizing places and 3770 stable transitions
Computed a total of 2410 stabilizing places and 3770 stable transitions
Detected a total of 2410/8426 stabilizing places and 3770/15739 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 3320 steps, including 156 resets, run visited all 2 properties in 99 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4724 reset in 1489 ms.
Product exploration explored 100000 steps with 4724 reset in 1502 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 8426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8426/8426 places, 15739/15739 transitions.
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 136 Pre rules applied. Total rules applied 0 place count 8426 transition count 15739
Deduced a syphon composed of 136 places in 12 ms
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 8426 transition count 15739
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 12 ms
Iterating global reduction 0 with 33 rules applied. Total rules applied 169 place count 8426 transition count 15739
Deduced a syphon composed of 169 places in 11 ms
Applied a total of 169 rules in 5972 ms. Remains 8426 /8426 variables (removed 0) and now considering 15739/15739 (removed 0) transitions.
[2023-03-24 10:43:20] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
// Phase 1: matrix 14683 rows 8426 cols
[2023-03-24 10:43:21] [INFO ] Computed 1293 place invariants in 715 ms
[2023-03-24 10:43:22] [INFO ] Dead Transitions using invariants and state equation in 1516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8426/8426 places, 15739/15739 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7503 ms. Remains : 8426/8426 places, 15739/15739 transitions.
Support contains 4 out of 8426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8426/8426 places, 15739/15739 transitions.
Applied a total of 0 rules in 2201 ms. Remains 8426 /8426 variables (removed 0) and now considering 15739/15739 (removed 0) transitions.
[2023-03-24 10:43:24] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
// Phase 1: matrix 14683 rows 8426 cols
[2023-03-24 10:43:25] [INFO ] Computed 1293 place invariants in 639 ms
[2023-03-24 10:43:26] [INFO ] Implicit Places using invariants in 1432 ms returned []
Implicit Place search using SMT only with invariants took 1436 ms to find 0 implicit places.
[2023-03-24 10:43:26] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
[2023-03-24 10:43:26] [INFO ] Invariant cache hit.
[2023-03-24 10:43:26] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4463 ms. Remains : 8426/8426 places, 15739/15739 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06 finished in 32512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||((p1 U p2)&&F(p3))))'
Support contains 6 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 8442 transition count 15765
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 8442 transition count 15765
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 8436 transition count 15754
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 8436 transition count 15754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 8435 transition count 15752
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 8435 transition count 15752
Applied a total of 30 rules in 9522 ms. Remains 8435 /8450 variables (removed 15) and now considering 15752/15775 (removed 23) transitions.
[2023-03-24 10:43:37] [INFO ] Flow matrix only has 14696 transitions (discarded 1056 similar events)
// Phase 1: matrix 14696 rows 8435 cols
[2023-03-24 10:43:38] [INFO ] Computed 1293 place invariants in 643 ms
[2023-03-24 10:43:39] [INFO ] Implicit Places using invariants in 1421 ms returned []
Implicit Place search using SMT only with invariants took 1433 ms to find 0 implicit places.
[2023-03-24 10:43:39] [INFO ] Flow matrix only has 14696 transitions (discarded 1056 similar events)
[2023-03-24 10:43:39] [INFO ] Invariant cache hit.
[2023-03-24 10:43:39] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8435/8450 places, 15752/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11764 ms. Remains : 8435/8450 places, 15752/15775 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s3420 1), p1:(AND (GEQ s3910 1) (GEQ s8430 1)), p3:(GEQ s7331 1), p0:(AND (GEQ s1959 1) (GEQ s2273 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-07 finished in 11973 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 8450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8450 transition count 15772
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8447 transition count 15772
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 135 Pre rules applied. Total rules applied 6 place count 8447 transition count 15637
Deduced a syphon composed of 135 places in 12 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 276 place count 8312 transition count 15637
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 285 place count 8303 transition count 15625
Iterating global reduction 2 with 9 rules applied. Total rules applied 294 place count 8303 transition count 15625
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 294 place count 8303 transition count 15624
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 8302 transition count 15624
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 302 place count 8296 transition count 15612
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 8296 transition count 15612
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 378 place count 8261 transition count 15577
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 381 place count 8258 transition count 15574
Iterating global reduction 2 with 3 rules applied. Total rules applied 384 place count 8258 transition count 15574
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 384 place count 8258 transition count 15572
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 388 place count 8256 transition count 15572
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 391 place count 8253 transition count 15566
Iterating global reduction 2 with 3 rules applied. Total rules applied 394 place count 8253 transition count 15566
Applied a total of 394 rules in 16408 ms. Remains 8253 /8450 variables (removed 197) and now considering 15566/15775 (removed 209) transitions.
[2023-03-24 10:43:56] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
// Phase 1: matrix 14510 rows 8253 cols
[2023-03-24 10:43:57] [INFO ] Computed 1293 place invariants in 643 ms
[2023-03-24 10:43:57] [INFO ] Implicit Places using invariants in 1415 ms returned []
Implicit Place search using SMT only with invariants took 1433 ms to find 0 implicit places.
[2023-03-24 10:43:57] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:43:57] [INFO ] Invariant cache hit.
[2023-03-24 10:43:58] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8253/8450 places, 15566/15775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18620 ms. Remains : 8253/8450 places, 15566/15775 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1900 1) (LT s4889 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6613 reset in 1772 ms.
Product exploration explored 100000 steps with 6615 reset in 1800 ms.
Computed a total of 2270 stabilizing places and 3630 stable transitions
Computed a total of 2270 stabilizing places and 3630 stable transitions
Detected a total of 2270/8253 stabilizing places and 3630/15566 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 100 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 8253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8253/8253 places, 15566/15566 transitions.
Applied a total of 0 rules in 3005 ms. Remains 8253 /8253 variables (removed 0) and now considering 15566/15566 (removed 0) transitions.
[2023-03-24 10:44:05] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:44:05] [INFO ] Invariant cache hit.
[2023-03-24 10:44:06] [INFO ] Implicit Places using invariants in 807 ms returned []
Implicit Place search using SMT only with invariants took 825 ms to find 0 implicit places.
[2023-03-24 10:44:06] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:44:06] [INFO ] Invariant cache hit.
[2023-03-24 10:44:07] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4598 ms. Remains : 8253/8253 places, 15566/15566 transitions.
Computed a total of 2270 stabilizing places and 3630 stable transitions
Computed a total of 2270 stabilizing places and 3630 stable transitions
Detected a total of 2270/8253 stabilizing places and 3630/15566 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 391 steps, including 26 resets, run visited all 1 properties in 9 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6617 reset in 1799 ms.
Product exploration explored 100000 steps with 6617 reset in 1830 ms.
Support contains 2 out of 8253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8253/8253 places, 15566/15566 transitions.
Applied a total of 0 rules in 3007 ms. Remains 8253 /8253 variables (removed 0) and now considering 15566/15566 (removed 0) transitions.
[2023-03-24 10:44:14] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:44:14] [INFO ] Invariant cache hit.
[2023-03-24 10:44:15] [INFO ] Implicit Places using invariants in 771 ms returned []
Implicit Place search using SMT only with invariants took 780 ms to find 0 implicit places.
[2023-03-24 10:44:15] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:44:15] [INFO ] Invariant cache hit.
[2023-03-24 10:44:16] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4569 ms. Remains : 8253/8253 places, 15566/15566 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-09 finished in 36707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 8439 transition count 15762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 8439 transition count 15762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 8430 transition count 15747
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 8430 transition count 15747
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 8427 transition count 15741
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 8427 transition count 15741
Applied a total of 46 rules in 9744 ms. Remains 8427 /8450 variables (removed 23) and now considering 15741/15775 (removed 34) transitions.
[2023-03-24 10:44:26] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
// Phase 1: matrix 14685 rows 8427 cols
[2023-03-24 10:44:27] [INFO ] Computed 1293 place invariants in 645 ms
[2023-03-24 10:44:27] [INFO ] Implicit Places using invariants in 1425 ms returned []
Implicit Place search using SMT only with invariants took 1427 ms to find 0 implicit places.
[2023-03-24 10:44:27] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
[2023-03-24 10:44:27] [INFO ] Invariant cache hit.
[2023-03-24 10:44:28] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8427/8450 places, 15741/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11979 ms. Remains : 8427/8450 places, 15741/15775 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-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: 2}]], initial=3, aps=[p0:(OR (LT s3899 1) (LT s8387 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11392 steps with 539 reset in 178 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-11 finished in 12310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 8438 transition count 15760
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 8438 transition count 15760
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 8429 transition count 15745
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 8429 transition count 15745
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 8426 transition count 15739
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 8426 transition count 15739
Applied a total of 48 rules in 9669 ms. Remains 8426 /8450 variables (removed 24) and now considering 15739/15775 (removed 36) transitions.
[2023-03-24 10:44:38] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
// Phase 1: matrix 14683 rows 8426 cols
[2023-03-24 10:44:39] [INFO ] Computed 1293 place invariants in 624 ms
[2023-03-24 10:44:40] [INFO ] Implicit Places using invariants in 1430 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-24 10:44:40] [INFO ] Flow matrix only has 14683 transitions (discarded 1056 similar events)
[2023-03-24 10:44:40] [INFO ] Invariant cache hit.
[2023-03-24 10:44:40] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8426/8450 places, 15739/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11912 ms. Remains : 8426/8450 places, 15739/15775 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s4186 1) (LT s6971 1) (LT s6973 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 4525 steps with 213 reset in 73 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-12 finished in 12107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(X(p1))))||p0)))'
Support contains 2 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 8439 transition count 15762
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 8439 transition count 15762
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 8430 transition count 15747
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 8430 transition count 15747
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 8427 transition count 15741
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 8427 transition count 15741
Applied a total of 46 rules in 10029 ms. Remains 8427 /8450 variables (removed 23) and now considering 15741/15775 (removed 34) transitions.
[2023-03-24 10:44:51] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
// Phase 1: matrix 14685 rows 8427 cols
[2023-03-24 10:44:51] [INFO ] Computed 1293 place invariants in 641 ms
[2023-03-24 10:44:52] [INFO ] Implicit Places using invariants in 1447 ms returned []
Implicit Place search using SMT only with invariants took 1457 ms to find 0 implicit places.
[2023-03-24 10:44:52] [INFO ] Flow matrix only has 14685 transitions (discarded 1056 similar events)
[2023-03-24 10:44:52] [INFO ] Invariant cache hit.
[2023-03-24 10:44:53] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8427/8450 places, 15741/15775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12249 ms. Remains : 8427/8450 places, 15741/15775 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s3817 1) (LT s8387 1)), p1:(AND (GEQ s3817 1) (GEQ s8387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13416 steps with 632 reset in 201 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-14 finished in 12686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 8450 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8450/8450 places, 15775/15775 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8450 transition count 15772
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8447 transition count 15772
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 135 Pre rules applied. Total rules applied 6 place count 8447 transition count 15637
Deduced a syphon composed of 135 places in 12 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 276 place count 8312 transition count 15637
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 285 place count 8303 transition count 15625
Iterating global reduction 2 with 9 rules applied. Total rules applied 294 place count 8303 transition count 15625
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 294 place count 8303 transition count 15624
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 8302 transition count 15624
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 302 place count 8296 transition count 15612
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 8296 transition count 15612
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 378 place count 8261 transition count 15577
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 381 place count 8258 transition count 15574
Iterating global reduction 2 with 3 rules applied. Total rules applied 384 place count 8258 transition count 15574
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 384 place count 8258 transition count 15572
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 388 place count 8256 transition count 15572
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 391 place count 8253 transition count 15566
Iterating global reduction 2 with 3 rules applied. Total rules applied 394 place count 8253 transition count 15566
Applied a total of 394 rules in 16161 ms. Remains 8253 /8450 variables (removed 197) and now considering 15566/15775 (removed 209) transitions.
[2023-03-24 10:45:10] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
// Phase 1: matrix 14510 rows 8253 cols
[2023-03-24 10:45:10] [INFO ] Computed 1293 place invariants in 652 ms
[2023-03-24 10:45:11] [INFO ] Implicit Places using invariants in 1487 ms returned []
Implicit Place search using SMT only with invariants took 1507 ms to find 0 implicit places.
[2023-03-24 10:45:11] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:45:11] [INFO ] Invariant cache hit.
[2023-03-24 10:45:12] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8253/8450 places, 15566/15775 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18439 ms. Remains : 8253/8450 places, 15566/15775 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1064 1) (GEQ s4355 1)), p1:(OR (LT s2244 1) (LT s8218 1) (AND (GEQ s1064 1) (GEQ s4355 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6619 reset in 1836 ms.
Product exploration explored 100000 steps with 6617 reset in 1827 ms.
Computed a total of 2270 stabilizing places and 3630 stable transitions
Computed a total of 2270 stabilizing places and 3630 stable transitions
Detected a total of 2270/8253 stabilizing places and 3630/15566 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 2186 steps, including 144 resets, run visited all 2 properties in 83 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 8253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8253/8253 places, 15566/15566 transitions.
Applied a total of 0 rules in 2541 ms. Remains 8253 /8253 variables (removed 0) and now considering 15566/15566 (removed 0) transitions.
[2023-03-24 10:45:19] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:45:19] [INFO ] Invariant cache hit.
[2023-03-24 10:45:20] [INFO ] Implicit Places using invariants in 776 ms returned []
Implicit Place search using SMT only with invariants took 782 ms to find 0 implicit places.
[2023-03-24 10:45:20] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:45:20] [INFO ] Invariant cache hit.
[2023-03-24 10:45:21] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4114 ms. Remains : 8253/8253 places, 15566/15566 transitions.
Computed a total of 2270 stabilizing places and 3630 stable transitions
Computed a total of 2270 stabilizing places and 3630 stable transitions
Detected a total of 2270/8253 stabilizing places and 3630/15566 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 2425 steps, including 160 resets, run visited all 2 properties in 63 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 6614 reset in 1800 ms.
Product exploration explored 100000 steps with 6610 reset in 1849 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 8253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8253/8253 places, 15566/15566 transitions.
Applied a total of 0 rules in 3005 ms. Remains 8253 /8253 variables (removed 0) and now considering 15566/15566 (removed 0) transitions.
[2023-03-24 10:45:29] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:45:29] [INFO ] Invariant cache hit.
[2023-03-24 10:45:30] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3788 ms. Remains : 8253/8253 places, 15566/15566 transitions.
Support contains 4 out of 8253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8253/8253 places, 15566/15566 transitions.
Applied a total of 0 rules in 2456 ms. Remains 8253 /8253 variables (removed 0) and now considering 15566/15566 (removed 0) transitions.
[2023-03-24 10:45:32] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:45:32] [INFO ] Invariant cache hit.
[2023-03-24 10:45:33] [INFO ] Implicit Places using invariants in 773 ms returned []
Implicit Place search using SMT only with invariants took 780 ms to find 0 implicit places.
[2023-03-24 10:45:33] [INFO ] Flow matrix only has 14510 transitions (discarded 1056 similar events)
[2023-03-24 10:45:33] [INFO ] Invariant cache hit.
[2023-03-24 10:45:34] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4018 ms. Remains : 8253/8253 places, 15566/15566 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06 finished in 41041 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)))'
[2023-03-24 10:45:35] [INFO ] Flatten gal took : 549 ms
[2023-03-24 10:45:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 10:45:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8450 places, 15775 transitions and 73655 arcs took 121 ms.
Total runtime 325981 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1258/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1258/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-09

BK_STOP 1679654771006

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-06
ltl formula formula --ltl=/tmp/1258/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 8450 places, 15775 transitions and 73655 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.640 real 0.650 user 0.510 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1258/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1258/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1258/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1258/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name MultiCrashLeafsetExtension-PT-S32C02-LTLFireability-09
ltl formula formula --ltl=/tmp/1258/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 8450 places, 15775 transitions and 73655 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.770 real 0.600 user 0.640 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1258/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1258/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1258/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1258/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-S32C02"
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-S32C02, 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-167856419500892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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