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-167856419500852.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-S24C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419500852
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 12K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 02:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K 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 26K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M 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-S24C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679638614113

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-S24C08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 06:16:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 06:16:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:16:56] [INFO ] Load time of PNML (sax parser for PT used): 526 ms
[2023-03-24 06:16:56] [INFO ] Transformed 15180 places.
[2023-03-24 06:16:56] [INFO ] Transformed 22267 transitions.
[2023-03-24 06:16:56] [INFO ] Parsed PT model containing 15180 places and 22267 transitions and 84086 arcs in 676 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 15180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 15136 transition count 22267
Applied a total of 44 rules in 715 ms. Remains 15136 /15180 variables (removed 44) and now considering 22267/22267 (removed 0) transitions.
[2023-03-24 06:16:57] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-24 06:16:59] [INFO ] Computed 1093 place invariants in 1811 ms
[2023-03-24 06:17:00] [INFO ] Implicit Places using invariants in 3373 ms returned []
Implicit Place search using SMT only with invariants took 3405 ms to find 0 implicit places.
[2023-03-24 06:17:00] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:17:00] [INFO ] Invariant cache hit.
[2023-03-24 06:17:02] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15136/15180 places, 22267/22267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5540 ms. Remains : 15136/15180 places, 22267/22267 transitions.
Support contains 43 out of 15136 places after structural reductions.
[2023-03-24 06:17:03] [INFO ] Flatten gal took : 959 ms
[2023-03-24 06:17:04] [INFO ] Flatten gal took : 654 ms
[2023-03-24 06:17:05] [INFO ] Input system was already deterministic with 22267 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 995 ms. (steps per millisecond=10 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-24 06:17:07] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:17:07] [INFO ] Invariant cache hit.
[2023-03-24 06:17:12] [INFO ] [Real]Absence check using 47 positive place invariants in 227 ms returned sat
[2023-03-24 06:17:13] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 609 ms returned sat
[2023-03-24 06:17:32] [INFO ] After 15182ms SMT Verify possible using state equation in real domain returned unsat :2 sat :14 real:3
[2023-03-24 06:17:32] [INFO ] State equation strengthened by 6802 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 06:17:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:17:32] [INFO ] After 25149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 15136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4760 transitions
Trivial Post-agglo rules discarded 4760 transitions
Performed 4760 trivial Post agglomeration. Transition count delta: 4760
Iterating post reduction 0 with 4760 rules applied. Total rules applied 4760 place count 15136 transition count 17507
Reduce places removed 4760 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 4796 rules applied. Total rules applied 9556 place count 10376 transition count 17471
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 9592 place count 10340 transition count 17471
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 397 Pre rules applied. Total rules applied 9592 place count 10340 transition count 17074
Deduced a syphon composed of 397 places in 13 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 10386 place count 9943 transition count 17074
Discarding 4393 places :
Symmetric choice reduction at 3 with 4393 rule applications. Total rules 14779 place count 5550 transition count 12681
Iterating global reduction 3 with 4393 rules applied. Total rules applied 19172 place count 5550 transition count 12681
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19172 place count 5550 transition count 12672
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 19190 place count 5541 transition count 12672
Discarding 537 places :
Symmetric choice reduction at 3 with 537 rule applications. Total rules 19727 place count 5004 transition count 8376
Iterating global reduction 3 with 537 rules applied. Total rules applied 20264 place count 5004 transition count 8376
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20314 place count 4979 transition count 8351
Free-agglomeration rule (complex) applied 343 times.
Iterating global reduction 3 with 343 rules applied. Total rules applied 20657 place count 4979 transition count 11767
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 3 with 343 rules applied. Total rules applied 21000 place count 4636 transition count 11767
Partial Free-agglomeration rule applied 172 times.
Drop transitions removed 172 transitions
Iterating global reduction 4 with 172 rules applied. Total rules applied 21172 place count 4636 transition count 11767
Applied a total of 21172 rules in 5473 ms. Remains 4636 /15136 variables (removed 10500) and now considering 11767/22267 (removed 10500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5477 ms. Remains : 4636/15136 places, 11767/22267 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 766 ms. (steps per millisecond=13 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-24 06:17:38] [INFO ] Flow matrix only has 10881 transitions (discarded 886 similar events)
// Phase 1: matrix 10881 rows 4636 cols
[2023-03-24 06:17:39] [INFO ] Computed 1093 place invariants in 308 ms
[2023-03-24 06:17:40] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-24 06:17:40] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 289 ms returned sat
[2023-03-24 06:17:52] [INFO ] After 10810ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2023-03-24 06:17:52] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2023-03-24 06:17:54] [INFO ] After 1390ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-24 06:17:54] [INFO ] After 15048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-24 06:17:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 06:17:56] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 302 ms returned sat
[2023-03-24 06:18:08] [INFO ] After 11593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-24 06:18:19] [INFO ] After 10605ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :1 sat :13
[2023-03-24 06:18:19] [INFO ] After 10606ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-24 06:18:19] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 25 out of 4636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4636/4636 places, 11767/11767 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 4636 transition count 11766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4635 transition count 11766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4635 transition count 11765
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4634 transition count 11765
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 4633 transition count 11764
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 4633 transition count 11764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 4633 transition count 11763
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4632 transition count 11763
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4632 transition count 11761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 4630 transition count 11761
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 4629 transition count 11760
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 4629 transition count 11760
Applied a total of 14 rules in 2093 ms. Remains 4629 /4636 variables (removed 7) and now considering 11760/11767 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2093 ms. Remains : 4629/4636 places, 11760/11767 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 727 ms. (steps per millisecond=13 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-24 06:18:23] [INFO ] Flow matrix only has 10874 transitions (discarded 886 similar events)
// Phase 1: matrix 10874 rows 4629 cols
[2023-03-24 06:18:23] [INFO ] Computed 1093 place invariants in 323 ms
[2023-03-24 06:18:25] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2023-03-24 06:18:25] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 289 ms returned sat
[2023-03-24 06:18:26] [INFO ] After 2323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-24 06:18:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2023-03-24 06:18:27] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 308 ms returned sat
[2023-03-24 06:18:39] [INFO ] After 10797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-24 06:18:39] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2023-03-24 06:18:51] [INFO ] After 11916ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-24 06:18:51] [INFO ] After 11918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-24 06:18:51] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 92 ms.
Support contains 20 out of 4629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4629/4629 places, 11760/11760 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 4629 transition count 11759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4628 transition count 11759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4628 transition count 11758
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4627 transition count 11758
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 4626 transition count 11757
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 4626 transition count 11757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 4626 transition count 11756
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4625 transition count 11756
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4625 transition count 11754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 4623 transition count 11754
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 4622 transition count 11753
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 4622 transition count 11753
Applied a total of 14 rules in 1996 ms. Remains 4622 /4629 variables (removed 7) and now considering 11753/11760 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1996 ms. Remains : 4622/4629 places, 11753/11760 transitions.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12512 stabilizing places and 17066 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4800 transitions
Trivial Post-agglo rules discarded 4800 transitions
Performed 4800 trivial Post agglomeration. Transition count delta: 4800
Iterating post reduction 0 with 4800 rules applied. Total rules applied 4800 place count 15136 transition count 17467
Reduce places removed 4800 places and 0 transitions.
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17067
Deduced a syphon composed of 400 places in 14 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10400 place count 9936 transition count 17067
Discarding 4400 places :
Symmetric choice reduction at 2 with 4400 rule applications. Total rules 14800 place count 5536 transition count 12667
Iterating global reduction 2 with 4400 rules applied. Total rules applied 19200 place count 5536 transition count 12667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19200 place count 5536 transition count 12651
Deduced a syphon composed of 16 places in 9 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 19232 place count 5520 transition count 12651
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19781 place count 4971 transition count 8259
Iterating global reduction 2 with 549 rules applied. Total rules applied 20330 place count 4971 transition count 8259
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20380 place count 4946 transition count 8234
Applied a total of 20380 rules in 2792 ms. Remains 4946 /15136 variables (removed 10190) and now considering 8234/22267 (removed 14033) transitions.
[2023-03-24 06:18:56] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
// Phase 1: matrix 7634 rows 4946 cols
[2023-03-24 06:18:56] [INFO ] Computed 1093 place invariants in 240 ms
[2023-03-24 06:19:01] [INFO ] Implicit Places using invariants in 4571 ms returned []
[2023-03-24 06:19:01] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-24 06:19:01] [INFO ] Invariant cache hit.
[2023-03-24 06:19:05] [INFO ] Implicit Places using invariants and state equation in 4194 ms returned []
Implicit Place search using SMT with State Equation took 8769 ms to find 0 implicit places.
[2023-03-24 06:19:06] [INFO ] Redundant transitions in 1252 ms returned []
[2023-03-24 06:19:06] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-24 06:19:06] [INFO ] Invariant cache hit.
[2023-03-24 06:19:12] [INFO ] Dead Transitions using invariants and state equation in 5606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4946/15136 places, 8234/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18431 ms. Remains : 4946/15136 places, 8234/22267 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s116 1) (GEQ s4675 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 finished in 18750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G((p1||X(p1)))&&F(p2)))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 429 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-24 06:19:12] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-24 06:19:14] [INFO ] Computed 1093 place invariants in 1569 ms
[2023-03-24 06:19:15] [INFO ] Implicit Places using invariants in 3028 ms returned []
Implicit Place search using SMT only with invariants took 3035 ms to find 0 implicit places.
[2023-03-24 06:19:15] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:19:15] [INFO ] Invariant cache hit.
[2023-03-24 06:19:17] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4869 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (NOT p2), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1479 1) (GEQ s13817 1)), p1:(GEQ s1836 1), p2:(AND (GEQ s886 1) (GEQ s11290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 14 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 finished in 5227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 447 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-24 06:19:18] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:19:18] [INFO ] Invariant cache hit.
[2023-03-24 06:19:19] [INFO ] Implicit Places using invariants in 1478 ms returned []
Implicit Place search using SMT only with invariants took 1480 ms to find 0 implicit places.
[2023-03-24 06:19:19] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:19:19] [INFO ] Invariant cache hit.
[2023-03-24 06:19:20] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3338 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s13152 1) (GEQ s13198 1) (OR (LT s6080 1) (LT s14769 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 finished in 3588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p0))))))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 436 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-24 06:19:21] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:19:21] [INFO ] Invariant cache hit.
[2023-03-24 06:19:23] [INFO ] Implicit Places using invariants in 1439 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-24 06:19:23] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:19:23] [INFO ] Invariant cache hit.
[2023-03-24 06:19:24] [INFO ] Dead Transitions using invariants and state equation in 1310 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3191 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s10628 1), p0:(AND (GEQ s9539 1) (GEQ s9606 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 finished in 3419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(G(p2))))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4787 transitions
Trivial Post-agglo rules discarded 4787 transitions
Performed 4787 trivial Post agglomeration. Transition count delta: 4787
Iterating post reduction 0 with 4787 rules applied. Total rules applied 4787 place count 15136 transition count 17480
Reduce places removed 4787 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9586 place count 10349 transition count 17468
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 13 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 19767 place count 4979 transition count 8281
Iterating global reduction 3 with 547 rules applied. Total rules applied 20314 place count 4979 transition count 8281
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20364 place count 4954 transition count 8256
Applied a total of 20364 rules in 2757 ms. Remains 4954 /15136 variables (removed 10182) and now considering 8256/22267 (removed 14011) transitions.
[2023-03-24 06:19:27] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2023-03-24 06:19:27] [INFO ] Computed 1093 place invariants in 201 ms
[2023-03-24 06:19:31] [INFO ] Implicit Places using invariants in 4527 ms returned []
[2023-03-24 06:19:31] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:19:31] [INFO ] Invariant cache hit.
[2023-03-24 06:19:37] [INFO ] Implicit Places using invariants and state equation in 5558 ms returned []
Implicit Place search using SMT with State Equation took 10087 ms to find 0 implicit places.
[2023-03-24 06:19:38] [INFO ] Redundant transitions in 947 ms returned []
[2023-03-24 06:19:38] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:19:38] [INFO ] Invariant cache hit.
[2023-03-24 06:19:44] [INFO ] Dead Transitions using invariants and state equation in 5570 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4954/15136 places, 8256/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19376 ms. Remains : 4954/15136 places, 8256/22267 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2371 1), p1:(AND (GEQ s1780 1) (GEQ s4843 1)), p2:(AND (GEQ s1145 1) (GEQ s1152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1676 reset in 1448 ms.
Product exploration explored 100000 steps with 1674 reset in 1376 ms.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 466 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:19:47] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:19:47] [INFO ] Invariant cache hit.
[2023-03-24 06:19:48] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2023-03-24 06:19:48] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 329 ms returned sat
[2023-03-24 06:19:48] [INFO ] After 962ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 501 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 4954 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Applied a total of 0 rules in 548 ms. Remains 4954 /4954 variables (removed 0) and now considering 8256/8256 (removed 0) transitions.
[2023-03-24 06:19:50] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:19:50] [INFO ] Invariant cache hit.
[2023-03-24 06:19:55] [INFO ] Implicit Places using invariants in 5425 ms returned []
[2023-03-24 06:19:55] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:19:55] [INFO ] Invariant cache hit.
[2023-03-24 06:20:00] [INFO ] Implicit Places using invariants and state equation in 5315 ms returned []
Implicit Place search using SMT with State Equation took 10744 ms to find 0 implicit places.
[2023-03-24 06:20:01] [INFO ] Redundant transitions in 679 ms returned []
[2023-03-24 06:20:01] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:20:01] [INFO ] Invariant cache hit.
[2023-03-24 06:20:06] [INFO ] Dead Transitions using invariants and state equation in 5092 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17077 ms. Remains : 4954/4954 places, 8256/8256 transitions.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 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 based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24231 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24231 steps, saw 11393 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:20:10] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-24 06:20:10] [INFO ] Invariant cache hit.
[2023-03-24 06:20:10] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-24 06:20:10] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 325 ms returned sat
[2023-03-24 06:20:11] [INFO ] After 980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:20:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2023-03-24 06:20:11] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 333 ms returned sat
[2023-03-24 06:20:16] [INFO ] After 4652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:20:16] [INFO ] State equation strengthened by 2973 read => feed constraints.
[2023-03-24 06:20:18] [INFO ] After 1487ms SMT Verify possible using 2973 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:20:23] [INFO ] Deduced a trap composed of 684 places in 5506 ms of which 8 ms to minimize.
[2023-03-24 06:20:29] [INFO ] Deduced a trap composed of 368 places in 5209 ms of which 5 ms to minimize.
[2023-03-24 06:20:35] [INFO ] Deduced a trap composed of 547 places in 5284 ms of which 13 ms to minimize.
[2023-03-24 06:20:41] [INFO ] Deduced a trap composed of 486 places in 5266 ms of which 5 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 06:20:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:20:41] [INFO ] After 29936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 347 place count 4949 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 684 place count 4612 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 709 place count 4612 transition count 11743
Applied a total of 709 rules in 2932 ms. Remains 4612 /4954 variables (removed 342) and now considering 11743/8256 (removed -3487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2932 ms. Remains : 4612/4954 places, 11743/8256 transitions.
Finished random walk after 5754 steps, including 116 resets, run visited all 1 properties in 282 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1672 reset in 1226 ms.
Product exploration explored 100000 steps with 1675 reset in 1243 ms.
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Applied a total of 10 rules in 1412 ms. Remains 4949 /4954 variables (removed 5) and now considering 8237/8256 (removed 19) transitions.
[2023-03-24 06:20:48] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2023-03-24 06:20:48] [INFO ] Computed 1093 place invariants in 214 ms
[2023-03-24 06:20:53] [INFO ] Implicit Places using invariants in 4486 ms returned []
[2023-03-24 06:20:53] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-24 06:20:53] [INFO ] Invariant cache hit.
[2023-03-24 06:20:57] [INFO ] Implicit Places using invariants and state equation in 4122 ms returned []
Implicit Place search using SMT with State Equation took 8611 ms to find 0 implicit places.
[2023-03-24 06:20:57] [INFO ] Redundant transitions in 708 ms returned []
[2023-03-24 06:20:57] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-24 06:20:57] [INFO ] Invariant cache hit.
[2023-03-24 06:21:03] [INFO ] Dead Transitions using invariants and state equation in 5270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/4954 places, 8237/8256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16013 ms. Remains : 4949/4954 places, 8237/8256 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 finished in 99644 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((F(p1)&&p0)))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4800 transitions
Trivial Post-agglo rules discarded 4800 transitions
Performed 4800 trivial Post agglomeration. Transition count delta: 4800
Iterating post reduction 0 with 4800 rules applied. Total rules applied 4800 place count 15136 transition count 17467
Reduce places removed 4800 places and 0 transitions.
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17067
Deduced a syphon composed of 400 places in 14 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10400 place count 9936 transition count 17067
Discarding 4400 places :
Symmetric choice reduction at 2 with 4400 rule applications. Total rules 14800 place count 5536 transition count 12667
Iterating global reduction 2 with 4400 rules applied. Total rules applied 19200 place count 5536 transition count 12667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19200 place count 5536 transition count 12651
Deduced a syphon composed of 16 places in 10 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 19232 place count 5520 transition count 12651
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 19782 place count 4970 transition count 8251
Iterating global reduction 2 with 550 rules applied. Total rules applied 20332 place count 4970 transition count 8251
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20382 place count 4945 transition count 8226
Applied a total of 20382 rules in 2703 ms. Remains 4945 /15136 variables (removed 10191) and now considering 8226/22267 (removed 14041) transitions.
[2023-03-24 06:21:06] [INFO ] Flow matrix only has 7626 transitions (discarded 600 similar events)
// Phase 1: matrix 7626 rows 4945 cols
[2023-03-24 06:21:07] [INFO ] Computed 1093 place invariants in 204 ms
[2023-03-24 06:21:11] [INFO ] Implicit Places using invariants in 4173 ms returned []
[2023-03-24 06:21:11] [INFO ] Flow matrix only has 7626 transitions (discarded 600 similar events)
[2023-03-24 06:21:11] [INFO ] Invariant cache hit.
[2023-03-24 06:21:15] [INFO ] Implicit Places using invariants and state equation in 4578 ms returned []
Implicit Place search using SMT with State Equation took 8753 ms to find 0 implicit places.
[2023-03-24 06:21:16] [INFO ] Redundant transitions in 696 ms returned []
[2023-03-24 06:21:16] [INFO ] Flow matrix only has 7626 transitions (discarded 600 similar events)
[2023-03-24 06:21:16] [INFO ] Invariant cache hit.
[2023-03-24 06:21:21] [INFO ] Dead Transitions using invariants and state equation in 5050 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4945/15136 places, 8226/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17219 ms. Remains : 4945/15136 places, 8226/22267 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s2302 1) (LT s3581 1)), p0:(AND (GEQ s800 1) (GEQ s3352 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, null][true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 finished in 17357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 432 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-24 06:21:22] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-24 06:21:23] [INFO ] Computed 1093 place invariants in 1536 ms
[2023-03-24 06:21:25] [INFO ] Implicit Places using invariants in 2959 ms returned []
Implicit Place search using SMT only with invariants took 2960 ms to find 0 implicit places.
[2023-03-24 06:21:25] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:21:25] [INFO ] Invariant cache hit.
[2023-03-24 06:21:26] [INFO ] Dead Transitions using invariants and state equation in 1525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4920 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s9295 1) (LT s14876 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 84720 steps with 42360 reset in 10002 ms.
Product exploration timeout after 83270 steps with 41635 reset in 10002 ms.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Computed a total of 12512 stabilizing places and 17066 stable transitions
Detected a total of 12512/15136 stabilizing places and 17066/22267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 finished in 25258 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)&&G(F(p1))))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17068
Deduced a syphon composed of 400 places in 14 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 9 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 2 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Applied a total of 20374 rules in 2689 ms. Remains 4949 /15136 variables (removed 10187) and now considering 8237/22267 (removed 14030) transitions.
[2023-03-24 06:21:49] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2023-03-24 06:21:49] [INFO ] Computed 1093 place invariants in 220 ms
[2023-03-24 06:21:55] [INFO ] Implicit Places using invariants in 5621 ms returned []
[2023-03-24 06:21:55] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-24 06:21:55] [INFO ] Invariant cache hit.
[2023-03-24 06:22:00] [INFO ] Implicit Places using invariants and state equation in 5511 ms returned []
Implicit Place search using SMT with State Equation took 11136 ms to find 0 implicit places.
[2023-03-24 06:22:01] [INFO ] Redundant transitions in 709 ms returned []
[2023-03-24 06:22:01] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-24 06:22:01] [INFO ] Invariant cache hit.
[2023-03-24 06:22:07] [INFO ] Dead Transitions using invariants and state equation in 5843 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/15136 places, 8237/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20385 ms. Remains : 4949/15136 places, 8237/22267 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1850 1), p1:(AND (GEQ s2832 1) (GEQ s4406 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 finished in 20595 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 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4800 transitions
Trivial Post-agglo rules discarded 4800 transitions
Performed 4800 trivial Post agglomeration. Transition count delta: 4800
Iterating post reduction 0 with 4800 rules applied. Total rules applied 4800 place count 15136 transition count 17467
Reduce places removed 4800 places and 0 transitions.
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17067
Deduced a syphon composed of 400 places in 14 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10400 place count 9936 transition count 17067
Discarding 4400 places :
Symmetric choice reduction at 2 with 4400 rule applications. Total rules 14800 place count 5536 transition count 12667
Iterating global reduction 2 with 4400 rules applied. Total rules applied 19200 place count 5536 transition count 12667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19200 place count 5536 transition count 12651
Deduced a syphon composed of 16 places in 9 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 19232 place count 5520 transition count 12651
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19781 place count 4971 transition count 8259
Iterating global reduction 2 with 549 rules applied. Total rules applied 20330 place count 4971 transition count 8259
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20380 place count 4946 transition count 8234
Applied a total of 20380 rules in 2696 ms. Remains 4946 /15136 variables (removed 10190) and now considering 8234/22267 (removed 14033) transitions.
[2023-03-24 06:22:10] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
// Phase 1: matrix 7634 rows 4946 cols
[2023-03-24 06:22:10] [INFO ] Computed 1093 place invariants in 206 ms
[2023-03-24 06:22:15] [INFO ] Implicit Places using invariants in 5208 ms returned []
[2023-03-24 06:22:15] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-24 06:22:15] [INFO ] Invariant cache hit.
[2023-03-24 06:22:20] [INFO ] Implicit Places using invariants and state equation in 5039 ms returned []
Implicit Place search using SMT with State Equation took 10252 ms to find 0 implicit places.
[2023-03-24 06:22:21] [INFO ] Redundant transitions in 907 ms returned []
[2023-03-24 06:22:21] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-24 06:22:21] [INFO ] Invariant cache hit.
[2023-03-24 06:22:26] [INFO ] Dead Transitions using invariants and state equation in 5140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4946/15136 places, 8234/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19004 ms. Remains : 4946/15136 places, 8234/22267 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2633 1) (GEQ s4945 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 finished in 19096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p1||G(p2)))))'
Support contains 6 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 438 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-24 06:22:27] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-24 06:22:28] [INFO ] Computed 1093 place invariants in 1556 ms
[2023-03-24 06:22:30] [INFO ] Implicit Places using invariants in 3072 ms returned []
Implicit Place search using SMT only with invariants took 3082 ms to find 0 implicit places.
[2023-03-24 06:22:30] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-24 06:22:30] [INFO ] Invariant cache hit.
[2023-03-24 06:22:31] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4868 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3151 1) (GEQ s3399 1)), p0:(AND (GEQ s9895 1) (GEQ s15011 1)), p2:(AND (GEQ s9045 1) (GEQ s15092 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 finished in 5096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(G(p2))))))'
[2023-03-24 06:22:32] [INFO ] Flatten gal took : 649 ms
[2023-03-24 06:22:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 06:22:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15136 places, 22267 transitions and 84042 arcs took 94 ms.
Total runtime 336998 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/974/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07

BK_STOP 1679638988858

--------------------
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-S24C08-LTLFireability-07
ltl formula formula --ltl=/tmp/974/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 15136 places, 22267 transitions and 84042 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.630 real 0.810 user 0.990 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/974/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/974/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/974/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/974/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

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