Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716655889625

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 16:51:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:51:31] [INFO ] Load time of PNML (sax parser for PT used): 594 ms
[2024-05-25 16:51:33] [INFO ] Transformed 18180 places.
[2024-05-25 16:51:33] [INFO ] Transformed 28411 transitions.
[2024-05-25 16:51:33] [INFO ] Parsed PT model containing 18180 places and 28411 transitions and 115534 arcs in 1983 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 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 18180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18180/18180 places, 28411/28411 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 18136 transition count 28411
Applied a total of 44 rules in 1880 ms. Remains 18136 /18180 variables (removed 44) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 16:51:35] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18136 cols
[2024-05-25 16:51:37] [INFO ] Computed 1429 invariants in 2418 ms
[2024-05-25 16:51:39] [INFO ] Implicit Places using invariants in 4195 ms returned []
Implicit Place search using SMT only with invariants took 4220 ms to find 0 implicit places.
[2024-05-25 16:51:39] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 16:51:39] [INFO ] Invariant cache hit.
[2024-05-25 16:51:41] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 18136/18180 places, 28411/28411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7649 ms. Remains : 18136/18180 places, 28411/28411 transitions.
Support contains 68 out of 18136 places after structural reductions.
[2024-05-25 16:51:42] [INFO ] Flatten gal took : 1071 ms
[2024-05-25 16:51:43] [INFO ] Flatten gal took : 777 ms
[2024-05-25 16:51:44] [INFO ] Input system was already deterministic with 28411 transitions.
Incomplete random walk after 10000 steps, including 242 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 31) seen :4
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-25 16:51:47] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 16:51:47] [INFO ] Invariant cache hit.
[2024-05-25 16:51:54] [INFO ] [Real]Absence check using 63 positive place invariants in 276 ms returned sat
[2024-05-25 16:51:55] [INFO ] [Real]Absence check using 63 positive and 1366 generalized place invariants in 967 ms returned sat
[2024-05-25 16:52:00] [INFO ] After 13892ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:22
[2024-05-25 16:52:07] [INFO ] [Nat]Absence check using 63 positive place invariants in 264 ms returned sat
[2024-05-25 16:52:08] [INFO ] [Nat]Absence check using 63 positive and 1366 generalized place invariants in 991 ms returned sat
[2024-05-25 16:52:25] [INFO ] After 12382ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2024-05-25 16:52:26] [INFO ] State equation strengthened by 9154 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:52:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:52:26] [INFO ] After 25177ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:22
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 43 out of 18136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Drop transitions removed 4191 transitions
Trivial Post-agglo rules discarded 4191 transitions
Performed 4191 trivial Post agglomeration. Transition count delta: 4191
Iterating post reduction 0 with 4191 rules applied. Total rules applied 4191 place count 18136 transition count 24220
Reduce places removed 4191 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 4223 rules applied. Total rules applied 8414 place count 13945 transition count 24188
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 8446 place count 13913 transition count 24188
Performed 262 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 262 Pre rules applied. Total rules applied 8446 place count 13913 transition count 23926
Deduced a syphon composed of 262 places in 23 ms
Reduce places removed 262 places and 0 transitions.
Iterating global reduction 3 with 524 rules applied. Total rules applied 8970 place count 13651 transition count 23926
Discarding 3957 places :
Symmetric choice reduction at 3 with 3957 rule applications. Total rules 12927 place count 9694 transition count 19969
Iterating global reduction 3 with 3957 rules applied. Total rules applied 16884 place count 9694 transition count 19969
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 16884 place count 9694 transition count 19964
Deduced a syphon composed of 5 places in 17 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16894 place count 9689 transition count 19964
Discarding 985 places :
Symmetric choice reduction at 3 with 985 rule applications. Total rules 17879 place count 8704 transition count 16024
Iterating global reduction 3 with 985 rules applied. Total rules applied 18864 place count 8704 transition count 16024
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 13 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 18928 place count 8672 transition count 15992
Free-agglomeration rule (complex) applied 553 times.
Iterating global reduction 3 with 553 rules applied. Total rules applied 19481 place count 8672 transition count 18394
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 3 with 553 rules applied. Total rules applied 20034 place count 8119 transition count 18394
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 4 with 97 rules applied. Total rules applied 20131 place count 8119 transition count 18394
Applied a total of 20131 rules in 14090 ms. Remains 8119 /18136 variables (removed 10017) and now considering 18394/28411 (removed 10017) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14094 ms. Remains : 8119/18136 places, 18394/28411 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 3 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 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 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 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 12287 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12287 steps, saw 5721 distinct states, run finished after 3002 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 20 properties.
[2024-05-25 16:52:44] [INFO ] Flow matrix only has 16853 transitions (discarded 1541 similar events)
// Phase 1: matrix 16853 rows 8119 cols
[2024-05-25 16:52:44] [INFO ] Computed 1429 invariants in 792 ms
[2024-05-25 16:52:47] [INFO ] [Real]Absence check using 65 positive place invariants in 131 ms returned sat
[2024-05-25 16:52:48] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 531 ms returned sat
[2024-05-25 16:53:10] [INFO ] After 19289ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:10
[2024-05-25 16:53:10] [INFO ] State equation strengthened by 9154 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:53:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:53:10] [INFO ] After 25220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 37 out of 8119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8119/8119 places, 18394/18394 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 8119 transition count 18393
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8118 transition count 18393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8117 transition count 18392
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8117 transition count 18392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 8117 transition count 18391
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 8116 transition count 18391
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 8116 transition count 18390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 8115 transition count 18390
Applied a total of 8 rules in 4997 ms. Remains 8115 /8119 variables (removed 4) and now considering 18390/18394 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4999 ms. Remains : 8115/8119 places, 18390/18394 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-25 16:53:16] [INFO ] Flow matrix only has 16849 transitions (discarded 1541 similar events)
// Phase 1: matrix 16849 rows 8115 cols
[2024-05-25 16:53:16] [INFO ] Computed 1429 invariants in 773 ms
[2024-05-25 16:53:19] [INFO ] [Real]Absence check using 65 positive place invariants in 134 ms returned sat
[2024-05-25 16:53:20] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 485 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 16:53:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:53:42] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 8115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8115/8115 places, 18390/18390 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 8115 transition count 18389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8114 transition count 18389
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8114 transition count 18387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 8112 transition count 18387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 8111 transition count 18386
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 8111 transition count 18386
Applied a total of 8 rules in 5083 ms. Remains 8111 /8115 variables (removed 4) and now considering 18386/18390 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5083 ms. Remains : 8111/8115 places, 18386/18390 transitions.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12120 stabilizing places and 16442 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 18136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Drop transitions removed 4224 transitions
Trivial Post-agglo rules discarded 4224 transitions
Performed 4224 trivial Post agglomeration. Transition count delta: 4224
Iterating post reduction 0 with 4224 rules applied. Total rules applied 4224 place count 18136 transition count 24187
Reduce places removed 4224 places and 0 transitions.
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8448 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8448 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 18 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8976 place count 13648 transition count 23923
Discarding 3960 places :
Symmetric choice reduction at 2 with 3960 rule applications. Total rules 12936 place count 9688 transition count 19963
Iterating global reduction 2 with 3960 rules applied. Total rules applied 16896 place count 9688 transition count 19963
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16896 place count 9688 transition count 19955
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 16912 place count 9680 transition count 19955
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 17902 place count 8690 transition count 15995
Iterating global reduction 2 with 990 rules applied. Total rules applied 18892 place count 8690 transition count 15995
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 14 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 18958 place count 8657 transition count 15962
Applied a total of 18958 rules in 8033 ms. Remains 8657 /18136 variables (removed 9479) and now considering 15962/28411 (removed 12449) transitions.
[2024-05-25 16:53:55] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2024-05-25 16:53:56] [INFO ] Computed 1429 invariants in 716 ms
[2024-05-25 16:53:56] [INFO ] Implicit Places using invariants in 1462 ms returned []
Implicit Place search using SMT only with invariants took 1464 ms to find 0 implicit places.
[2024-05-25 16:53:56] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 16:53:57] [INFO ] Invariant cache hit.
[2024-05-25 16:53:57] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8657/18136 places, 15962/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10260 ms. Remains : 8657/18136 places, 15962/28411 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-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:(OR (LT s1144 1) (LT s4909 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]]
Product exploration explored 100000 steps with 3422 reset in 1887 ms.
Product exploration explored 100000 steps with 3416 reset in 1808 ms.
Computed a total of 2674 stabilizing places and 4026 stable transitions
Computed a total of 2674 stabilizing places and 4026 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 341 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13334 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13334 steps, saw 6294 distinct states, run finished after 3003 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:54:05] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 16:54:05] [INFO ] Invariant cache hit.
[2024-05-25 16:54:06] [INFO ] [Real]Absence check using 65 positive place invariants in 142 ms returned sat
[2024-05-25 16:54:06] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 495 ms returned sat
[2024-05-25 16:54:16] [INFO ] After 11826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:54:17] [INFO ] [Nat]Absence check using 65 positive place invariants in 145 ms returned sat
[2024-05-25 16:54:18] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 513 ms returned sat
[2024-05-25 16:54:28] [INFO ] After 10359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:54:29] [INFO ] State equation strengthened by 6184 read => feed constraints.
[2024-05-25 16:54:38] [INFO ] After 9377ms SMT Verify possible using 6184 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:54:38] [INFO ] After 21411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 8657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8657/8657 places, 15962/15962 transitions.
Free-agglomeration rule (complex) applied 575 times.
Iterating global reduction 0 with 575 rules applied. Total rules applied 575 place count 8657 transition count 18357
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 0 with 575 rules applied. Total rules applied 1150 place count 8082 transition count 18357
Applied a total of 1150 rules in 4292 ms. Remains 8082 /8657 variables (removed 575) and now considering 18357/15962 (removed -2395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4293 ms. Remains : 8082/8657 places, 18357/15962 transitions.
Incomplete random walk after 10000 steps, including 398 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13404 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13404 steps, saw 6230 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:54:46] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 16:54:46] [INFO ] Computed 1429 invariants in 712 ms
[2024-05-25 16:54:47] [INFO ] [Real]Absence check using 65 positive place invariants in 115 ms returned sat
[2024-05-25 16:54:48] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 487 ms returned sat
[2024-05-25 16:54:48] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:54:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 113 ms returned sat
[2024-05-25 16:54:49] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 498 ms returned sat
[2024-05-25 16:55:00] [INFO ] After 10568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:55:00] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 16:55:10] [INFO ] After 9689ms SMT Verify possible using 9154 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:55:10] [INFO ] After 21820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1850 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1850 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1833 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
[2024-05-25 16:55:13] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 16:55:13] [INFO ] Invariant cache hit.
[2024-05-25 16:55:14] [INFO ] Implicit Places using invariants in 739 ms returned []
Implicit Place search using SMT only with invariants took 740 ms to find 0 implicit places.
[2024-05-25 16:55:14] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 16:55:14] [INFO ] Invariant cache hit.
[2024-05-25 16:55:15] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3302 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Graph (trivial) has 6948 edges and 8082 vertex of which 33 / 8082 are part of one of the 1 SCC in 5 ms
Free SCC test removed 32 places
Drop transitions removed 1115 transitions
Ensure Unique test removed 1506 transitions
Reduce isomorphic transitions removed 2621 transitions.
Graph (complete) has 45916 edges and 8050 vertex of which 8020 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 641 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12909.t14229 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 451 rules applied. Total rules applied 453 place count 7378 transition count 15285
Ensure Unique test removed 1 places
Reduce places removed 450 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 449 transitions.
Drop transitions removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 1 with 1347 rules applied. Total rules applied 1800 place count 6928 transition count 14388
Ensure Unique test removed 1 places
Reduce places removed 449 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 448 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 1289 rules applied. Total rules applied 3089 place count 6479 transition count 13548
Ensure Unique test removed 56 places
Reduce places removed 448 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 392 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 3 with 1230 rules applied. Total rules applied 4319 place count 6031 transition count 12766
Ensure Unique test removed 2 places
Reduce places removed 392 places and 0 transitions.
Drop transitions removed 52 transitions
Ensure Unique test removed 338 transitions
Reduce isomorphic transitions removed 390 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 4 with 1120 rules applied. Total rules applied 5439 place count 5639 transition count 12038
Ensure Unique test removed 52 places
Reduce places removed 390 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 338 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 5 with 1064 rules applied. Total rules applied 6503 place count 5249 transition count 11364
Ensure Unique test removed 2 places
Reduce places removed 338 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 336 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 6 with 962 rules applied. Total rules applied 7465 place count 4911 transition count 10740
Ensure Unique test removed 48 places
Reduce places removed 336 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 288 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 7 with 910 rules applied. Total rules applied 8375 place count 4575 transition count 10166
Ensure Unique test removed 2 places
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 286 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 8 with 816 rules applied. Total rules applied 9191 place count 4287 transition count 9638
Ensure Unique test removed 44 places
Reduce places removed 286 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 9 with 768 rules applied. Total rules applied 9959 place count 4001 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 10 with 682 rules applied. Total rules applied 10641 place count 3759 transition count 8716
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 11 with 637 rules applied. Total rules applied 11278 place count 3519 transition count 8319
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 12 with 558 rules applied. Total rules applied 11836 place count 3320 transition count 7960
Ensure Unique test removed 35 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 13 with 519 rules applied. Total rules applied 12355 place count 3123 transition count 7638
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 14 with 450 rules applied. Total rules applied 12805 place count 2961 transition count 7350
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 15 with 414 rules applied. Total rules applied 13219 place count 2801 transition count 7096
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 16 with 352 rules applied. Total rules applied 13571 place count 2673 transition count 6872
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 17 with 320 rules applied. Total rules applied 13891 place count 2547 transition count 6678
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 18 with 266 rules applied. Total rules applied 14157 place count 2449 transition count 6510
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 19 with 238 rules applied. Total rules applied 14395 place count 2353 transition count 6368
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 20 with 192 rules applied. Total rules applied 14587 place count 2281 transition count 6248
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 21 with 168 rules applied. Total rules applied 14755 place count 2211 transition count 6150
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 22 with 130 rules applied. Total rules applied 14885 place count 2161 transition count 6070
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 23 with 110 rules applied. Total rules applied 14995 place count 2113 transition count 6008
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 24 with 80 rules applied. Total rules applied 15075 place count 2081 transition count 5960
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 25 with 64 rules applied. Total rules applied 15139 place count 2051 transition count 5926
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 26 with 42 rules applied. Total rules applied 15181 place count 2033 transition count 5902
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 27 with 30 rules applied. Total rules applied 15211 place count 2017 transition count 5888
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 28 with 16 rules applied. Total rules applied 15227 place count 2009 transition count 5880
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 9 rules applied. Total rules applied 15236 place count 2003 transition count 5877
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 15240 place count 2000 transition count 5876
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 264 Pre rules applied. Total rules applied 15240 place count 2000 transition count 5612
Deduced a syphon composed of 264 places in 1 ms
Ensure Unique test removed 264 places
Reduce places removed 528 places and 0 transitions.
Iterating global reduction 31 with 792 rules applied. Total rules applied 16032 place count 1472 transition count 5612
Discarding 288 places :
Symmetric choice reduction at 31 with 288 rule applications. Total rules 16320 place count 1184 transition count 5324
Iterating global reduction 31 with 288 rules applied. Total rules applied 16608 place count 1184 transition count 5324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 16608 place count 1184 transition count 5323
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 16610 place count 1183 transition count 5323
Discarding 991 places :
Symmetric choice reduction at 31 with 991 rule applications. Total rules 17601 place count 192 transition count 1359
Iterating global reduction 31 with 991 rules applied. Total rules applied 18592 place count 192 transition count 1359
Ensure Unique test removed 991 transitions
Reduce isomorphic transitions removed 991 transitions.
Iterating post reduction 31 with 991 rules applied. Total rules applied 19583 place count 192 transition count 368
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 32 with 68 rules applied. Total rules applied 19651 place count 157 transition count 335
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 32 with 8 rules applied. Total rules applied 19659 place count 157 transition count 327
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 32 with 8 rules applied. Total rules applied 19667 place count 149 transition count 327
Discarding 30 places :
Symmetric choice reduction at 33 with 30 rule applications. Total rules 19697 place count 119 transition count 207
Ensure Unique test removed 29 places
Iterating global reduction 33 with 59 rules applied. Total rules applied 19756 place count 90 transition count 207
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 19786 place count 90 transition count 177
Discarding 29 places :
Symmetric choice reduction at 34 with 29 rule applications. Total rules 19815 place count 61 transition count 61
Iterating global reduction 34 with 29 rules applied. Total rules applied 19844 place count 61 transition count 61
Discarding 28 places :
Symmetric choice reduction at 34 with 28 rule applications. Total rules 19872 place count 33 transition count 33
Iterating global reduction 34 with 28 rules applied. Total rules applied 19900 place count 33 transition count 33
Applied a total of 19900 rules in 18619 ms. Remains 33 /8082 variables (removed 8049) and now considering 33/18357 (removed 18324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 33 cols
[2024-05-25 16:55:34] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 16:55:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:55:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-25 16:55:34] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:55:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:55:34] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-25 16:55:34] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:55:34] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-25 16:55:34] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 8657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8657/8657 places, 15962/15962 transitions.
Applied a total of 0 rules in 2109 ms. Remains 8657 /8657 variables (removed 0) and now considering 15962/15962 (removed 0) transitions.
[2024-05-25 16:55:36] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2024-05-25 16:55:37] [INFO ] Computed 1429 invariants in 806 ms
[2024-05-25 16:55:38] [INFO ] Implicit Places using invariants in 1553 ms returned []
Implicit Place search using SMT only with invariants took 1554 ms to find 0 implicit places.
[2024-05-25 16:55:38] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 16:55:38] [INFO ] Invariant cache hit.
[2024-05-25 16:55:38] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4425 ms. Remains : 8657/8657 places, 15962/15962 transitions.
Computed a total of 2674 stabilizing places and 4026 stable transitions
Computed a total of 2674 stabilizing places and 4026 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 342 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13880 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13880 steps, saw 6548 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:55:42] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 16:55:42] [INFO ] Invariant cache hit.
[2024-05-25 16:55:43] [INFO ] [Real]Absence check using 65 positive place invariants in 150 ms returned sat
[2024-05-25 16:55:43] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 484 ms returned sat
[2024-05-25 16:55:54] [INFO ] After 12514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:55:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 142 ms returned sat
[2024-05-25 16:55:56] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 528 ms returned sat
[2024-05-25 16:56:08] [INFO ] After 12452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:56:08] [INFO ] State equation strengthened by 6184 read => feed constraints.
[2024-05-25 16:56:18] [INFO ] After 9370ms SMT Verify possible using 6184 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:56:18] [INFO ] After 23477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 8657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8657/8657 places, 15962/15962 transitions.
Free-agglomeration rule (complex) applied 575 times.
Iterating global reduction 0 with 575 rules applied. Total rules applied 575 place count 8657 transition count 18357
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 0 with 575 rules applied. Total rules applied 1150 place count 8082 transition count 18357
Applied a total of 1150 rules in 4780 ms. Remains 8082 /8657 variables (removed 575) and now considering 18357/15962 (removed -2395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4783 ms. Remains : 8082/8657 places, 18357/15962 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13816 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13816 steps, saw 6404 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:56:26] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2024-05-25 16:56:27] [INFO ] Computed 1429 invariants in 731 ms
[2024-05-25 16:56:28] [INFO ] [Real]Absence check using 65 positive place invariants in 110 ms returned sat
[2024-05-25 16:56:28] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 481 ms returned sat
[2024-05-25 16:56:28] [INFO ] After 1437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:56:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 113 ms returned sat
[2024-05-25 16:56:30] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 489 ms returned sat
[2024-05-25 16:56:40] [INFO ] After 10219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:56:40] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 16:56:50] [INFO ] After 9705ms SMT Verify possible using 9154 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-25 16:56:50] [INFO ] After 21465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 8082 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 2149 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2149 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 2313 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
[2024-05-25 16:56:54] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 16:56:54] [INFO ] Invariant cache hit.
[2024-05-25 16:56:55] [INFO ] Implicit Places using invariants in 727 ms returned []
Implicit Place search using SMT only with invariants took 729 ms to find 0 implicit places.
[2024-05-25 16:56:55] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
[2024-05-25 16:56:55] [INFO ] Invariant cache hit.
[2024-05-25 16:56:56] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3761 ms. Remains : 8082/8082 places, 18357/18357 transitions.
Graph (trivial) has 6948 edges and 8082 vertex of which 33 / 8082 are part of one of the 1 SCC in 3 ms
Free SCC test removed 32 places
Drop transitions removed 1115 transitions
Ensure Unique test removed 1506 transitions
Reduce isomorphic transitions removed 2621 transitions.
Graph (complete) has 45916 edges and 8050 vertex of which 8020 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 641 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12909.t14229 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 451 rules applied. Total rules applied 453 place count 7378 transition count 15285
Ensure Unique test removed 1 places
Reduce places removed 450 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 449 transitions.
Drop transitions removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 1 with 1347 rules applied. Total rules applied 1800 place count 6928 transition count 14388
Ensure Unique test removed 1 places
Reduce places removed 449 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 448 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 1289 rules applied. Total rules applied 3089 place count 6479 transition count 13548
Ensure Unique test removed 56 places
Reduce places removed 448 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 392 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 3 with 1230 rules applied. Total rules applied 4319 place count 6031 transition count 12766
Ensure Unique test removed 2 places
Reduce places removed 392 places and 0 transitions.
Drop transitions removed 52 transitions
Ensure Unique test removed 338 transitions
Reduce isomorphic transitions removed 390 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 4 with 1120 rules applied. Total rules applied 5439 place count 5639 transition count 12038
Ensure Unique test removed 52 places
Reduce places removed 390 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 338 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 5 with 1064 rules applied. Total rules applied 6503 place count 5249 transition count 11364
Ensure Unique test removed 2 places
Reduce places removed 338 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 336 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 6 with 962 rules applied. Total rules applied 7465 place count 4911 transition count 10740
Ensure Unique test removed 48 places
Reduce places removed 336 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 288 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 7 with 910 rules applied. Total rules applied 8375 place count 4575 transition count 10166
Ensure Unique test removed 2 places
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 286 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 8 with 816 rules applied. Total rules applied 9191 place count 4287 transition count 9638
Ensure Unique test removed 44 places
Reduce places removed 286 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 9 with 768 rules applied. Total rules applied 9959 place count 4001 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 10 with 682 rules applied. Total rules applied 10641 place count 3759 transition count 8716
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 11 with 637 rules applied. Total rules applied 11278 place count 3519 transition count 8319
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 12 with 558 rules applied. Total rules applied 11836 place count 3320 transition count 7960
Ensure Unique test removed 35 places
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 13 with 519 rules applied. Total rules applied 12355 place count 3123 transition count 7638
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 14 with 450 rules applied. Total rules applied 12805 place count 2961 transition count 7350
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 15 with 414 rules applied. Total rules applied 13219 place count 2801 transition count 7096
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 16 with 352 rules applied. Total rules applied 13571 place count 2673 transition count 6872
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 17 with 320 rules applied. Total rules applied 13891 place count 2547 transition count 6678
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 18 with 266 rules applied. Total rules applied 14157 place count 2449 transition count 6510
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 19 with 238 rules applied. Total rules applied 14395 place count 2353 transition count 6368
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 20 with 192 rules applied. Total rules applied 14587 place count 2281 transition count 6248
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 21 with 168 rules applied. Total rules applied 14755 place count 2211 transition count 6150
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 22 with 130 rules applied. Total rules applied 14885 place count 2161 transition count 6070
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 23 with 110 rules applied. Total rules applied 14995 place count 2113 transition count 6008
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 24 with 80 rules applied. Total rules applied 15075 place count 2081 transition count 5960
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 25 with 64 rules applied. Total rules applied 15139 place count 2051 transition count 5926
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 26 with 42 rules applied. Total rules applied 15181 place count 2033 transition count 5902
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 27 with 30 rules applied. Total rules applied 15211 place count 2017 transition count 5888
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 28 with 16 rules applied. Total rules applied 15227 place count 2009 transition count 5880
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 9 rules applied. Total rules applied 15236 place count 2003 transition count 5877
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 15240 place count 2000 transition count 5876
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 264 Pre rules applied. Total rules applied 15240 place count 2000 transition count 5612
Deduced a syphon composed of 264 places in 1 ms
Ensure Unique test removed 264 places
Reduce places removed 528 places and 0 transitions.
Iterating global reduction 31 with 792 rules applied. Total rules applied 16032 place count 1472 transition count 5612
Discarding 288 places :
Symmetric choice reduction at 31 with 288 rule applications. Total rules 16320 place count 1184 transition count 5324
Iterating global reduction 31 with 288 rules applied. Total rules applied 16608 place count 1184 transition count 5324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 16608 place count 1184 transition count 5323
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 16610 place count 1183 transition count 5323
Discarding 991 places :
Symmetric choice reduction at 31 with 991 rule applications. Total rules 17601 place count 192 transition count 1359
Iterating global reduction 31 with 991 rules applied. Total rules applied 18592 place count 192 transition count 1359
Ensure Unique test removed 991 transitions
Reduce isomorphic transitions removed 991 transitions.
Iterating post reduction 31 with 991 rules applied. Total rules applied 19583 place count 192 transition count 368
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 32 with 68 rules applied. Total rules applied 19651 place count 157 transition count 335
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 32 with 8 rules applied. Total rules applied 19659 place count 157 transition count 327
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 32 with 8 rules applied. Total rules applied 19667 place count 149 transition count 327
Discarding 30 places :
Symmetric choice reduction at 33 with 30 rule applications. Total rules 19697 place count 119 transition count 207
Ensure Unique test removed 29 places
Iterating global reduction 33 with 59 rules applied. Total rules applied 19756 place count 90 transition count 207
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 19786 place count 90 transition count 177
Discarding 29 places :
Symmetric choice reduction at 34 with 29 rule applications. Total rules 19815 place count 61 transition count 61
Iterating global reduction 34 with 29 rules applied. Total rules applied 19844 place count 61 transition count 61
Discarding 28 places :
Symmetric choice reduction at 34 with 28 rule applications. Total rules 19872 place count 33 transition count 33
Iterating global reduction 34 with 28 rules applied. Total rules applied 19900 place count 33 transition count 33
Applied a total of 19900 rules in 18541 ms. Remains 33 /8082 variables (removed 8049) and now considering 33/18357 (removed 18324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 33 cols
[2024-05-25 16:57:14] [INFO ] Computed 14 invariants in 0 ms
[2024-05-25 16:57:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 16:57:14] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-25 16:57:14] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:57:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-25 16:57:14] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-25 16:57:14] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:57:14] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-25 16:57:14] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3417 reset in 1699 ms.
Product exploration explored 100000 steps with 3419 reset in 1751 ms.
Built C files in :
/tmp/ltsmin10402700810232529057
[2024-05-25 16:57:18] [INFO ] Too many transitions (15962) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:57:18] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10402700810232529057
Running compilation step : cd /tmp/ltsmin10402700810232529057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10402700810232529057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10402700810232529057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 8657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8657/8657 places, 15962/15962 transitions.
Applied a total of 0 rules in 2663 ms. Remains 8657 /8657 variables (removed 0) and now considering 15962/15962 (removed 0) transitions.
[2024-05-25 16:57:24] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2024-05-25 16:57:25] [INFO ] Computed 1429 invariants in 685 ms
[2024-05-25 16:57:32] [INFO ] Implicit Places using invariants in 8406 ms returned []
Implicit Place search using SMT only with invariants took 8407 ms to find 0 implicit places.
[2024-05-25 16:57:32] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 16:57:32] [INFO ] Invariant cache hit.
[2024-05-25 16:57:33] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11831 ms. Remains : 8657/8657 places, 15962/15962 transitions.
Built C files in :
/tmp/ltsmin8375001585213209887
[2024-05-25 16:57:33] [INFO ] Too many transitions (15962) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:57:33] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8375001585213209887
Running compilation step : cd /tmp/ltsmin8375001585213209887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8375001585213209887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8375001585213209887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:57:38] [INFO ] Flatten gal took : 484 ms
[2024-05-25 16:57:38] [INFO ] Flatten gal took : 371 ms
[2024-05-25 16:57:38] [INFO ] Time to serialize gal into /tmp/LTL16748793558904705339.gal : 103 ms
[2024-05-25 16:57:38] [INFO ] Time to serialize properties into /tmp/LTL15254760397142099981.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16748793558904705339.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1612627637995480856.hoa' '-atoms' '/tmp/LTL15254760397142099981.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15254760397142099981.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1612627637995480856.hoa
Detected timeout of ITS tools.
[2024-05-25 16:57:54] [INFO ] Flatten gal took : 379 ms
[2024-05-25 16:57:54] [INFO ] Flatten gal took : 353 ms
[2024-05-25 16:57:54] [INFO ] Time to serialize gal into /tmp/LTL2902606504927468501.gal : 69 ms
[2024-05-25 16:57:54] [INFO ] Time to serialize properties into /tmp/LTL6668684593179873130.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2902606504927468501.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6668684593179873130.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(Node23NotifyThatHeIsActive<1))"))))
Formula 0 simplified : FG!"((Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(Node23NotifyThatHeIsActive<1))"
Detected timeout of ITS tools.
[2024-05-25 16:58:10] [INFO ] Flatten gal took : 348 ms
[2024-05-25 16:58:10] [INFO ] Applying decomposition
[2024-05-25 16:58:10] [INFO ] Flatten gal took : 359 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7187645381337806762.txt' '-o' '/tmp/graph7187645381337806762.bin' '-w' '/tmp/graph7187645381337806762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7187645381337806762.bin' '-l' '-1' '-v' '-w' '/tmp/graph7187645381337806762.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:58:11] [INFO ] Decomposing Gal with order
[2024-05-25 16:58:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:58:16] [INFO ] Removed a total of 14113 redundant transitions.
[2024-05-25 16:58:17] [INFO ] Flatten gal took : 4099 ms
[2024-05-25 16:58:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 10268 labels/synchronizations in 1353 ms.
[2024-05-25 16:58:19] [INFO ] Time to serialize gal into /tmp/LTL6063882957066928740.gal : 143 ms
[2024-05-25 16:58:19] [INFO ] Time to serialize properties into /tmp/LTL6443769877136436479.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6063882957066928740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6443769877136436479.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i25.i0.u80.Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(i23.u356.Node23NotifyThatHeIsActive<1))"))))
Formula 0 simplified : FG!"((i25.i0.u80.Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(i23.u356.Node23NotifyThatHeIsActive<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6679094110963163407
[2024-05-25 16:58:35] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6679094110963163407
Running compilation step : cd /tmp/ltsmin6679094110963163407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6679094110963163407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6679094110963163407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-01 finished in 290651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(!p0)))))'
Support contains 1 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2150 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 16:58:40] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18136 cols
[2024-05-25 16:58:42] [INFO ] Computed 1429 invariants in 2230 ms
[2024-05-25 16:58:43] [INFO ] Implicit Places using invariants in 3659 ms returned []
Implicit Place search using SMT only with invariants took 3660 ms to find 0 implicit places.
[2024-05-25 16:58:43] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 16:58:43] [INFO ] Invariant cache hit.
[2024-05-25 16:58:45] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7248 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 186 ms :[false, false, p0, p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s13486 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][false, false, false, false]]
Product exploration explored 100000 steps with 2418 reset in 2516 ms.
Product exploration explored 100000 steps with 2418 reset in 2161 ms.
Computed a total of 12120 stabilizing places and 16442 stable transitions
Computed a total of 12120 stabilizing places and 16442 stable transitions
Detected a total of 12120/18136 stabilizing places and 16442/28411 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 359 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Finished random walk after 2552 steps, including 61 resets, run visited all 1 properties in 64 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 117 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 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Support contains 1 out of 18136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Drop transitions removed 4223 transitions
Trivial Post-agglo rules discarded 4223 transitions
Performed 4223 trivial Post agglomeration. Transition count delta: 4223
Iterating post reduction 0 with 4223 rules applied. Total rules applied 4223 place count 18136 transition count 24188
Reduce places removed 4223 places and 0 transitions.
Iterating post reduction 1 with 4223 rules applied. Total rules applied 8446 place count 13913 transition count 24188
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8446 place count 13913 transition count 23924
Deduced a syphon composed of 264 places in 18 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8974 place count 13649 transition count 23924
Discarding 3959 places :
Symmetric choice reduction at 2 with 3959 rule applications. Total rules 12933 place count 9690 transition count 19965
Iterating global reduction 2 with 3959 rules applied. Total rules applied 16892 place count 9690 transition count 19965
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 16892 place count 9690 transition count 19958
Deduced a syphon composed of 7 places in 13 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16906 place count 9683 transition count 19958
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 17895 place count 8694 transition count 16002
Iterating global reduction 2 with 989 rules applied. Total rules applied 18884 place count 8694 transition count 16002
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 18950 place count 8661 transition count 15969
Applied a total of 18950 rules in 10391 ms. Remains 8661 /18136 variables (removed 9475) and now considering 15969/28411 (removed 12442) transitions.
[2024-05-25 16:59:01] [INFO ] Flow matrix only has 14913 transitions (discarded 1056 similar events)
// Phase 1: matrix 14913 rows 8661 cols
[2024-05-25 16:59:02] [INFO ] Computed 1429 invariants in 697 ms
[2024-05-25 16:59:03] [INFO ] Implicit Places using invariants in 1441 ms returned []
Implicit Place search using SMT only with invariants took 1443 ms to find 0 implicit places.
[2024-05-25 16:59:03] [INFO ] Flow matrix only has 14913 transitions (discarded 1056 similar events)
[2024-05-25 16:59:03] [INFO ] Invariant cache hit.
[2024-05-25 16:59:14] [INFO ] Dead Transitions using invariants and state equation in 11631 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8661/18136 places, 15969/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23466 ms. Remains : 8661/18136 places, 15969/28411 transitions.
Computed a total of 2678 stabilizing places and 4033 stable transitions
Computed a total of 2678 stabilizing places and 4033 stable transitions
Detected a total of 2678/8661 stabilizing places and 4033/15969 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 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 59 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13661 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13661 steps, saw 6443 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:59:18] [INFO ] Flow matrix only has 14913 transitions (discarded 1056 similar events)
[2024-05-25 16:59:18] [INFO ] Invariant cache hit.
[2024-05-25 16:59:19] [INFO ] [Real]Absence check using 65 positive place invariants in 121 ms returned sat
[2024-05-25 16:59:19] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 516 ms returned sat
[2024-05-25 16:59:31] [INFO ] After 11332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 16:59:31] [INFO ] State equation strengthened by 6187 read => feed constraints.
[2024-05-25 16:59:31] [INFO ] After 853ms SMT Verify possible using 6187 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:59:31] [INFO ] After 13819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:59:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 116 ms returned sat
[2024-05-25 16:59:33] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 513 ms returned sat
[2024-05-25 16:59:45] [INFO ] After 11701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:59:46] [INFO ] After 1119ms SMT Verify possible using 6187 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:59:47] [INFO ] After 1801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 413 ms.
[2024-05-25 16:59:47] [INFO ] After 15466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 8661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8661/8661 places, 15969/15969 transitions.
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 0 with 577 rules applied. Total rules applied 577 place count 8661 transition count 18359
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 0 with 577 rules applied. Total rules applied 1154 place count 8084 transition count 18359
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 1187 place count 8084 transition count 18359
Applied a total of 1187 rules in 7398 ms. Remains 8084 /8661 variables (removed 577) and now considering 18359/15969 (removed -2390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7398 ms. Remains : 8084/8661 places, 18359/15969 transitions.
Incomplete random walk after 10000 steps, including 398 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Finished Best-First random walk after 3348 steps, including 12 resets, run visited all 1 properties in 18 ms. (steps per millisecond=186 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 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 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 112 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Product exploration explored 100000 steps with 3312 reset in 1704 ms.
Product exploration explored 100000 steps with 3314 reset in 1761 ms.
Built C files in :
/tmp/ltsmin9044437855422290624
[2024-05-25 16:59:59] [INFO ] Too many transitions (15969) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:59:59] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9044437855422290624
Running compilation step : cd /tmp/ltsmin9044437855422290624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9044437855422290624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9044437855422290624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 8661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8661/8661 places, 15969/15969 transitions.
Applied a total of 0 rules in 2627 ms. Remains 8661 /8661 variables (removed 0) and now considering 15969/15969 (removed 0) transitions.
[2024-05-25 17:00:05] [INFO ] Flow matrix only has 14913 transitions (discarded 1056 similar events)
[2024-05-25 17:00:05] [INFO ] Invariant cache hit.
[2024-05-25 17:00:05] [INFO ] Implicit Places using invariants in 751 ms returned []
Implicit Place search using SMT only with invariants took 752 ms to find 0 implicit places.
[2024-05-25 17:00:05] [INFO ] Flow matrix only has 14913 transitions (discarded 1056 similar events)
[2024-05-25 17:00:05] [INFO ] Invariant cache hit.
[2024-05-25 17:00:06] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4147 ms. Remains : 8661/8661 places, 15969/15969 transitions.
Built C files in :
/tmp/ltsmin14911918760935363706
[2024-05-25 17:00:06] [INFO ] Too many transitions (15969) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:00:06] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14911918760935363706
Running compilation step : cd /tmp/ltsmin14911918760935363706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14911918760935363706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14911918760935363706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 17:00:10] [INFO ] Flatten gal took : 372 ms
[2024-05-25 17:00:10] [INFO ] Flatten gal took : 369 ms
[2024-05-25 17:00:10] [INFO ] Time to serialize gal into /tmp/LTL11471994261411551804.gal : 72 ms
[2024-05-25 17:00:10] [INFO ] Time to serialize properties into /tmp/LTL11003790035442969754.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11471994261411551804.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13154848063987782469.hoa' '-atoms' '/tmp/LTL11003790035442969754.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11003790035442969754.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13154848063987782469.hoa
Detected timeout of ITS tools.
[2024-05-25 17:00:26] [INFO ] Flatten gal took : 366 ms
[2024-05-25 17:00:27] [INFO ] Flatten gal took : 374 ms
[2024-05-25 17:00:27] [INFO ] Time to serialize gal into /tmp/LTL13647077087714126205.gal : 73 ms
[2024-05-25 17:00:27] [INFO ] Time to serialize properties into /tmp/LTL4910736903235105851.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13647077087714126205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4910736903235105851.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(Node26HasTheLeafSetOfRx0ToReplaceNode30>=1)")||(G(F("(Node26HasTheLeafSetOfRx0ToReplaceNode30<1)"))))))
Formula 0 simplified : X(!"(Node26HasTheLeafSetOfRx0ToReplaceNode30>=1)" & FG!"(Node26HasTheLeafSetOfRx0ToReplaceNode30<1)")
Detected timeout of ITS tools.
[2024-05-25 17:00:42] [INFO ] Flatten gal took : 364 ms
[2024-05-25 17:00:42] [INFO ] Applying decomposition
[2024-05-25 17:00:43] [INFO ] Flatten gal took : 373 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15683093644524725339.txt' '-o' '/tmp/graph15683093644524725339.bin' '-w' '/tmp/graph15683093644524725339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15683093644524725339.bin' '-l' '-1' '-v' '-w' '/tmp/graph15683093644524725339.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:00:44] [INFO ] Decomposing Gal with order
[2024-05-25 17:00:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:00:48] [INFO ] Removed a total of 13888 redundant transitions.
[2024-05-25 17:00:49] [INFO ] Flatten gal took : 3658 ms
[2024-05-25 17:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 9117 labels/synchronizations in 1299 ms.
[2024-05-25 17:00:51] [INFO ] Time to serialize gal into /tmp/LTL9031836826421284123.gal : 96 ms
[2024-05-25 17:00:51] [INFO ] Time to serialize properties into /tmp/LTL2672107229267222589.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9031836826421284123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2672107229267222589.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i51.u627.Node26HasTheLeafSetOfRx0ToReplaceNode30>=1)")||(G(F("(i51.u627.Node26HasTheLeafSetOfRx0ToReplaceNode30<1)"))))))
Formula 0 simplified : X(!"(i51.u627.Node26HasTheLeafSetOfRx0ToReplaceNode30>=1)" & FG!"(i51.u627.Node26HasTheLeafSetOfRx0ToReplaceNode30<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18000423255999844411
[2024-05-25 17:01:06] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18000423255999844411
Running compilation step : cd /tmp/ltsmin18000423255999844411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18000423255999844411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18000423255999844411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-02 finished in 151430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 6 out of 18136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Drop transitions removed 4224 transitions
Trivial Post-agglo rules discarded 4224 transitions
Performed 4224 trivial Post agglomeration. Transition count delta: 4224
Iterating post reduction 0 with 4224 rules applied. Total rules applied 4224 place count 18136 transition count 24187
Reduce places removed 4224 places and 0 transitions.
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8448 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8448 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 19 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8976 place count 13648 transition count 23923
Discarding 3960 places :
Symmetric choice reduction at 2 with 3960 rule applications. Total rules 12936 place count 9688 transition count 19963
Iterating global reduction 2 with 3960 rules applied. Total rules applied 16896 place count 9688 transition count 19963
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16896 place count 9688 transition count 19955
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 16912 place count 9680 transition count 19955
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 17902 place count 8690 transition count 15995
Iterating global reduction 2 with 990 rules applied. Total rules applied 18892 place count 8690 transition count 15995
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 18958 place count 8657 transition count 15962
Applied a total of 18958 rules in 10501 ms. Remains 8657 /18136 variables (removed 9479) and now considering 15962/28411 (removed 12449) transitions.
[2024-05-25 17:01:20] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2024-05-25 17:01:20] [INFO ] Computed 1429 invariants in 700 ms
[2024-05-25 17:01:21] [INFO ] Implicit Places using invariants in 1464 ms returned []
Implicit Place search using SMT only with invariants took 1464 ms to find 0 implicit places.
[2024-05-25 17:01:21] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 17:01:21] [INFO ] Invariant cache hit.
[2024-05-25 17:01:22] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8657/18136 places, 15962/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12719 ms. Remains : 8657/18136 places, 15962/28411 transitions.
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s4761 1) (LT s6164 1)), p0:(OR (LT s0 1) (LT s1 1) (LT s4630 1) (LT s4631 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 5401 ms.
Product exploration explored 100000 steps with 50000 reset in 5496 ms.
Computed a total of 2674 stabilizing places and 4026 stable transitions
Computed a total of 2674 stabilizing places and 4026 stable transitions
Detected a total of 2674/8657 stabilizing places and 4026/15962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-03 finished in 24303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1))||X(p2))))'
Support contains 8 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2110 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:01:35] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18136 cols
[2024-05-25 17:01:38] [INFO ] Computed 1429 invariants in 2174 ms
[2024-05-25 17:01:39] [INFO ] Implicit Places using invariants in 3562 ms returned []
Implicit Place search using SMT only with invariants took 3562 ms to find 0 implicit places.
[2024-05-25 17:01:39] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:01:39] [INFO ] Invariant cache hit.
[2024-05-25 17:01:40] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7070 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(AND (GEQ s2 1) (GEQ s11508 1) (GEQ s12325 1) (GEQ s12327 1)), p1:(AND (GEQ s6527 1) (GEQ s10258 1)), p2:(AND (GEQ s1435 1) (GEQ s18057 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-04 finished in 7413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 6 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2149 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:01:43] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:01:43] [INFO ] Invariant cache hit.
[2024-05-25 17:01:44] [INFO ] Implicit Places using invariants in 1397 ms returned []
Implicit Place search using SMT only with invariants took 1398 ms to find 0 implicit places.
[2024-05-25 17:01:44] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:01:44] [INFO ] Invariant cache hit.
[2024-05-25 17:01:46] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4954 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s12915 1) (LT s12917 1) (LT s15456 1) (AND (GEQ s11075 1) (GEQ s16588 1))), p1:(OR (LT s2 1) (LT s12915 1) (LT s12917 1) (LT s15456 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5589 steps with 135 reset in 123 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-05 finished in 5303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 18136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Drop transitions removed 4224 transitions
Trivial Post-agglo rules discarded 4224 transitions
Performed 4224 trivial Post agglomeration. Transition count delta: 4224
Iterating post reduction 0 with 4224 rules applied. Total rules applied 4224 place count 18136 transition count 24187
Reduce places removed 4224 places and 0 transitions.
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8448 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 264 Pre rules applied. Total rules applied 8448 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 19 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 528 rules applied. Total rules applied 8976 place count 13648 transition count 23923
Discarding 3960 places :
Symmetric choice reduction at 2 with 3960 rule applications. Total rules 12936 place count 9688 transition count 19963
Iterating global reduction 2 with 3960 rules applied. Total rules applied 16896 place count 9688 transition count 19963
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16896 place count 9688 transition count 19955
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 16912 place count 9680 transition count 19955
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 17902 place count 8690 transition count 15995
Iterating global reduction 2 with 990 rules applied. Total rules applied 18892 place count 8690 transition count 15995
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 18958 place count 8657 transition count 15962
Applied a total of 18958 rules in 10554 ms. Remains 8657 /18136 variables (removed 9479) and now considering 15962/28411 (removed 12449) transitions.
[2024-05-25 17:01:57] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2024-05-25 17:01:57] [INFO ] Computed 1429 invariants in 710 ms
[2024-05-25 17:01:58] [INFO ] Implicit Places using invariants in 1472 ms returned []
Implicit Place search using SMT only with invariants took 1473 ms to find 0 implicit places.
[2024-05-25 17:01:58] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 17:01:58] [INFO ] Invariant cache hit.
[2024-05-25 17:01:59] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8657/18136 places, 15962/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12773 ms. Remains : 8657/18136 places, 15962/28411 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s775 1) (GEQ s6448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-06 finished in 12874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p2)||p1)&&p0))))'
Support contains 6 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2117 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:02:01] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18136 cols
[2024-05-25 17:02:03] [INFO ] Computed 1429 invariants in 2175 ms
[2024-05-25 17:02:05] [INFO ] Implicit Places using invariants in 3595 ms returned []
Implicit Place search using SMT only with invariants took 3596 ms to find 0 implicit places.
[2024-05-25 17:02:05] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:05] [INFO ] Invariant cache hit.
[2024-05-25 17:02:06] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7117 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s13661 1) (LT s14120 1)) (OR (LT s6952 1) (LT s9490 1))), p1:(OR (LT s2014 1) (LT s12459 1)), p2:(OR (LT s13661 1) (LT s14120 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]]
Product exploration timeout after 96620 steps with 48310 reset in 10001 ms.
Product exploration timeout after 96930 steps with 48465 reset in 10001 ms.
Computed a total of 12120 stabilizing places and 16442 stable transitions
Computed a total of 12120 stabilizing places and 16442 stable transitions
Detected a total of 12120/18136 stabilizing places and 16442/28411 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 136 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-07 finished in 27547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2109 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:02:29] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:29] [INFO ] Invariant cache hit.
[2024-05-25 17:02:30] [INFO ] Implicit Places using invariants in 1408 ms returned []
Implicit Place search using SMT only with invariants took 1409 ms to find 0 implicit places.
[2024-05-25 17:02:30] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:30] [INFO ] Invariant cache hit.
[2024-05-25 17:02:31] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4935 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s5883 1) (GEQ s16761 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-08 finished in 5096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(F(p1)))))'
Support contains 6 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2108 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:02:34] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:34] [INFO ] Invariant cache hit.
[2024-05-25 17:02:35] [INFO ] Implicit Places using invariants in 1422 ms returned []
Implicit Place search using SMT only with invariants took 1423 ms to find 0 implicit places.
[2024-05-25 17:02:35] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:35] [INFO ] Invariant cache hit.
[2024-05-25 17:02:37] [INFO ] Dead Transitions using invariants and state equation in 1428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4962 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s5396 1) (GEQ s13694 1)), p1:(OR (LT s2 1) (LT s9488 1) (LT s11301 1) (LT s11303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 7643 ms.
Product exploration explored 100000 steps with 33333 reset in 7500 ms.
Computed a total of 12120 stabilizing places and 16442 stable transitions
Computed a total of 12120 stabilizing places and 16442 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-09 finished in 20414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(!p1)))'
Support contains 4 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2156 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:02:54] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:54] [INFO ] Invariant cache hit.
[2024-05-25 17:02:56] [INFO ] Implicit Places using invariants in 1424 ms returned []
Implicit Place search using SMT only with invariants took 1429 ms to find 0 implicit places.
[2024-05-25 17:02:56] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:02:56] [INFO ] Invariant cache hit.
[2024-05-25 17:02:57] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5005 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 198 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s5395 1) (GEQ s14904 1)), p1:(AND (GEQ s13535 1) (GEQ s17536 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][false, false, false, false, false]]
Product exploration timeout after 99380 steps with 49690 reset in 10001 ms.
Product exploration timeout after 99310 steps with 49655 reset in 10001 ms.
Computed a total of 12120 stabilizing places and 16442 stable transitions
Computed a total of 12120 stabilizing places and 16442 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-10 finished in 25370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p1&&F(p1))||p0))))'
Support contains 6 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2134 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:03:20] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:03:20] [INFO ] Invariant cache hit.
[2024-05-25 17:03:21] [INFO ] Implicit Places using invariants in 1393 ms returned []
Implicit Place search using SMT only with invariants took 1394 ms to find 0 implicit places.
[2024-05-25 17:03:21] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:03:21] [INFO ] Invariant cache hit.
[2024-05-25 17:03:22] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4926 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s11706 1) (GEQ s17987 1)) (AND (GEQ s4320 1) (GEQ s14986 1))), p1:(AND (GEQ s4028 1) (GEQ s7983 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-11 finished in 5105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p1)&&F(p2))||p0))))'
Support contains 8 out of 18136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Applied a total of 0 rules in 2145 ms. Remains 18136 /18136 variables (removed 0) and now considering 28411/28411 (removed 0) transitions.
[2024-05-25 17:03:25] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:03:25] [INFO ] Invariant cache hit.
[2024-05-25 17:03:26] [INFO ] Implicit Places using invariants in 1394 ms returned []
Implicit Place search using SMT only with invariants took 1394 ms to find 0 implicit places.
[2024-05-25 17:03:26] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
[2024-05-25 17:03:26] [INFO ] Invariant cache hit.
[2024-05-25 17:03:27] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4941 ms. Remains : 18136/18136 places, 28411/28411 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3721 1) (LT s4924 1) (LT s4926 1)), p2:(AND (GEQ s12731 1) (GEQ s18022 1)), p1:(OR (LT s794 1) (LT s16198 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23379 steps with 563 reset in 505 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-13 finished in 5703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||((p2 U G(p3))&&p1))))'
Support contains 7 out of 18136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18136/18136 places, 28411/28411 transitions.
Drop transitions removed 4208 transitions
Trivial Post-agglo rules discarded 4208 transitions
Performed 4208 trivial Post agglomeration. Transition count delta: 4208
Iterating post reduction 0 with 4208 rules applied. Total rules applied 4208 place count 18136 transition count 24203
Reduce places removed 4208 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8432 place count 13928 transition count 24187
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 8448 place count 13912 transition count 24187
Performed 263 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 263 Pre rules applied. Total rules applied 8448 place count 13912 transition count 23924
Deduced a syphon composed of 263 places in 19 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 8974 place count 13649 transition count 23924
Discarding 3959 places :
Symmetric choice reduction at 3 with 3959 rule applications. Total rules 12933 place count 9690 transition count 19965
Iterating global reduction 3 with 3959 rules applied. Total rules applied 16892 place count 9690 transition count 19965
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16892 place count 9690 transition count 19958
Deduced a syphon composed of 7 places in 14 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 16906 place count 9683 transition count 19958
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 17895 place count 8694 transition count 16002
Iterating global reduction 3 with 989 rules applied. Total rules applied 18884 place count 8694 transition count 16002
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 12 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 18948 place count 8662 transition count 15970
Applied a total of 18948 rules in 10401 ms. Remains 8662 /18136 variables (removed 9474) and now considering 15970/28411 (removed 12441) transitions.
[2024-05-25 17:03:39] [INFO ] Flow matrix only has 14914 transitions (discarded 1056 similar events)
// Phase 1: matrix 14914 rows 8662 cols
[2024-05-25 17:03:39] [INFO ] Computed 1429 invariants in 693 ms
[2024-05-25 17:03:40] [INFO ] Implicit Places using invariants in 1448 ms returned []
Implicit Place search using SMT only with invariants took 1450 ms to find 0 implicit places.
[2024-05-25 17:03:40] [INFO ] Flow matrix only has 14914 transitions (discarded 1056 similar events)
[2024-05-25 17:03:40] [INFO ] Invariant cache hit.
[2024-05-25 17:03:41] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8662/18136 places, 15970/28411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12605 ms. Remains : 8662/18136 places, 15970/28411 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p3 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3 p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 p3 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2))), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1294 1) (LT s4324 1)), p1:(AND (GEQ s1294 1) (GEQ s4324 1)), p3:(AND (GEQ s4517 1) (GEQ s4520 1) (GEQ s5792 1)), p2:(AND (GEQ s5772 1) (GEQ s5...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3338 reset in 1782 ms.
Product exploration explored 100000 steps with 3334 reset in 1861 ms.
Computed a total of 2678 stabilizing places and 4033 stable transitions
Computed a total of 2678 stabilizing places and 4033 stable transitions
Detected a total of 2678/8662 stabilizing places and 4033/15970 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 p2))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2))))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2)))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 42 factoid took 309 ms. Reduced automaton from 3 states, 24 edges and 4 AP (stutter insensitive) to 3 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-25 17:03:46] [INFO ] Flow matrix only has 14914 transitions (discarded 1056 similar events)
[2024-05-25 17:03:46] [INFO ] Invariant cache hit.
[2024-05-25 17:03:48] [INFO ] [Real]Absence check using 65 positive place invariants in 145 ms returned sat
[2024-05-25 17:03:49] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 498 ms returned sat
[2024-05-25 17:03:49] [INFO ] After 3120ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:13
[2024-05-25 17:03:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 129 ms returned sat
[2024-05-25 17:03:51] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 527 ms returned sat
[2024-05-25 17:04:14] [INFO ] After 21597ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :6
[2024-05-25 17:04:14] [INFO ] State equation strengthened by 6187 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:251)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 17:04:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:04:14] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0 real:13
Fused 18 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 8662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8662/8662 places, 15970/15970 transitions.
Free-agglomeration rule (complex) applied 553 times.
Iterating global reduction 0 with 553 rules applied. Total rules applied 553 place count 8662 transition count 18384
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 0 with 553 rules applied. Total rules applied 1106 place count 8109 transition count 18384
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 1138 place count 8109 transition count 18384
Applied a total of 1138 rules in 7387 ms. Remains 8109 /8662 variables (removed 553) and now considering 18384/15970 (removed -2414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7387 ms. Remains : 8109/8662 places, 18384/15970 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 13147 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13147 steps, saw 6116 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-25 17:04:26] [INFO ] Flow matrix only has 16842 transitions (discarded 1542 similar events)
// Phase 1: matrix 16842 rows 8109 cols
[2024-05-25 17:04:26] [INFO ] Computed 1429 invariants in 740 ms
[2024-05-25 17:04:28] [INFO ] [Real]Absence check using 65 positive place invariants in 97 ms returned sat
[2024-05-25 17:04:28] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 488 ms returned sat
[2024-05-25 17:04:40] [INFO ] After 13282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 17:04:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 97 ms returned sat
[2024-05-25 17:04:41] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 497 ms returned sat
[2024-05-25 17:05:04] [INFO ] After 21550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 17:05:04] [INFO ] State equation strengthened by 9154 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:647)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:251)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 17:05:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:05:05] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 8109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8109/8109 places, 18384/18384 transitions.
Applied a total of 0 rules in 2253 ms. Remains 8109 /8109 variables (removed 0) and now considering 18384/18384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2253 ms. Remains : 8109/8109 places, 18384/18384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8109/8109 places, 18384/18384 transitions.
Applied a total of 0 rules in 2245 ms. Remains 8109 /8109 variables (removed 0) and now considering 18384/18384 (removed 0) transitions.
[2024-05-25 17:05:09] [INFO ] Flow matrix only has 16842 transitions (discarded 1542 similar events)
[2024-05-25 17:05:09] [INFO ] Invariant cache hit.
[2024-05-25 17:05:17] [INFO ] Implicit Places using invariants in 8042 ms returned []
Implicit Place search using SMT only with invariants took 8042 ms to find 0 implicit places.
[2024-05-25 17:05:17] [INFO ] Flow matrix only has 16842 transitions (discarded 1542 similar events)
[2024-05-25 17:05:17] [INFO ] Invariant cache hit.
[2024-05-25 17:05:30] [INFO ] Dead Transitions using invariants and state equation in 13262 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23553 ms. Remains : 8109/8109 places, 18384/18384 transitions.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 p3 p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 p2))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2))))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3 p2)))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2)))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) p3 p1))), (G (NOT (AND (NOT p0) (NOT p2) p3))), (G (NOT (AND (NOT p0) p2 p3 p1))), (G (NOT (AND p0 p2 (NOT p3) p1))), (G (NOT (AND (NOT p0) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p2) p3 p1))), (G (NOT (AND (NOT p0) p2 p3))), (G (NOT (AND (NOT p0) p2 (NOT p3) p1))), (G (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) p3 (NOT p1))))), (G (NOT (AND p0 p2 p3 p1))), (G (NOT (AND p0 p2 p3)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 53 factoid took 485 ms. Reduced automaton from 3 states, 24 edges and 4 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 8662 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 : 8662/8662 places, 15970/15970 transitions.
Applied a total of 0 rules in 2705 ms. Remains 8662 /8662 variables (removed 0) and now considering 15970/15970 (removed 0) transitions.
[2024-05-25 17:05:34] [INFO ] Flow matrix only has 14914 transitions (discarded 1056 similar events)
// Phase 1: matrix 14914 rows 8662 cols
[2024-05-25 17:05:34] [INFO ] Computed 1429 invariants in 688 ms
[2024-05-25 17:05:35] [INFO ] Implicit Places using invariants in 1452 ms returned []
Implicit Place search using SMT only with invariants took 1453 ms to find 0 implicit places.
[2024-05-25 17:05:35] [INFO ] Flow matrix only has 14914 transitions (discarded 1056 similar events)
[2024-05-25 17:05:35] [INFO ] Invariant cache hit.
[2024-05-25 17:05:36] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4899 ms. Remains : 8662/8662 places, 15970/15970 transitions.
Computed a total of 2678 stabilizing places and 4033 stable transitions
Computed a total of 2678 stabilizing places and 4033 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13547 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13547 steps, saw 6397 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 17:05:39] [INFO ] Flow matrix only has 14914 transitions (discarded 1056 similar events)
[2024-05-25 17:05:39] [INFO ] Invariant cache hit.
[2024-05-25 17:05:40] [INFO ] [Real]Absence check using 65 positive place invariants in 132 ms returned sat
[2024-05-25 17:05:41] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 514 ms returned sat
[2024-05-25 17:05:41] [INFO ] After 1597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:05:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 133 ms returned sat
[2024-05-25 17:05:43] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 528 ms returned sat
[2024-05-25 17:05:53] [INFO ] After 10785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:05:53] [INFO ] State equation strengthened by 6187 read => feed constraints.
[2024-05-25 17:05:56] [INFO ] After 2059ms SMT Verify possible using 6187 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 17:06:10] [INFO ] Deduced a trap composed of 414 places in 13836 ms of which 21 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 17:06:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:06:10] [INFO ] After 28718ms 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 2 out of 8662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8662/8662 places, 15970/15970 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 8662 transition count 15969
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8661 transition count 15969
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8660 transition count 15968
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8660 transition count 15968
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 8660 transition count 15967
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 8659 transition count 15967
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 8658 transition count 15963
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 8658 transition count 15963
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 8657 transition count 15962
Free-agglomeration rule (complex) applied 576 times.
Iterating global reduction 0 with 576 rules applied. Total rules applied 586 place count 8657 transition count 18356
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 0 with 576 rules applied. Total rules applied 1162 place count 8081 transition count 18356
Applied a total of 1162 rules in 12569 ms. Remains 8081 /8662 variables (removed 581) and now considering 18356/15970 (removed -2386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12569 ms. Remains : 8081/8662 places, 18356/15970 transitions.
Incomplete random walk after 10000 steps, including 398 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13565 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13565 steps, saw 6291 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 17:06:26] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2024-05-25 17:06:27] [INFO ] Computed 1429 invariants in 724 ms
[2024-05-25 17:06:27] [INFO ] [Real]Absence check using 65 positive place invariants in 116 ms returned sat
[2024-05-25 17:06:28] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 488 ms returned sat
[2024-05-25 17:06:39] [INFO ] After 12537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:06:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 115 ms returned sat
[2024-05-25 17:06:40] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 494 ms returned sat
[2024-05-25 17:06:52] [INFO ] After 10977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:06:52] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2024-05-25 17:06:54] [INFO ] After 2024ms SMT Verify possible using 9154 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 17:06:54] [INFO ] After 2757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 470 ms.
[2024-05-25 17:06:55] [INFO ] After 15779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2126 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2127 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2170 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
[2024-05-25 17:06:59] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2024-05-25 17:06:59] [INFO ] Invariant cache hit.
[2024-05-25 17:07:07] [INFO ] Implicit Places using invariants in 8142 ms returned []
Implicit Place search using SMT only with invariants took 8143 ms to find 0 implicit places.
[2024-05-25 17:07:07] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2024-05-25 17:07:07] [INFO ] Invariant cache hit.
[2024-05-25 17:07:20] [INFO ] Dead Transitions using invariants and state equation in 12551 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22869 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3339 reset in 1727 ms.
Product exploration explored 100000 steps with 3336 reset in 1748 ms.
Built C files in :
/tmp/ltsmin423842359635859289
[2024-05-25 17:07:24] [INFO ] Too many transitions (15970) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:07:24] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin423842359635859289
Running compilation step : cd /tmp/ltsmin423842359635859289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin423842359635859289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin423842359635859289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 8662 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8662/8662 places, 15970/15970 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 8662 transition count 15969
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8661 transition count 15969
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8660 transition count 15968
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8660 transition count 15968
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 8660 transition count 15967
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 8659 transition count 15967
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 8658 transition count 15963
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 8658 transition count 15963
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 8657 transition count 15962
Applied a total of 10 rules in 9966 ms. Remains 8657 /8662 variables (removed 5) and now considering 15962/15970 (removed 8) transitions.
[2024-05-25 17:07:37] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
// Phase 1: matrix 14906 rows 8657 cols
[2024-05-25 17:07:37] [INFO ] Computed 1429 invariants in 694 ms
[2024-05-25 17:07:38] [INFO ] Implicit Places using invariants in 1442 ms returned []
Implicit Place search using SMT only with invariants took 1442 ms to find 0 implicit places.
[2024-05-25 17:07:38] [INFO ] Flow matrix only has 14906 transitions (discarded 1056 similar events)
[2024-05-25 17:07:38] [INFO ] Invariant cache hit.
[2024-05-25 17:07:39] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8657/8662 places, 15962/15970 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12159 ms. Remains : 8657/8662 places, 15962/15970 transitions.
Built C files in :
/tmp/ltsmin10109347387705082025
[2024-05-25 17:07:39] [INFO ] Too many transitions (15962) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:07:39] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10109347387705082025
Running compilation step : cd /tmp/ltsmin10109347387705082025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10109347387705082025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10109347387705082025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 17:07:43] [INFO ] Flatten gal took : 426 ms
[2024-05-25 17:07:43] [INFO ] Flatten gal took : 417 ms
[2024-05-25 17:07:43] [INFO ] Time to serialize gal into /tmp/LTL2822573498687380976.gal : 90 ms
[2024-05-25 17:07:43] [INFO ] Time to serialize properties into /tmp/LTL3142495935731063622.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2822573498687380976.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1107897641706787445.hoa' '-atoms' '/tmp/LTL3142495935731063622.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3142495935731063622.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1107897641706787445.hoa
Detected timeout of ITS tools.
[2024-05-25 17:07:59] [INFO ] Flatten gal took : 483 ms
[2024-05-25 17:08:00] [INFO ] Flatten gal took : 371 ms
[2024-05-25 17:08:00] [INFO ] Time to serialize gal into /tmp/LTL3556217462540143985.gal : 70 ms
[2024-05-25 17:08:00] [INFO ] Time to serialize properties into /tmp/LTL17741940119651548391.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3556217462540143985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17741940119651548391.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node2ThinksNode18ShouldBeNodeMasterToReplaceNode16<1)||(Node18NotifyThatHeIsActive<1))"))||(("((Node2ThinksNode18ShouldBeNo...408
Formula 0 simplified : G(F!"((Node2ThinksNode18ShouldBeNodeMasterToReplaceNode16<1)||(Node18NotifyThatHeIsActive<1))" & (!"((Node2ThinksNode18ShouldBeNodeM...401
Detected timeout of ITS tools.
[2024-05-25 17:08:15] [INFO ] Flatten gal took : 368 ms
[2024-05-25 17:08:15] [INFO ] Applying decomposition
[2024-05-25 17:08:16] [INFO ] Flatten gal took : 374 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2583435777265417577.txt' '-o' '/tmp/graph2583435777265417577.bin' '-w' '/tmp/graph2583435777265417577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2583435777265417577.bin' '-l' '-1' '-v' '-w' '/tmp/graph2583435777265417577.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:08:16] [INFO ] Decomposing Gal with order
[2024-05-25 17:08:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:08:21] [INFO ] Removed a total of 14057 redundant transitions.
[2024-05-25 17:08:22] [INFO ] Flatten gal took : 3812 ms
[2024-05-25 17:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 9688 labels/synchronizations in 1164 ms.
[2024-05-25 17:08:24] [INFO ] Time to serialize gal into /tmp/LTL1485186888300910911.gal : 102 ms
[2024-05-25 17:08:24] [INFO ] Time to serialize properties into /tmp/LTL7780661926894998228.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1485186888300910911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7780661926894998228.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i20.u99.Node2ThinksNode18ShouldBeNodeMasterToReplaceNode16<1)||(i20.u324.Node18NotifyThatHeIsActive<1))"))||(("((i20.u99.No...478
Formula 0 simplified : G(F!"((i20.u99.Node2ThinksNode18ShouldBeNodeMasterToReplaceNode16<1)||(i20.u324.Node18NotifyThatHeIsActive<1))" & (!"((i20.u99.Node2...471
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2916474669903566827
[2024-05-25 17:08:39] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2916474669903566827
Running compilation step : cd /tmp/ltsmin2916474669903566827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2916474669903566827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2916474669903566827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C04-LTLFireability-15 finished in 313828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||((p2 U G(p3))&&p1))))'
[2024-05-25 17:08:43] [INFO ] Flatten gal took : 691 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin206792652009456014
[2024-05-25 17:08:43] [INFO ] Too many transitions (28411) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:08:44] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin206792652009456014
Running compilation step : cd /tmp/ltsmin206792652009456014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 17:08:44] [INFO ] Applying decomposition
[2024-05-25 17:08:45] [INFO ] Flatten gal took : 727 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13465179363994066456.txt' '-o' '/tmp/graph13465179363994066456.bin' '-w' '/tmp/graph13465179363994066456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13465179363994066456.bin' '-l' '-1' '-v' '-w' '/tmp/graph13465179363994066456.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:08:47] [INFO ] Decomposing Gal with order
[2024-05-25 17:08:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:08:56] [INFO ] Removed a total of 20308 redundant transitions.
[2024-05-25 17:08:57] [INFO ] Flatten gal took : 4423 ms
[2024-05-25 17:09:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 9568 labels/synchronizations in 1338 ms.
[2024-05-25 17:09:00] [INFO ] Time to serialize gal into /tmp/LTLFireability2886305480809563156.gal : 164 ms
[2024-05-25 17:09:00] [INFO ] Time to serialize properties into /tmp/LTLFireability6618764962397773819.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2886305480809563156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6618764962397773819.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((G(F("((i4.i1.u104.Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(i1.i1.u398.Node23NotifyThatHeIsActive<1))"))))
Formula 0 simplified : FG!"((i4.i1.u104.Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(i1.i1.u398.Node23NotifyThatHeIsActive<1))"
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin206792652009456014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin206792652009456014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-25 17:19:03] [INFO ] Flatten gal took : 935 ms
[2024-05-25 17:19:03] [INFO ] Time to serialize gal into /tmp/LTLFireability2259552962936496528.gal : 145 ms
[2024-05-25 17:19:03] [INFO ] Time to serialize properties into /tmp/LTLFireability17591894245022408369.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2259552962936496528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17591894245022408369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G(F("((Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(Node23NotifyThatHeIsActive<1))"))))
Formula 0 simplified : FG!"((Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(Node23NotifyThatHeIsActive<1))"
ITS-tools command line returned an error code 137
[2024-05-25 17:41:52] [INFO ] Flatten gal took : 2848 ms
[2024-05-25 17:41:55] [INFO ] Input system was already deterministic with 28411 transitions.
[2024-05-25 17:41:56] [INFO ] Transformed 18136 places.
[2024-05-25 17:41:56] [INFO ] Transformed 28411 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 17:42:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10300706305428547762.gal : 104 ms
[2024-05-25 17:42:33] [INFO ] Time to serialize properties into /tmp/LTLFireability4030192814799231844.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10300706305428547762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4030192814799231844.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(Node23NotifyThatHeIsActive<1))"))))
Formula 0 simplified : FG!"((Node2ThinksNode23ShouldBeNodeMasterToReplaceNode9<1)||(Node23NotifyThatHeIsActive<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11405600 kB
After kill :
MemTotal: 16393216 kB
MemFree: 13216572 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S32C04, 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 r263-tall-171654372100103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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