Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 11K Feb 26 03:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 03:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 03:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 26M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679626379200

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-24 02:53:00] [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]
[2023-03-24 02:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 02:53:01] [INFO ] Load time of PNML (sax parser for PT used): 731 ms
[2023-03-24 02:53:01] [INFO ] Transformed 25134 places.
[2023-03-24 02:53:01] [INFO ] Transformed 38317 transitions.
[2023-03-24 02:53:01] [INFO ] Parsed PT model containing 25134 places and 38317 transitions and 148438 arcs in 995 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 25134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25134/25134 places, 38317/38317 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 25084 transition count 38317
Applied a total of 50 rules in 2221 ms. Remains 25084 /25134 variables (removed 50) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 02:53:04] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 02:53:08] [INFO ] Computed 1633 place invariants in 4509 ms
[2023-03-24 02:53:11] [INFO ] Implicit Places using invariants in 6796 ms returned []
Implicit Place search using SMT only with invariants took 6822 ms to find 0 implicit places.
[2023-03-24 02:53:11] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 02:53:11] [INFO ] Invariant cache hit.
[2023-03-24 02:53:13] [INFO ] Dead Transitions using invariants and state equation in 2044 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25084/25134 places, 38317/38317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11101 ms. Remains : 25084/25134 places, 38317/38317 transitions.
Support contains 48 out of 25084 places after structural reductions.
[2023-03-24 02:53:15] [INFO ] Flatten gal took : 1358 ms
[2023-03-24 02:53:16] [INFO ] Flatten gal took : 1126 ms
[2023-03-24 02:53:18] [INFO ] Input system was already deterministic with 38317 transitions.
Support contains 46 out of 25084 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 791 ms. (steps per millisecond=12 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 6849 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{2=1}
Probabilistic random walk after 6849 steps, saw 3413 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :1
Running SMT prover for 20 properties.
[2023-03-24 02:53:22] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 02:53:22] [INFO ] Invariant cache hit.
[2023-03-24 02:53:32] [INFO ] [Real]Absence check using 63 positive place invariants in 391 ms returned sat
[2023-03-24 02:53:33] [INFO ] [Real]Absence check using 63 positive and 1570 generalized place invariants in 1195 ms returned sat
[2023-03-24 02:53:47] [INFO ] After 8290ms SMT Verify possible using state equation in real domain returned unsat :1 sat :18
[2023-03-24 02:53:48] [INFO ] State equation strengthened by 12322 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 02:53:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 02:53:48] [INFO ] After 25218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 25084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7387 transitions
Trivial Post-agglo rules discarded 7387 transitions
Performed 7387 trivial Post agglomeration. Transition count delta: 7387
Iterating post reduction 0 with 7387 rules applied. Total rules applied 7387 place count 25084 transition count 30930
Reduce places removed 7387 places and 0 transitions.
Iterating post reduction 1 with 7387 rules applied. Total rules applied 14774 place count 17697 transition count 30930
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 462 Pre rules applied. Total rules applied 14774 place count 17697 transition count 30468
Deduced a syphon composed of 462 places in 29 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 2 with 924 rules applied. Total rules applied 15698 place count 17235 transition count 30468
Discarding 6925 places :
Symmetric choice reduction at 2 with 6925 rule applications. Total rules 22623 place count 10310 transition count 23543
Iterating global reduction 2 with 6925 rules applied. Total rules applied 29548 place count 10310 transition count 23543
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29548 place count 10310 transition count 23533
Deduced a syphon composed of 10 places in 23 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 29568 place count 10300 transition count 23533
Discarding 983 places :
Symmetric choice reduction at 2 with 983 rule applications. Total rules 30551 place count 9317 transition count 16652
Iterating global reduction 2 with 983 rules applied. Total rules applied 31534 place count 9317 transition count 16652
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 15 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 31596 place count 9286 transition count 16621
Free-agglomeration rule (complex) applied 562 times.
Iterating global reduction 2 with 562 rules applied. Total rules applied 32158 place count 9286 transition count 21957
Reduce places removed 562 places and 0 transitions.
Iterating post reduction 2 with 562 rules applied. Total rules applied 32720 place count 8724 transition count 21957
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 3 with 132 rules applied. Total rules applied 32852 place count 8724 transition count 21957
Applied a total of 32852 rules in 13268 ms. Remains 8724 /25084 variables (removed 16360) and now considering 21957/38317 (removed 16360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13270 ms. Remains : 8724/25084 places, 21957/38317 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 12924 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12924 steps, saw 6190 distinct states, run finished after 3002 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 18 properties.
[2023-03-24 02:54:05] [INFO ] Flow matrix only has 20410 transitions (discarded 1547 similar events)
// Phase 1: matrix 20410 rows 8724 cols
[2023-03-24 02:54:06] [INFO ] Computed 1633 place invariants in 965 ms
[2023-03-24 02:54:09] [INFO ] [Real]Absence check using 65 positive place invariants in 158 ms returned sat
[2023-03-24 02:54:09] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 580 ms returned sat
[2023-03-24 02:54:31] [INFO ] After 19434ms SMT Verify possible using state equation in real domain returned unsat :0 sat :18
[2023-03-24 02:54:31] [INFO ] State equation strengthened by 12322 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 02:54:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 02:54:31] [INFO ] After 25394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 32 out of 8724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8724/8724 places, 21957/21957 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 8724 transition count 21956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8723 transition count 21956
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8723 transition count 21955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8722 transition count 21955
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 8721 transition count 21954
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 8721 transition count 21954
Applied a total of 6 rules in 4266 ms. Remains 8721 /8724 variables (removed 3) and now considering 21954/21957 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4266 ms. Remains : 8721/8724 places, 21954/21957 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-24 02:54:37] [INFO ] Flow matrix only has 20407 transitions (discarded 1547 similar events)
// Phase 1: matrix 20407 rows 8721 cols
[2023-03-24 02:54:38] [INFO ] Computed 1633 place invariants in 1017 ms
[2023-03-24 02:54:40] [INFO ] [Real]Absence check using 65 positive place invariants in 140 ms returned sat
[2023-03-24 02:54:41] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 568 ms returned sat
[2023-03-24 02:55:03] [INFO ] After 19963ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2023-03-24 02:55:03] [INFO ] State equation strengthened by 12322 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 02:55:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 02:55:03] [INFO ] After 25391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 30 out of 8721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8721/8721 places, 21954/21954 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8721 transition count 21952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8719 transition count 21952
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 8719 transition count 21951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 8718 transition count 21951
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 8716 transition count 21949
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 8716 transition count 21949
Applied a total of 10 rules in 4280 ms. Remains 8716 /8721 variables (removed 5) and now considering 21949/21954 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4281 ms. Remains : 8716/8721 places, 21949/21954 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19068 stabilizing places and 26348 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 25084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7376 transitions
Trivial Post-agglo rules discarded 7376 transitions
Performed 7376 trivial Post agglomeration. Transition count delta: 7376
Iterating post reduction 0 with 7376 rules applied. Total rules applied 7376 place count 25084 transition count 30941
Reduce places removed 7376 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 7392 rules applied. Total rules applied 14768 place count 17708 transition count 30925
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 14784 place count 17692 transition count 30925
Performed 461 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 461 Pre rules applied. Total rules applied 14784 place count 17692 transition count 30464
Deduced a syphon composed of 461 places in 25 ms
Reduce places removed 461 places and 0 transitions.
Iterating global reduction 3 with 922 rules applied. Total rules applied 15706 place count 17231 transition count 30464
Discarding 6929 places :
Symmetric choice reduction at 3 with 6929 rule applications. Total rules 22635 place count 10302 transition count 23535
Iterating global reduction 3 with 6929 rules applied. Total rules applied 29564 place count 10302 transition count 23535
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 29564 place count 10302 transition count 23522
Deduced a syphon composed of 13 places in 17 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 29590 place count 10289 transition count 23522
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 30579 place count 9300 transition count 16599
Iterating global reduction 3 with 989 rules applied. Total rules applied 31568 place count 9300 transition count 16599
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 31634 place count 9267 transition count 16566
Applied a total of 31634 rules in 9377 ms. Remains 9267 /25084 variables (removed 15817) and now considering 16566/38317 (removed 21751) transitions.
[2023-03-24 02:55:17] [INFO ] Flow matrix only has 15510 transitions (discarded 1056 similar events)
// Phase 1: matrix 15510 rows 9267 cols
[2023-03-24 02:55:18] [INFO ] Computed 1633 place invariants in 793 ms
[2023-03-24 02:55:19] [INFO ] Implicit Places using invariants in 1680 ms returned []
Implicit Place search using SMT only with invariants took 1681 ms to find 0 implicit places.
[2023-03-24 02:55:19] [INFO ] Flow matrix only has 15510 transitions (discarded 1056 similar events)
[2023-03-24 02:55:19] [INFO ] Invariant cache hit.
[2023-03-24 02:55:20] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9267/25084 places, 16566/38317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11973 ms. Remains : 9267/25084 places, 16566/38317 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1189 1) (GEQ s3199 1)), p1:(AND (GEQ s1343 1) (GEQ s6799 1)), p2:(AND (NOT (AND (GEQ s1378 1) (GEQ s1569 1))) (NOT (AND (GEQ s1343 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1980 reset in 1805 ms.
Product exploration explored 100000 steps with 1980 reset in 1745 ms.
Computed a total of 3284 stabilizing places and 4630 stable transitions
Computed a total of 3284 stabilizing places and 4630 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 198 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13209 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13209 steps, saw 6428 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 02:55:27] [INFO ] Flow matrix only has 15510 transitions (discarded 1056 similar events)
[2023-03-24 02:55:27] [INFO ] Invariant cache hit.
[2023-03-24 02:55:29] [INFO ] [Real]Absence check using 65 positive place invariants in 180 ms returned sat
[2023-03-24 02:55:29] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 618 ms returned sat
[2023-03-24 02:55:30] [INFO ] After 2101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 02:55:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 158 ms returned sat
[2023-03-24 02:55:31] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 626 ms returned sat
[2023-03-24 02:55:46] [INFO ] After 13922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 02:55:46] [INFO ] State equation strengthened by 6388 read => feed constraints.
[2023-03-24 02:55:55] [INFO ] After 8815ms SMT Verify possible using 6388 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-24 02:55:55] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 9267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9267/9267 places, 16566/16566 transitions.
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 0 with 577 rules applied. Total rules applied 577 place count 9267 transition count 21923
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 0 with 577 rules applied. Total rules applied 1154 place count 8690 transition count 21923
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 1186 place count 8690 transition count 21923
Applied a total of 1186 rules in 5294 ms. Remains 8690 /9267 variables (removed 577) and now considering 21923/16566 (removed -5357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5295 ms. Remains : 8690/9267 places, 21923/16566 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12712 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12712 steps, saw 6086 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 02:56:04] [INFO ] Flow matrix only has 20357 transitions (discarded 1566 similar events)
// Phase 1: matrix 20357 rows 8690 cols
[2023-03-24 02:56:05] [INFO ] Computed 1633 place invariants in 921 ms
[2023-03-24 02:56:06] [INFO ] [Real]Absence check using 65 positive place invariants in 157 ms returned sat
[2023-03-24 02:56:06] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 597 ms returned sat
[2023-03-24 02:56:06] [INFO ] After 1830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 02:56:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 161 ms returned sat
[2023-03-24 02:56:08] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 570 ms returned sat
[2023-03-24 02:56:22] [INFO ] After 14001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 02:56:22] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2023-03-24 02:56:24] [INFO ] After 1833ms SMT Verify possible using 12322 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 02:56:25] [INFO ] After 2652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 592 ms.
[2023-03-24 02:56:26] [INFO ] After 19201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 8690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8690/8690 places, 21923/21923 transitions.
Applied a total of 0 rules in 1352 ms. Remains 8690 /8690 variables (removed 0) and now considering 21923/21923 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1352 ms. Remains : 8690/8690 places, 21923/21923 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8690/8690 places, 21923/21923 transitions.
Applied a total of 0 rules in 1354 ms. Remains 8690 /8690 variables (removed 0) and now considering 21923/21923 (removed 0) transitions.
[2023-03-24 02:56:28] [INFO ] Flow matrix only has 20357 transitions (discarded 1566 similar events)
[2023-03-24 02:56:28] [INFO ] Invariant cache hit.
[2023-03-24 02:56:29] [INFO ] Implicit Places using invariants in 747 ms returned []
Implicit Place search using SMT only with invariants took 749 ms to find 0 implicit places.
[2023-03-24 02:56:29] [INFO ] Flow matrix only has 20357 transitions (discarded 1566 similar events)
[2023-03-24 02:56:29] [INFO ] Invariant cache hit.
[2023-03-24 02:56:30] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2966 ms. Remains : 8690/8690 places, 21923/21923 transitions.
Graph (trivial) has 7144 edges and 8690 vertex of which 33 / 8690 are part of one of the 1 SCC in 9 ms
Free SCC test removed 32 places
Drop transitions removed 1116 transitions
Ensure Unique test removed 1506 transitions
Reduce isomorphic transitions removed 2622 transitions.
Graph (complete) has 66335 edges and 8658 vertex of which 8630 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.9 ms
Discarding 28 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 t17076.t19125 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 450 rules applied. Total rules applied 452 place count 7988 transition count 18851
Ensure Unique test removed 1 places
Reduce places removed 449 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 447 transitions
Reduce isomorphic transitions removed 448 transitions.
Drop transitions removed 447 transitions
Trivial Post-agglo rules discarded 447 transitions
Performed 447 trivial Post agglomeration. Transition count delta: 447
Iterating post reduction 1 with 1344 rules applied. Total rules applied 1796 place count 7539 transition count 17956
Ensure Unique test removed 1 places
Reduce places removed 448 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 447 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 2 with 1286 rules applied. Total rules applied 3082 place count 7091 transition count 17118
Ensure Unique test removed 56 places
Reduce places removed 447 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 389 transitions
Reduce isomorphic transitions removed 391 transitions.
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 3 with 1227 rules applied. Total rules applied 4309 place count 6644 transition count 16338
Ensure Unique test removed 2 places
Reduce places removed 391 places and 0 transitions.
Drop transitions removed 52 transitions
Ensure Unique test removed 337 transitions
Reduce isomorphic transitions removed 389 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 4 with 1117 rules applied. Total rules applied 5426 place count 6253 transition count 15612
Ensure Unique test removed 52 places
Reduce places removed 389 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 335 transitions
Reduce isomorphic transitions removed 337 transitions.
Drop transitions removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 5 with 1061 rules applied. Total rules applied 6487 place count 5864 transition count 14940
Ensure Unique test removed 2 places
Reduce places removed 337 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 335 transitions.
Drop transitions removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 6 with 959 rules applied. Total rules applied 7446 place count 5527 transition count 14318
Ensure Unique test removed 48 places
Reduce places removed 335 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 287 transitions.
Drop transitions removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 7 with 907 rules applied. Total rules applied 8353 place count 5192 transition count 13746
Ensure Unique test removed 2 places
Reduce places removed 287 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 241 transitions
Reduce isomorphic transitions removed 285 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 8 with 813 rules applied. Total rules applied 9166 place count 4905 transition count 13220
Ensure Unique test removed 44 places
Reduce places removed 285 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 9 with 765 rules applied. Total rules applied 9931 place count 4620 transition count 12740
Ensure Unique test removed 2 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 10 with 678 rules applied. Total rules applied 10609 place count 4379 transition count 12303
Ensure Unique test removed 40 places
Reduce places removed 238 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 11 with 632 rules applied. Total rules applied 11241 place count 4141 transition count 11909
Ensure Unique test removed 2 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 196 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 12 with 554 rules applied. Total rules applied 11795 place count 3943 transition count 11553
Ensure Unique test removed 36 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 13 with 514 rules applied. Total rules applied 12309 place count 3747 transition count 11235
Ensure Unique test removed 2 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 14 with 445 rules applied. Total rules applied 12754 place count 3587 transition count 10950
Ensure Unique test removed 31 places
Reduce places removed 158 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 15 with 410 rules applied. Total rules applied 13164 place count 3429 transition count 10698
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 16 with 349 rules applied. Total rules applied 13513 place count 3302 transition count 10476
Ensure Unique test removed 28 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 17 with 317 rules applied. Total rules applied 13830 place count 3177 transition count 10284
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 18 with 263 rules applied. Total rules applied 14093 place count 3080 transition count 10118
Ensure Unique test removed 24 places
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 19 with 235 rules applied. Total rules applied 14328 place count 2985 transition count 9978
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 20 with 189 rules applied. Total rules applied 14517 place count 2914 transition count 9860
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 21 with 165 rules applied. Total rules applied 14682 place count 2845 transition count 9764
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 22 with 127 rules applied. Total rules applied 14809 place count 2796 transition count 9686
Ensure Unique test removed 16 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 23 with 107 rules applied. Total rules applied 14916 place count 2749 transition count 9626
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 24 with 77 rules applied. Total rules applied 14993 place count 2718 transition count 9580
Ensure Unique test removed 12 places
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 17 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 62 rules applied. Total rules applied 15055 place count 2689 transition count 9547
Ensure Unique test removed 1 places
Reduce places removed 17 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 41 rules applied. Total rules applied 15096 place count 2672 transition count 9523
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 15126 place count 2656 transition count 9509
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 15142 place count 2648 transition count 9501
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 15151 place count 2642 transition count 9498
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 15155 place count 2639 transition count 9497
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 462 Pre rules applied. Total rules applied 15155 place count 2639 transition count 9035
Deduced a syphon composed of 462 places in 3 ms
Ensure Unique test removed 461 places
Reduce places removed 923 places and 0 transitions.
Iterating global reduction 31 with 1385 rules applied. Total rules applied 16540 place count 1716 transition count 9035
Discarding 479 places :
Symmetric choice reduction at 31 with 479 rule applications. Total rules 17019 place count 1237 transition count 8556
Iterating global reduction 31 with 479 rules applied. Total rules applied 17498 place count 1237 transition count 8556
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 17498 place count 1237 transition count 8555
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 17500 place count 1236 transition count 8555
Discarding 974 places :
Symmetric choice reduction at 31 with 974 rule applications. Total rules 18474 place count 262 transition count 1737
Iterating global reduction 31 with 974 rules applied. Total rules applied 19448 place count 262 transition count 1737
Ensure Unique test removed 974 transitions
Reduce isomorphic transitions removed 974 transitions.
Iterating post reduction 31 with 974 rules applied. Total rules applied 20422 place count 262 transition count 763
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 32 with 115 rules applied. Total rules applied 20537 place count 204 transition count 706
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 32 with 24 rules applied. Total rules applied 20561 place count 204 transition count 682
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 33 with 2 rules applied. Total rules applied 20563 place count 204 transition count 680
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 33 with 16 rules applied. Total rules applied 20579 place count 204 transition count 664
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 33 with 16 rules applied. Total rules applied 20595 place count 188 transition count 664
Discarding 30 places :
Symmetric choice reduction at 34 with 30 rule applications. Total rules 20625 place count 158 transition count 454
Ensure Unique test removed 14 places
Iterating global reduction 34 with 44 rules applied. Total rules applied 20669 place count 144 transition count 454
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 34 with 30 rules applied. Total rules applied 20699 place count 144 transition count 424
Discarding 14 places :
Symmetric choice reduction at 35 with 14 rule applications. Total rules 20713 place count 130 transition count 326
Iterating global reduction 35 with 14 rules applied. Total rules applied 20727 place count 130 transition count 326
Discarding 13 places :
Symmetric choice reduction at 35 with 13 rule applications. Total rules 20740 place count 117 transition count 313
Iterating global reduction 35 with 13 rules applied. Total rules applied 20753 place count 117 transition count 313
Applied a total of 20753 rules in 26563 ms. Remains 117 /8690 variables (removed 8573) and now considering 313/21923 (removed 21610) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 117 cols
[2023-03-24 02:56:57] [INFO ] Computed 40 place invariants in 7 ms
[2023-03-24 02:56:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 02:56:57] [INFO ] [Real]Absence check using 5 positive and 35 generalized place invariants in 6 ms returned sat
[2023-03-24 02:56:57] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 02:56:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 02:56:57] [INFO ] [Nat]Absence check using 5 positive and 35 generalized place invariants in 5 ms returned sat
[2023-03-24 02:56:57] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 02:56:57] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-24 02:56:57] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 6 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-00 finished in 109217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(G(F(!p1))||G(!p2)))))))'
Support contains 8 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 1740 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 02:56:59] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 02:57:03] [INFO ] Computed 1633 place invariants in 4245 ms
[2023-03-24 02:57:05] [INFO ] Implicit Places using invariants in 6392 ms returned []
Implicit Place search using SMT only with invariants took 6395 ms to find 0 implicit places.
[2023-03-24 02:57:05] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 02:57:05] [INFO ] Invariant cache hit.
[2023-03-24 02:57:07] [INFO ] Dead Transitions using invariants and state equation in 2149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10290 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 315 ms :[p0, p0, true, (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s19042 1) (GEQ s24388 1)), p2:(AND (GEQ s2 1) (GEQ s12313 1) (GEQ s12315 1) (GEQ s14336 1)), p1:(AND (GEQ s17193 1) (GEQ s25034 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1394 reset in 3723 ms.
Product exploration explored 100000 steps with 1394 reset in 3708 ms.
Computed a total of 19068 stabilizing places and 26348 stable transitions
Computed a total of 19068 stabilizing places and 26348 stable transitions
Detected a total of 19068/25084 stabilizing places and 26348/38317 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 692 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 139 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-24 02:57:18] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 02:57:18] [INFO ] Invariant cache hit.
[2023-03-24 02:57:23] [INFO ] [Real]Absence check using 63 positive place invariants in 362 ms returned sat
[2023-03-24 02:57:24] [INFO ] [Real]Absence check using 63 positive and 1570 generalized place invariants in 1380 ms returned sat
[2023-03-24 02:57:24] [INFO ] After 6731ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-24 02:57:29] [INFO ] [Nat]Absence check using 63 positive place invariants in 300 ms returned sat
[2023-03-24 02:57:30] [INFO ] [Nat]Absence check using 63 positive and 1570 generalized place invariants in 1365 ms returned sat
[2023-03-24 02:57:49] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 25084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7392 transitions
Trivial Post-agglo rules discarded 7392 transitions
Performed 7392 trivial Post agglomeration. Transition count delta: 7392
Iterating post reduction 0 with 7392 rules applied. Total rules applied 7392 place count 25084 transition count 30925
Reduce places removed 7392 places and 0 transitions.
Iterating post reduction 1 with 7392 rules applied. Total rules applied 14784 place count 17692 transition count 30925
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 462 Pre rules applied. Total rules applied 14784 place count 17692 transition count 30463
Deduced a syphon composed of 462 places in 35 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 2 with 924 rules applied. Total rules applied 15708 place count 17230 transition count 30463
Discarding 6930 places :
Symmetric choice reduction at 2 with 6930 rule applications. Total rules 22638 place count 10300 transition count 23533
Iterating global reduction 2 with 6930 rules applied. Total rules applied 29568 place count 10300 transition count 23533
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29568 place count 10300 transition count 23519
Deduced a syphon composed of 14 places in 19 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 29596 place count 10286 transition count 23519
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 30585 place count 9297 transition count 16596
Iterating global reduction 2 with 989 rules applied. Total rules applied 31574 place count 9297 transition count 16596
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 18 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 31640 place count 9264 transition count 16563
Free-agglomeration rule (complex) applied 510 times.
Iterating global reduction 2 with 510 rules applied. Total rules applied 32150 place count 9264 transition count 16053
Reduce places removed 510 places and 0 transitions.
Iterating post reduction 2 with 510 rules applied. Total rules applied 32660 place count 8754 transition count 16053
Applied a total of 32660 rules in 11708 ms. Remains 8754 /25084 variables (removed 16330) and now considering 16053/38317 (removed 22264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11709 ms. Remains : 8754/25084 places, 16053/38317 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 13904 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{2=1}
Probabilistic random walk after 13904 steps, saw 6748 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-24 02:58:05] [INFO ] Flow matrix only has 14487 transitions (discarded 1566 similar events)
// Phase 1: matrix 14487 rows 8754 cols
[2023-03-24 02:58:05] [INFO ] Computed 1633 place invariants in 747 ms
[2023-03-24 02:58:07] [INFO ] [Real]Absence check using 65 positive place invariants in 159 ms returned sat
[2023-03-24 02:58:07] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 607 ms returned sat
[2023-03-24 02:58:19] [INFO ] After 13892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 02:58:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 150 ms returned sat
[2023-03-24 02:58:21] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 571 ms returned sat
[2023-03-24 02:58:33] [INFO ] After 11802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 02:58:33] [INFO ] State equation strengthened by 6388 read => feed constraints.
[2023-03-24 02:58:44] [INFO ] After 11272ms SMT Verify possible using 6388 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-24 02:58:44] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 8754 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8754/8754 places, 16053/16053 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8753 transition count 16046
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8753 transition count 16046
Applied a total of 2 rules in 3284 ms. Remains 8753 /8754 variables (removed 1) and now considering 16046/16053 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3285 ms. Remains : 8753/8754 places, 16046/16053 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13866 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13866 steps, saw 6732 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 02:58:51] [INFO ] Flow matrix only has 14480 transitions (discarded 1566 similar events)
// Phase 1: matrix 14480 rows 8753 cols
[2023-03-24 02:58:52] [INFO ] Computed 1633 place invariants in 778 ms
[2023-03-24 02:58:53] [INFO ] [Real]Absence check using 65 positive place invariants in 147 ms returned sat
[2023-03-24 02:58:54] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 690 ms returned sat
[2023-03-24 02:59:06] [INFO ] After 14062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 02:59:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 130 ms returned sat
[2023-03-24 02:59:07] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 588 ms returned sat
[2023-03-24 02:59:20] [INFO ] After 12217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 02:59:20] [INFO ] State equation strengthened by 6382 read => feed constraints.
[2023-03-24 02:59:31] [INFO ] After 10896ms SMT Verify possible using 6382 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-24 02:59:31] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 8753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8753/8753 places, 16046/16046 transitions.
Applied a total of 0 rules in 1962 ms. Remains 8753 /8753 variables (removed 0) and now considering 16046/16046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1962 ms. Remains : 8753/8753 places, 16046/16046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8753/8753 places, 16046/16046 transitions.
Applied a total of 0 rules in 2012 ms. Remains 8753 /8753 variables (removed 0) and now considering 16046/16046 (removed 0) transitions.
[2023-03-24 02:59:35] [INFO ] Flow matrix only has 14480 transitions (discarded 1566 similar events)
[2023-03-24 02:59:35] [INFO ] Invariant cache hit.
[2023-03-24 02:59:36] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 870 ms to find 0 implicit places.
[2023-03-24 02:59:36] [INFO ] Flow matrix only has 14480 transitions (discarded 1566 similar events)
[2023-03-24 02:59:36] [INFO ] Invariant cache hit.
[2023-03-24 02:59:36] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3635 ms. Remains : 8753/8753 places, 16046/16046 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 p1))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F p1), (F p2)]
Knowledge based reduction with 18 factoid took 903 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 312 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Support contains 8 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 1796 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 02:59:40] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 02:59:44] [INFO ] Computed 1633 place invariants in 4224 ms
[2023-03-24 02:59:46] [INFO ] Implicit Places using invariants in 6089 ms returned []
Implicit Place search using SMT only with invariants took 6096 ms to find 0 implicit places.
[2023-03-24 02:59:46] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 02:59:46] [INFO ] Invariant cache hit.
[2023-03-24 02:59:48] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9769 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Computed a total of 19068 stabilizing places and 26348 stable transitions
Computed a total of 19068 stabilizing places and 26348 stable transitions
Detected a total of 19068/25084 stabilizing places and 26348/38317 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 611 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 139 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 02:59:49] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 02:59:49] [INFO ] Invariant cache hit.
[2023-03-24 02:59:53] [INFO ] [Real]Absence check using 63 positive place invariants in 269 ms returned sat
[2023-03-24 02:59:54] [INFO ] [Real]Absence check using 63 positive and 1570 generalized place invariants in 1165 ms returned sat
[2023-03-24 03:00:15] [INFO ] After 19504ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 03:00:15] [INFO ] State equation strengthened by 12322 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 03:00:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:00:15] [INFO ] After 25150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 25084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7392 transitions
Trivial Post-agglo rules discarded 7392 transitions
Performed 7392 trivial Post agglomeration. Transition count delta: 7392
Iterating post reduction 0 with 7392 rules applied. Total rules applied 7392 place count 25084 transition count 30925
Reduce places removed 7392 places and 0 transitions.
Iterating post reduction 1 with 7392 rules applied. Total rules applied 14784 place count 17692 transition count 30925
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 462 Pre rules applied. Total rules applied 14784 place count 17692 transition count 30463
Deduced a syphon composed of 462 places in 50 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 2 with 924 rules applied. Total rules applied 15708 place count 17230 transition count 30463
Discarding 6930 places :
Symmetric choice reduction at 2 with 6930 rule applications. Total rules 22638 place count 10300 transition count 23533
Iterating global reduction 2 with 6930 rules applied. Total rules applied 29568 place count 10300 transition count 23533
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29568 place count 10300 transition count 23519
Deduced a syphon composed of 14 places in 17 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 29596 place count 10286 transition count 23519
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 30585 place count 9297 transition count 16596
Iterating global reduction 2 with 989 rules applied. Total rules applied 31574 place count 9297 transition count 16596
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 20 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 31640 place count 9264 transition count 16563
Free-agglomeration rule (complex) applied 576 times.
Iterating global reduction 2 with 576 rules applied. Total rules applied 32216 place count 9264 transition count 21921
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 2 with 576 rules applied. Total rules applied 32792 place count 8688 transition count 21921
Applied a total of 32792 rules in 11916 ms. Remains 8688 /25084 variables (removed 16396) and now considering 21921/38317 (removed 16396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11919 ms. Remains : 8688/25084 places, 21921/38317 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12480 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12480 steps, saw 5991 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 03:00:31] [INFO ] Flow matrix only has 20355 transitions (discarded 1566 similar events)
// Phase 1: matrix 20355 rows 8688 cols
[2023-03-24 03:00:32] [INFO ] Computed 1633 place invariants in 982 ms
[2023-03-24 03:00:33] [INFO ] [Real]Absence check using 65 positive place invariants in 122 ms returned sat
[2023-03-24 03:00:33] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 594 ms returned sat
[2023-03-24 03:00:48] [INFO ] After 14394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-24 03:00:48] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2023-03-24 03:00:50] [INFO ] After 2315ms SMT Verify possible using 12322 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:00:50] [INFO ] After 18840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:00:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 116 ms returned sat
[2023-03-24 03:00:52] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 570 ms returned sat
[2023-03-24 03:01:07] [INFO ] After 14916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:01:11] [INFO ] After 3383ms SMT Verify possible using 12322 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 03:01:12] [INFO ] After 5127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1293 ms.
[2023-03-24 03:01:14] [INFO ] After 23196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 8688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8688/8688 places, 21921/21921 transitions.
Applied a total of 0 rules in 1393 ms. Remains 8688 /8688 variables (removed 0) and now considering 21921/21921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1393 ms. Remains : 8688/8688 places, 21921/21921 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8688/8688 places, 21921/21921 transitions.
Applied a total of 0 rules in 1397 ms. Remains 8688 /8688 variables (removed 0) and now considering 21921/21921 (removed 0) transitions.
[2023-03-24 03:01:16] [INFO ] Flow matrix only has 20355 transitions (discarded 1566 similar events)
[2023-03-24 03:01:16] [INFO ] Invariant cache hit.
[2023-03-24 03:01:17] [INFO ] Implicit Places using invariants in 760 ms returned []
Implicit Place search using SMT only with invariants took 770 ms to find 0 implicit places.
[2023-03-24 03:01:17] [INFO ] Flow matrix only has 20355 transitions (discarded 1566 similar events)
[2023-03-24 03:01:17] [INFO ] Invariant cache hit.
[2023-03-24 03:01:18] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2918 ms. Remains : 8688/8688 places, 21921/21921 transitions.
Graph (trivial) has 7145 edges and 8688 vertex of which 33 / 8688 are part of one of the 1 SCC in 4 ms
Free SCC test removed 32 places
Drop transitions removed 1116 transitions
Ensure Unique test removed 1506 transitions
Reduce isomorphic transitions removed 2622 transitions.
Graph (complete) has 66307 edges and 8656 vertex of which 8626 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 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 t17076.t19125 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 7984 transition count 18848
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 7534 transition count 17951
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 7085 transition count 17111
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 6637 transition count 16329
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 6245 transition count 15601
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 5855 transition count 14927
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 5517 transition count 14303
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 5181 transition count 13729
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 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 8 with 815 rules applied. Total rules applied 9190 place count 4893 transition count 13202
Ensure Unique test removed 44 places
Reduce places removed 285 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 9 with 765 rules applied. Total rules applied 9955 place count 4608 transition count 12722
Ensure Unique test removed 2 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 10 with 679 rules applied. Total rules applied 10634 place count 4367 transition count 12284
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 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 635 rules applied. Total rules applied 11269 place count 4128 transition count 11888
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 11827 place count 3929 transition count 11529
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 12346 place count 3732 transition count 11207
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 12796 place count 3570 transition count 10919
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 13210 place count 3410 transition count 10665
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 13562 place count 3282 transition count 10441
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 13882 place count 3156 transition count 10247
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 14148 place count 3058 transition count 10079
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 14386 place count 2962 transition count 9937
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 14578 place count 2890 transition count 9817
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 14746 place count 2820 transition count 9719
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 14876 place count 2770 transition count 9639
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 14986 place count 2722 transition count 9577
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 15066 place count 2690 transition count 9529
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 15130 place count 2660 transition count 9495
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 15172 place count 2642 transition count 9471
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 15202 place count 2626 transition count 9457
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 15218 place count 2618 transition count 9449
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 15227 place count 2612 transition count 9446
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 15231 place count 2609 transition count 9445
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 462 Pre rules applied. Total rules applied 15231 place count 2609 transition count 8983
Deduced a syphon composed of 462 places in 2 ms
Ensure Unique test removed 462 places
Reduce places removed 924 places and 0 transitions.
Iterating global reduction 31 with 1386 rules applied. Total rules applied 16617 place count 1685 transition count 8983
Discarding 480 places :
Symmetric choice reduction at 31 with 480 rule applications. Total rules 17097 place count 1205 transition count 8503
Iterating global reduction 31 with 480 rules applied. Total rules applied 17577 place count 1205 transition count 8503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 17577 place count 1205 transition count 8502
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 17579 place count 1204 transition count 8502
Discarding 990 places :
Symmetric choice reduction at 31 with 990 rule applications. Total rules 18569 place count 214 transition count 1572
Iterating global reduction 31 with 990 rules applied. Total rules applied 19559 place count 214 transition count 1572
Ensure Unique test removed 990 transitions
Reduce isomorphic transitions removed 990 transitions.
Iterating post reduction 31 with 990 rules applied. Total rules applied 20549 place count 214 transition count 582
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 32 with 70 rules applied. Total rules applied 20619 place count 178 transition count 548
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 20620 place count 178 transition count 547
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 33 with 1 rules applied. Total rules applied 20621 place count 178 transition count 546
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 33 with 8 rules applied. Total rules applied 20629 place count 178 transition count 538
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 33 with 8 rules applied. Total rules applied 20637 place count 170 transition count 538
Discarding 15 places :
Symmetric choice reduction at 34 with 15 rule applications. Total rules 20652 place count 155 transition count 433
Ensure Unique test removed 15 places
Iterating global reduction 34 with 30 rules applied. Total rules applied 20682 place count 140 transition count 433
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 34 with 15 rules applied. Total rules applied 20697 place count 140 transition count 418
Discarding 15 places :
Symmetric choice reduction at 35 with 15 rule applications. Total rules 20712 place count 125 transition count 313
Iterating global reduction 35 with 15 rules applied. Total rules applied 20727 place count 125 transition count 313
Discarding 15 places :
Symmetric choice reduction at 35 with 15 rule applications. Total rules 20742 place count 110 transition count 298
Iterating global reduction 35 with 15 rules applied. Total rules applied 20757 place count 110 transition count 298
Partial Free-agglomeration rule applied 231 times.
Drop transitions removed 231 transitions
Iterating global reduction 35 with 231 rules applied. Total rules applied 20988 place count 110 transition count 298
Discarding 15 places :
Symmetric choice reduction at 35 with 15 rule applications. Total rules 21003 place count 95 transition count 193
Ensure Unique test removed 14 places
Iterating global reduction 35 with 29 rules applied. Total rules applied 21032 place count 81 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 35 with 15 rules applied. Total rules applied 21047 place count 81 transition count 178
Discarding 14 places :
Symmetric choice reduction at 36 with 14 rule applications. Total rules 21061 place count 67 transition count 80
Iterating global reduction 36 with 14 rules applied. Total rules applied 21075 place count 67 transition count 80
Discarding 13 places :
Symmetric choice reduction at 36 with 13 rule applications. Total rules 21088 place count 54 transition count 67
Iterating global reduction 36 with 13 rules applied. Total rules applied 21101 place count 54 transition count 67
Applied a total of 21101 rules in 30115 ms. Remains 54 /8688 variables (removed 8634) and now considering 67/21921 (removed 21854) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 67 rows 54 cols
[2023-03-24 03:01:48] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-24 03:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-24 03:01:48] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-24 03:01:48] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-24 03:01:48] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-24 03:01:48] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:01:48] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 03:01:48] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2)]
Knowledge based reduction with 10 factoid took 713 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 260 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 264 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Product exploration explored 100000 steps with 1393 reset in 2956 ms.
Product exploration explored 100000 steps with 1392 reset in 3019 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 244 ms :[(AND p0 p2 p1), (AND p0 p2 p1), (AND p0 p1), p1, p1, (AND p1 p2)]
Support contains 8 out of 25084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Performed 7392 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7392 rules applied. Total rules applied 7392 place count 25084 transition count 38317
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7887 places in 49 ms
Iterating global reduction 1 with 495 rules applied. Total rules applied 7887 place count 25084 transition count 38317
Deduced a syphon composed of 7887 places in 33 ms
Applied a total of 7887 rules in 9122 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:02:05] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 03:02:10] [INFO ] Computed 1633 place invariants in 4526 ms
[2023-03-24 03:02:12] [INFO ] Dead Transitions using invariants and state equation in 6721 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25084/25084 places, 38317/38317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15846 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Built C files in :
/tmp/ltsmin7679430850704484226
[2023-03-24 03:02:13] [INFO ] Built C files in 407ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7679430850704484226
Running compilation step : cd /tmp/ltsmin7679430850704484226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7679430850704484226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7679430850704484226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 8 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 2032 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:02:18] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 03:02:22] [INFO ] Computed 1633 place invariants in 4217 ms
[2023-03-24 03:02:24] [INFO ] Implicit Places using invariants in 6427 ms returned []
Implicit Place search using SMT only with invariants took 6428 ms to find 0 implicit places.
[2023-03-24 03:02:24] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:02:24] [INFO ] Invariant cache hit.
[2023-03-24 03:02:26] [INFO ] Dead Transitions using invariants and state equation in 2203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10664 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Built C files in :
/tmp/ltsmin1119270593735698899
[2023-03-24 03:02:27] [INFO ] Built C files in 317ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1119270593735698899
Running compilation step : cd /tmp/ltsmin1119270593735698899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1119270593735698899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1119270593735698899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-24 03:02:32] [INFO ] Flatten gal took : 1117 ms
[2023-03-24 03:02:33] [INFO ] Flatten gal took : 1020 ms
[2023-03-24 03:02:33] [INFO ] Time to serialize gal into /tmp/LTL17191390364686143619.gal : 218 ms
[2023-03-24 03:02:33] [INFO ] Time to serialize properties into /tmp/LTL13356319047699639940.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17191390364686143619.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2367265773092480144.hoa' '-atoms' '/tmp/LTL13356319047699639940.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13356319047699639940.prop.
Loaded 3 atomic propositions.
Detected timeout of ITS tools.
[2023-03-24 03:02:50] [INFO ] Flatten gal took : 980 ms
[2023-03-24 03:02:51] [INFO ] Flatten gal took : 1038 ms
[2023-03-24 03:02:51] [INFO ] Time to serialize gal into /tmp/LTL2012488391451754170.gal : 160 ms
[2023-03-24 03:02:51] [INFO ] Time to serialize properties into /tmp/LTL17208498189382423005.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2012488391451754170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17208498189382423005.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((!("((Node27NotifyThatHeIsActive>=1)&&(Node32ThinksNode27ShouldBeNodeMasterToReplaceNode25>=1))"))U((G(!("((Node27NotifyThatHeIsA...591
Formula 0 simplified : X((FG"((Node24ManageTheCrashOfNode16>=1)&&(Rx5IsAtTheRightExtremityOfTheLeafSet>=1))" & F"(((ThereIsAMasterInTheLeafSet>=1)&&(Node16...363
Detected timeout of ITS tools.
[2023-03-24 03:03:08] [INFO ] Flatten gal took : 965 ms
[2023-03-24 03:03:08] [INFO ] Applying decomposition
[2023-03-24 03:03:09] [INFO ] Flatten gal took : 970 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph636962861816905784.txt' '-o' '/tmp/graph636962861816905784.bin' '-w' '/tmp/graph636962861816905784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph636962861816905784.bin' '-l' '-1' '-v' '-w' '/tmp/graph636962861816905784.weights' '-q' '0' '-e' '0.001'
[2023-03-24 03:03:11] [INFO ] Decomposing Gal with order
[2023-03-24 03:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 03:03:30] [INFO ] Removed a total of 26485 redundant transitions.
[2023-03-24 03:03:31] [INFO ] Flatten gal took : 6457 ms
[2023-03-24 03:03:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 7758 labels/synchronizations in 1897 ms.
[2023-03-24 03:03:35] [INFO ] Time to serialize gal into /tmp/LTL8634196858518911948.gal : 318 ms
[2023-03-24 03:03:35] [INFO ] Time to serialize properties into /tmp/LTL3778931219637722489.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8634196858518911948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3778931219637722489.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17883062190940071497
[2023-03-24 03:03:51] [INFO ] Built C files in 473ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17883062190940071497
Running compilation step : cd /tmp/ltsmin17883062190940071497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17883062190940071497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17883062190940071497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-S32C07-LTLFireability-01 finished in 416614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F((X(p1)&&G(p2)))))'
Support contains 4 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 2187 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:03:56] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:03:56] [INFO ] Invariant cache hit.
[2023-03-24 03:03:58] [INFO ] Implicit Places using invariants in 1906 ms returned []
Implicit Place search using SMT only with invariants took 1914 ms to find 0 implicit places.
[2023-03-24 03:03:58] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:03:58] [INFO ] Invariant cache hit.
[2023-03-24 03:04:00] [INFO ] Dead Transitions using invariants and state equation in 2070 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6184 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s5488 1), p0:(GEQ s17401 1), p1:(OR (LT s10248 1) (LT s16577 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 144 steps with 1 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-02 finished in 6459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X(p0)))||G(p1))))'
Support contains 4 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 2090 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:04:02] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:04:02] [INFO ] Invariant cache hit.
[2023-03-24 03:04:04] [INFO ] Implicit Places using invariants in 2163 ms returned []
Implicit Place search using SMT only with invariants took 2184 ms to find 0 implicit places.
[2023-03-24 03:04:04] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:04:04] [INFO ] Invariant cache hit.
[2023-03-24 03:04:06] [INFO ] Dead Transitions using invariants and state equation in 1980 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6263 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s15563 1) (GEQ s17912 1)), p1:(AND (GEQ s419 1) (GEQ s19043 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-05 finished in 6438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 25084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7391 transitions
Trivial Post-agglo rules discarded 7391 transitions
Performed 7391 trivial Post agglomeration. Transition count delta: 7391
Iterating post reduction 0 with 7391 rules applied. Total rules applied 7391 place count 25084 transition count 30926
Reduce places removed 7391 places and 0 transitions.
Iterating post reduction 1 with 7391 rules applied. Total rules applied 14782 place count 17693 transition count 30926
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 462 Pre rules applied. Total rules applied 14782 place count 17693 transition count 30464
Deduced a syphon composed of 462 places in 24 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 2 with 924 rules applied. Total rules applied 15706 place count 17231 transition count 30464
Discarding 6929 places :
Symmetric choice reduction at 2 with 6929 rule applications. Total rules 22635 place count 10302 transition count 23535
Iterating global reduction 2 with 6929 rules applied. Total rules applied 29564 place count 10302 transition count 23535
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29564 place count 10302 transition count 23522
Deduced a syphon composed of 13 places in 16 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 29590 place count 10289 transition count 23522
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 30579 place count 9300 transition count 16599
Iterating global reduction 2 with 989 rules applied. Total rules applied 31568 place count 9300 transition count 16599
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 14 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 31632 place count 9268 transition count 16567
Applied a total of 31632 rules in 9971 ms. Remains 9268 /25084 variables (removed 15816) and now considering 16567/38317 (removed 21750) transitions.
[2023-03-24 03:04:16] [INFO ] Flow matrix only has 15511 transitions (discarded 1056 similar events)
// Phase 1: matrix 15511 rows 9268 cols
[2023-03-24 03:04:17] [INFO ] Computed 1633 place invariants in 894 ms
[2023-03-24 03:04:18] [INFO ] Implicit Places using invariants in 1711 ms returned []
Implicit Place search using SMT only with invariants took 1718 ms to find 0 implicit places.
[2023-03-24 03:04:18] [INFO ] Flow matrix only has 15511 transitions (discarded 1056 similar events)
[2023-03-24 03:04:18] [INFO ] Invariant cache hit.
[2023-03-24 03:04:19] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9268/25084 places, 16567/38317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12524 ms. Remains : 9268/25084 places, 16567/38317 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5830 1) (LT s5833 1) (LT s6116 1)), p1:(LT s4382 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1962 reset in 2226 ms.
Product exploration explored 100000 steps with 1961 reset in 2394 ms.
Computed a total of 3284 stabilizing places and 4630 stable transitions
Computed a total of 3284 stabilizing places and 4630 stable transitions
Detected a total of 3284/9268 stabilizing places and 4630/16567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 13177 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13177 steps, saw 6425 distinct states, run finished after 3003 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 03:04:28] [INFO ] Flow matrix only has 15511 transitions (discarded 1056 similar events)
[2023-03-24 03:04:28] [INFO ] Invariant cache hit.
[2023-03-24 03:04:29] [INFO ] [Real]Absence check using 65 positive place invariants in 135 ms returned sat
[2023-03-24 03:04:30] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 645 ms returned sat
[2023-03-24 03:04:30] [INFO ] After 1926ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-24 03:04:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 155 ms returned sat
[2023-03-24 03:04:32] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 932 ms returned sat
[2023-03-24 03:04:46] [INFO ] After 14598ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-24 03:04:46] [INFO ] State equation strengthened by 6388 read => feed constraints.
[2023-03-24 03:04:52] [INFO ] After 6074ms SMT Verify possible using 6388 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-24 03:05:11] [INFO ] Deduced a trap composed of 572 places in 16324 ms of which 19 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 03:05:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:05:11] [INFO ] After 41439ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 9268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9268/9268 places, 16567/16567 transitions.
Free-agglomeration rule (complex) applied 565 times.
Iterating global reduction 0 with 565 rules applied. Total rules applied 565 place count 9268 transition count 21936
Reduce places removed 565 places and 0 transitions.
Iterating post reduction 0 with 565 rules applied. Total rules applied 1130 place count 8703 transition count 21936
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 1163 place count 8703 transition count 21936
Applied a total of 1163 rules in 5529 ms. Remains 8703 /9268 variables (removed 565) and now considering 21936/16567 (removed -5369) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5530 ms. Remains : 8703/9268 places, 21936/16567 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13112 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13112 steps, saw 6278 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 03:05:20] [INFO ] Flow matrix only has 20382 transitions (discarded 1554 similar events)
// Phase 1: matrix 20382 rows 8703 cols
[2023-03-24 03:05:21] [INFO ] Computed 1633 place invariants in 1032 ms
[2023-03-24 03:05:22] [INFO ] [Real]Absence check using 65 positive place invariants in 140 ms returned sat
[2023-03-24 03:05:23] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 672 ms returned sat
[2023-03-24 03:05:42] [INFO ] After 18463ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 03:05:42] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2023-03-24 03:05:44] [INFO ] After 2198ms SMT Verify possible using 12322 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:05:44] [INFO ] After 22702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:05:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 121 ms returned sat
[2023-03-24 03:05:46] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 582 ms returned sat
[2023-03-24 03:06:02] [INFO ] After 15889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:06:05] [INFO ] After 3099ms SMT Verify possible using 12322 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 03:06:06] [INFO ] After 4153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 652 ms.
[2023-03-24 03:06:06] [INFO ] After 22458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8703/8703 places, 21936/21936 transitions.
Applied a total of 0 rules in 1385 ms. Remains 8703 /8703 variables (removed 0) and now considering 21936/21936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1385 ms. Remains : 8703/8703 places, 21936/21936 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8703/8703 places, 21936/21936 transitions.
Applied a total of 0 rules in 1331 ms. Remains 8703 /8703 variables (removed 0) and now considering 21936/21936 (removed 0) transitions.
[2023-03-24 03:06:09] [INFO ] Flow matrix only has 20382 transitions (discarded 1554 similar events)
[2023-03-24 03:06:09] [INFO ] Invariant cache hit.
[2023-03-24 03:06:10] [INFO ] Implicit Places using invariants in 789 ms returned []
Implicit Place search using SMT only with invariants took 802 ms to find 0 implicit places.
[2023-03-24 03:06:10] [INFO ] Flow matrix only has 20382 transitions (discarded 1554 similar events)
[2023-03-24 03:06:10] [INFO ] Invariant cache hit.
[2023-03-24 03:06:11] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2892 ms. Remains : 8703/8703 places, 21936/21936 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-06 finished in 124345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 25084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7391 transitions
Trivial Post-agglo rules discarded 7391 transitions
Performed 7391 trivial Post agglomeration. Transition count delta: 7391
Iterating post reduction 0 with 7391 rules applied. Total rules applied 7391 place count 25084 transition count 30926
Reduce places removed 7391 places and 0 transitions.
Iterating post reduction 1 with 7391 rules applied. Total rules applied 14782 place count 17693 transition count 30926
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 462 Pre rules applied. Total rules applied 14782 place count 17693 transition count 30464
Deduced a syphon composed of 462 places in 25 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 2 with 924 rules applied. Total rules applied 15706 place count 17231 transition count 30464
Discarding 6929 places :
Symmetric choice reduction at 2 with 6929 rule applications. Total rules 22635 place count 10302 transition count 23535
Iterating global reduction 2 with 6929 rules applied. Total rules applied 29564 place count 10302 transition count 23535
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29564 place count 10302 transition count 23522
Deduced a syphon composed of 13 places in 16 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 29590 place count 10289 transition count 23522
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 30579 place count 9300 transition count 16599
Iterating global reduction 2 with 989 rules applied. Total rules applied 31568 place count 9300 transition count 16599
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 27 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 31634 place count 9267 transition count 16566
Applied a total of 31634 rules in 9710 ms. Remains 9267 /25084 variables (removed 15817) and now considering 16566/38317 (removed 21751) transitions.
[2023-03-24 03:06:21] [INFO ] Flow matrix only has 15510 transitions (discarded 1056 similar events)
// Phase 1: matrix 15510 rows 9267 cols
[2023-03-24 03:06:21] [INFO ] Computed 1633 place invariants in 763 ms
[2023-03-24 03:06:22] [INFO ] Implicit Places using invariants in 1657 ms returned []
Implicit Place search using SMT only with invariants took 1663 ms to find 0 implicit places.
[2023-03-24 03:06:22] [INFO ] Flow matrix only has 15510 transitions (discarded 1056 similar events)
[2023-03-24 03:06:22] [INFO ] Invariant cache hit.
[2023-03-24 03:06:23] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9267/25084 places, 16566/38317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12296 ms. Remains : 9267/25084 places, 16566/38317 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2933 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 53 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-08 finished in 12405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 1879 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:06:25] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 03:06:29] [INFO ] Computed 1633 place invariants in 4305 ms
[2023-03-24 03:06:32] [INFO ] Implicit Places using invariants in 6496 ms returned []
Implicit Place search using SMT only with invariants took 6501 ms to find 0 implicit places.
[2023-03-24 03:06:32] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:06:32] [INFO ] Invariant cache hit.
[2023-03-24 03:06:34] [INFO ] Dead Transitions using invariants and state equation in 2171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10560 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s9148 1) (LT s24719 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]]
Product exploration explored 100000 steps with 1393 reset in 2601 ms.
Entered a terminal (fully accepting) state of product in 34347 steps with 478 reset in 1041 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-09 finished in 14441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||G(p1)) U p2))'
Support contains 9 out of 25084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Drop transitions removed 7392 transitions
Trivial Post-agglo rules discarded 7392 transitions
Performed 7392 trivial Post agglomeration. Transition count delta: 7392
Iterating post reduction 0 with 7392 rules applied. Total rules applied 7392 place count 25084 transition count 30925
Reduce places removed 7392 places and 0 transitions.
Iterating post reduction 1 with 7392 rules applied. Total rules applied 14784 place count 17692 transition count 30925
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 462 Pre rules applied. Total rules applied 14784 place count 17692 transition count 30463
Deduced a syphon composed of 462 places in 26 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 2 with 924 rules applied. Total rules applied 15708 place count 17230 transition count 30463
Discarding 6930 places :
Symmetric choice reduction at 2 with 6930 rule applications. Total rules 22638 place count 10300 transition count 23533
Iterating global reduction 2 with 6930 rules applied. Total rules applied 29568 place count 10300 transition count 23533
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29568 place count 10300 transition count 23519
Deduced a syphon composed of 14 places in 16 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 29596 place count 10286 transition count 23519
Discarding 990 places :
Symmetric choice reduction at 2 with 990 rule applications. Total rules 30586 place count 9296 transition count 16589
Iterating global reduction 2 with 990 rules applied. Total rules applied 31576 place count 9296 transition count 16589
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 15 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 31640 place count 9264 transition count 16557
Applied a total of 31640 rules in 10057 ms. Remains 9264 /25084 variables (removed 15820) and now considering 16557/38317 (removed 21760) transitions.
[2023-03-24 03:06:48] [INFO ] Flow matrix only has 15501 transitions (discarded 1056 similar events)
// Phase 1: matrix 15501 rows 9264 cols
[2023-03-24 03:06:49] [INFO ] Computed 1633 place invariants in 787 ms
[2023-03-24 03:06:49] [INFO ] Implicit Places using invariants in 1565 ms returned []
Implicit Place search using SMT only with invariants took 1574 ms to find 0 implicit places.
[2023-03-24 03:06:49] [INFO ] Flow matrix only has 15501 transitions (discarded 1056 similar events)
[2023-03-24 03:06:49] [INFO ] Invariant cache hit.
[2023-03-24 03:06:50] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9264/25084 places, 16557/38317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12442 ms. Remains : 9264/25084 places, 16557/38317 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s228 1) (GEQ s5829 1)), p0:(OR (AND (GEQ s5185 1) (GEQ s6610 1)) (AND (GEQ s3892 1) (GEQ s5582 1))), p1:(AND (GEQ s6794 1) (GEQ s6797 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-12 finished in 12591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 1968 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:06:52] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25084 cols
[2023-03-24 03:06:56] [INFO ] Computed 1633 place invariants in 4159 ms
[2023-03-24 03:06:59] [INFO ] Implicit Places using invariants in 6296 ms returned []
Implicit Place search using SMT only with invariants took 6299 ms to find 0 implicit places.
[2023-03-24 03:06:59] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:06:59] [INFO ] Invariant cache hit.
[2023-03-24 03:07:01] [INFO ] Dead Transitions using invariants and state equation in 2251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10524 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s6075 1) (GEQ s7028 1)), p0:(AND (GEQ s1964 1) (GEQ s2064 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-13 finished in 10778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 2017 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:07:03] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:07:03] [INFO ] Invariant cache hit.
[2023-03-24 03:07:05] [INFO ] Implicit Places using invariants in 2201 ms returned []
Implicit Place search using SMT only with invariants took 2207 ms to find 0 implicit places.
[2023-03-24 03:07:05] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:07:05] [INFO ] Invariant cache hit.
[2023-03-24 03:07:07] [INFO ] Dead Transitions using invariants and state equation in 2184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6417 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-14 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:(LT s13328 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 17868 steps with 249 reset in 700 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-14 finished in 7339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 25084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25084/25084 places, 38317/38317 transitions.
Applied a total of 0 rules in 2042 ms. Remains 25084 /25084 variables (removed 0) and now considering 38317/38317 (removed 0) transitions.
[2023-03-24 03:07:10] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:07:10] [INFO ] Invariant cache hit.
[2023-03-24 03:07:13] [INFO ] Implicit Places using invariants in 2167 ms returned []
Implicit Place search using SMT only with invariants took 2168 ms to find 0 implicit places.
[2023-03-24 03:07:13] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
[2023-03-24 03:07:13] [INFO ] Invariant cache hit.
[2023-03-24 03:07:15] [INFO ] Dead Transitions using invariants and state equation in 1981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6208 ms. Remains : 25084/25084 places, 38317/38317 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s10248 1) (LT s15944 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 49260 steps with 24630 reset in 10002 ms.
Product exploration timeout after 53330 steps with 26665 reset in 10001 ms.
Computed a total of 19068 stabilizing places and 26348 stable transitions
Computed a total of 19068 stabilizing places and 26348 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C07-LTLFireability-15 finished in 26597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(G(F(!p1))||G(!p2)))))))'
[2023-03-24 03:07:36] [INFO ] Flatten gal took : 882 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6014895671703967303
[2023-03-24 03:07:36] [INFO ] Too many transitions (38317) to apply POR reductions. Disabling POR matrices.
[2023-03-24 03:07:37] [INFO ] Built C files in 344ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6014895671703967303
Running compilation step : cd /tmp/ltsmin6014895671703967303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-24 03:07:37] [INFO ] Applying decomposition
[2023-03-24 03:07:38] [INFO ] Flatten gal took : 1117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1837972813613834169.txt' '-o' '/tmp/graph1837972813613834169.bin' '-w' '/tmp/graph1837972813613834169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1837972813613834169.bin' '-l' '-1' '-v' '-w' '/tmp/graph1837972813613834169.weights' '-q' '0' '-e' '0.001'
[2023-03-24 03:07:41] [INFO ] Decomposing Gal with order
[2023-03-24 03:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 03:07:57] [INFO ] Removed a total of 26488 redundant transitions.
[2023-03-24 03:07:57] [INFO ] Flatten gal took : 5655 ms
[2023-03-24 03:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 5693 labels/synchronizations in 1265 ms.
[2023-03-24 03:08:00] [INFO ] Time to serialize gal into /tmp/LTLFireability3941619279715392963.gal : 212 ms
[2023-03-24 03:08:00] [INFO ] Time to serialize properties into /tmp/LTLFireability4452221092714103067.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3941619279715392963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4452221092714103067.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((!("((i1.u499.Node27NotifyThatHeIsActive>=1)&&(i1.u686.Node32ThinksNode27ShouldBeNodeMasterToReplaceNode25>=1))"))U((G(!("((i1.u4...686
Formula 0 simplified : X((FG"((i2.i0.u447.Node24ManageTheCrashOfNode16>=1)&&(i16.u705.Rx5IsAtTheRightExtremityOfTheLeafSet>=1))" & F"(((i0.u0.ThereIsAMaste...426
ITS-tools command line returned an error code 137
[2023-03-24 03:16:39] [INFO ] Flatten gal took : 1665 ms
[2023-03-24 03:16:39] [INFO ] Time to serialize gal into /tmp/LTLFireability10034717548449176954.gal : 169 ms
[2023-03-24 03:16:39] [INFO ] Time to serialize properties into /tmp/LTLFireability7279342099980213640.ltl : 6 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10034717548449176954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7279342099980213640.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X((!("((Node27NotifyThatHeIsActive>=1)&&(Node32ThinksNode27ShouldBeNodeMasterToReplaceNode25>=1))"))U((G(!("((Node27NotifyThatHeIsA...591
Formula 0 simplified : X((FG"((Node24ManageTheCrashOfNode16>=1)&&(Rx5IsAtTheRightExtremityOfTheLeafSet>=1))" & F"(((ThereIsAMasterInTheLeafSet>=1)&&(Node16...363
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/ltsmin6014895671703967303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6014895671703967303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 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)
Detected timeout of ITS tools.
[2023-03-24 03:41:33] [INFO ] Flatten gal took : 1102 ms
[2023-03-24 03:41:35] [INFO ] Input system was already deterministic with 38317 transitions.
[2023-03-24 03:41:35] [INFO ] Transformed 25084 places.
[2023-03-24 03:41:35] [INFO ] Transformed 38317 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
[2023-03-24 03:42:18] [INFO ] Time to serialize gal into /tmp/LTLFireability17897533508263217501.gal : 146 ms
[2023-03-24 03:42:18] [INFO ] Time to serialize properties into /tmp/LTLFireability17809616053163779202.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17897533508263217501.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17809616053163779202.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((!("((Node27NotifyThatHeIsActive>=1)&&(Node32ThinksNode27ShouldBeNodeMasterToReplaceNode25>=1))"))U((G(!("((Node27NotifyThatHeIsA...591
Formula 0 simplified : X((FG"((Node24ManageTheCrashOfNode16>=1)&&(Rx5IsAtTheRightExtremityOfTheLeafSet>=1))" & F"(((ThereIsAMasterInTheLeafSet>=1)&&(Node16...363
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9669008 kB
After kill :
MemTotal: 16393232 kB
MemFree: 10091792 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-S32C07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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