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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 12K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 02:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679590910693

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-S24C08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 17:01:52] [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-23 17:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:01:52] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2023-03-23 17:01:52] [INFO ] Transformed 15180 places.
[2023-03-23 17:01:52] [INFO ] Transformed 22267 transitions.
[2023-03-23 17:01:52] [INFO ] Parsed PT model containing 15180 places and 22267 transitions and 84086 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 15180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 15136 transition count 22267
Applied a total of 44 rules in 706 ms. Remains 15136 /15180 variables (removed 44) and now considering 22267/22267 (removed 0) transitions.
[2023-03-23 17:01:54] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-23 17:01:55] [INFO ] Computed 1093 place invariants in 1711 ms
[2023-03-23 17:01:57] [INFO ] Implicit Places using invariants in 3339 ms returned []
Implicit Place search using SMT only with invariants took 3364 ms to find 0 implicit places.
[2023-03-23 17:01:57] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:01:57] [INFO ] Invariant cache hit.
[2023-03-23 17:01:58] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15136/15180 places, 22267/22267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5573 ms. Remains : 15136/15180 places, 22267/22267 transitions.
Support contains 43 out of 15136 places after structural reductions.
[2023-03-23 17:02:00] [INFO ] Flatten gal took : 941 ms
[2023-03-23 17:02:01] [INFO ] Flatten gal took : 605 ms
[2023-03-23 17:02:02] [INFO ] Input system was already deterministic with 22267 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 830 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 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) 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 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 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
Interrupted probabilistic random walk after 10839 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{17=1, 19=1}
Probabilistic random walk after 10839 steps, saw 5406 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :2
Running SMT prover for 19 properties.
[2023-03-23 17:02:07] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:02:07] [INFO ] Invariant cache hit.
[2023-03-23 17:02:12] [INFO ] [Real]Absence check using 47 positive place invariants in 214 ms returned sat
[2023-03-23 17:02:12] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 597 ms returned sat
[2023-03-23 17:02:32] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2023-03-23 17:02:36] [INFO ] [Nat]Absence check using 47 positive place invariants in 195 ms returned sat
[2023-03-23 17:02:37] [INFO ] [Nat]Absence check using 47 positive and 1046 generalized place invariants in 562 ms returned sat
[2023-03-23 17:02:57] [INFO ] After 16738ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-23 17:02:57] [INFO ] State equation strengthened by 6802 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 17:02:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:02:57] [INFO ] After 25144ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:16
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 15136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4759 transitions
Trivial Post-agglo rules discarded 4759 transitions
Performed 4759 trivial Post agglomeration. Transition count delta: 4759
Iterating post reduction 0 with 4759 rules applied. Total rules applied 4759 place count 15136 transition count 17508
Reduce places removed 4759 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 4795 rules applied. Total rules applied 9554 place count 10377 transition count 17472
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 9590 place count 10341 transition count 17472
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 397 Pre rules applied. Total rules applied 9590 place count 10341 transition count 17075
Deduced a syphon composed of 397 places in 26 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 10384 place count 9944 transition count 17075
Discarding 4392 places :
Symmetric choice reduction at 3 with 4392 rule applications. Total rules 14776 place count 5552 transition count 12683
Iterating global reduction 3 with 4392 rules applied. Total rules applied 19168 place count 5552 transition count 12683
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 19168 place count 5552 transition count 12675
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 19184 place count 5544 transition count 12675
Discarding 538 places :
Symmetric choice reduction at 3 with 538 rule applications. Total rules 19722 place count 5006 transition count 8371
Iterating global reduction 3 with 538 rules applied. Total rules applied 20260 place count 5006 transition count 8371
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20310 place count 4981 transition count 8346
Free-agglomeration rule (complex) applied 344 times.
Iterating global reduction 3 with 344 rules applied. Total rules applied 20654 place count 4981 transition count 11768
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 3 with 344 rules applied. Total rules applied 20998 place count 4637 transition count 11768
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 4 with 197 rules applied. Total rules applied 21195 place count 4637 transition count 11768
Applied a total of 21195 rules in 5731 ms. Remains 4637 /15136 variables (removed 10499) and now considering 11768/22267 (removed 10499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5736 ms. Remains : 4637/15136 places, 11768/22267 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-23 17:03:03] [INFO ] Flow matrix only has 10882 transitions (discarded 886 similar events)
// Phase 1: matrix 10882 rows 4637 cols
[2023-03-23 17:03:04] [INFO ] Computed 1093 place invariants in 262 ms
[2023-03-23 17:03:05] [INFO ] [Real]Absence check using 49 positive place invariants in 86 ms returned sat
[2023-03-23 17:03:05] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 280 ms returned sat
[2023-03-23 17:03:18] [INFO ] After 11413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2023-03-23 17:03:18] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2023-03-23 17:03:19] [INFO ] After 715ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-23 17:03:19] [INFO ] After 14978ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-23 17:03:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2023-03-23 17:03:20] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 266 ms returned sat
[2023-03-23 17:03:33] [INFO ] After 11506ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-23 17:03:44] [INFO ] After 11008ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-03-23 17:03:44] [INFO ] After 11009ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 17:03:44] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 127 ms.
Support contains 24 out of 4637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4637/4637 places, 11768/11768 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 4637 transition count 11767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4636 transition count 11767
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4636 transition count 11765
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 4634 transition count 11765
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 4633 transition count 11764
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 4633 transition count 11764
Applied a total of 8 rules in 1908 ms. Remains 4633 /4637 variables (removed 4) and now considering 11764/11768 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1908 ms. Remains : 4633/4637 places, 11764/11768 transitions.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12512 stabilizing places and 17066 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4800 transitions
Trivial Post-agglo rules discarded 4800 transitions
Performed 4800 trivial Post agglomeration. Transition count delta: 4800
Iterating post reduction 0 with 4800 rules applied. Total rules applied 4800 place count 15136 transition count 17467
Reduce places removed 4800 places and 0 transitions.
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17067
Deduced a syphon composed of 400 places in 12 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10400 place count 9936 transition count 17067
Discarding 4400 places :
Symmetric choice reduction at 2 with 4400 rule applications. Total rules 14800 place count 5536 transition count 12667
Iterating global reduction 2 with 4400 rules applied. Total rules applied 19200 place count 5536 transition count 12667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19200 place count 5536 transition count 12651
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 19232 place count 5520 transition count 12651
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19781 place count 4971 transition count 8259
Iterating global reduction 2 with 549 rules applied. Total rules applied 20330 place count 4971 transition count 8259
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20380 place count 4946 transition count 8234
Applied a total of 20380 rules in 3643 ms. Remains 4946 /15136 variables (removed 10190) and now considering 8234/22267 (removed 14033) transitions.
[2023-03-23 17:03:50] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
// Phase 1: matrix 7634 rows 4946 cols
[2023-03-23 17:03:50] [INFO ] Computed 1093 place invariants in 227 ms
[2023-03-23 17:03:54] [INFO ] Implicit Places using invariants in 4283 ms returned []
[2023-03-23 17:03:54] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-23 17:03:54] [INFO ] Invariant cache hit.
[2023-03-23 17:03:58] [INFO ] Implicit Places using invariants and state equation in 4054 ms returned []
Implicit Place search using SMT with State Equation took 8345 ms to find 0 implicit places.
[2023-03-23 17:03:59] [INFO ] Redundant transitions in 1060 ms returned []
[2023-03-23 17:03:59] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-23 17:03:59] [INFO ] Invariant cache hit.
[2023-03-23 17:04:04] [INFO ] Dead Transitions using invariants and state equation in 5171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4946/15136 places, 8234/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18236 ms. Remains : 4946/15136 places, 8234/22267 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s116 1) (GEQ s4675 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 finished in 18534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G((p1||X(p1)))&&F(p2)))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 564 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-23 17:04:05] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-23 17:04:07] [INFO ] Computed 1093 place invariants in 1496 ms
[2023-03-23 17:04:08] [INFO ] Implicit Places using invariants in 2888 ms returned []
Implicit Place search using SMT only with invariants took 2894 ms to find 0 implicit places.
[2023-03-23 17:04:08] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:04:08] [INFO ] Invariant cache hit.
[2023-03-23 17:04:09] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4647 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (NOT p2), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1479 1) (GEQ s13817 1)), p1:(GEQ s1836 1), p2:(AND (GEQ s886 1) (GEQ s11290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 finished in 5120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 582 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-23 17:04:10] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:04:10] [INFO ] Invariant cache hit.
[2023-03-23 17:04:12] [INFO ] Implicit Places using invariants in 1377 ms returned []
Implicit Place search using SMT only with invariants took 1378 ms to find 0 implicit places.
[2023-03-23 17:04:12] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:04:12] [INFO ] Invariant cache hit.
[2023-03-23 17:04:13] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3326 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s13152 1) (GEQ s13198 1) (OR (LT s6080 1) (LT s14769 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 finished in 3591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p0))))))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 535 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-23 17:04:14] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:04:14] [INFO ] Invariant cache hit.
[2023-03-23 17:04:15] [INFO ] Implicit Places using invariants in 1229 ms returned []
Implicit Place search using SMT only with invariants took 1237 ms to find 0 implicit places.
[2023-03-23 17:04:15] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:04:15] [INFO ] Invariant cache hit.
[2023-03-23 17:04:16] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2971 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s10628 1), p0:(AND (GEQ s9539 1) (GEQ s9606 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 finished in 3168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(G(p2))))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4787 transitions
Trivial Post-agglo rules discarded 4787 transitions
Performed 4787 trivial Post agglomeration. Transition count delta: 4787
Iterating post reduction 0 with 4787 rules applied. Total rules applied 4787 place count 15136 transition count 17480
Reduce places removed 4787 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9586 place count 10349 transition count 17468
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 13 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 19767 place count 4979 transition count 8281
Iterating global reduction 3 with 547 rules applied. Total rules applied 20314 place count 4979 transition count 8281
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20364 place count 4954 transition count 8256
Applied a total of 20364 rules in 3292 ms. Remains 4954 /15136 variables (removed 10182) and now considering 8256/22267 (removed 14011) transitions.
[2023-03-23 17:04:20] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2023-03-23 17:04:20] [INFO ] Computed 1093 place invariants in 191 ms
[2023-03-23 17:04:24] [INFO ] Implicit Places using invariants in 4063 ms returned []
[2023-03-23 17:04:24] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-23 17:04:24] [INFO ] Invariant cache hit.
[2023-03-23 17:04:29] [INFO ] Implicit Places using invariants and state equation in 5137 ms returned []
Implicit Place search using SMT with State Equation took 9209 ms to find 0 implicit places.
[2023-03-23 17:04:30] [INFO ] Redundant transitions in 705 ms returned []
[2023-03-23 17:04:30] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-23 17:04:30] [INFO ] Invariant cache hit.
[2023-03-23 17:04:35] [INFO ] Dead Transitions using invariants and state equation in 5423 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4954/15136 places, 8256/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18647 ms. Remains : 4954/15136 places, 8256/22267 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2371 1), p1:(AND (GEQ s1780 1) (GEQ s4843 1)), p2:(AND (GEQ s1145 1) (GEQ s1152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1673 reset in 1243 ms.
Product exploration explored 100000 steps with 1673 reset in 1194 ms.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 473 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 167 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-23 17:04:39] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-23 17:04:39] [INFO ] Invariant cache hit.
[2023-03-23 17:04:39] [INFO ] [Real]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-23 17:04:40] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 302 ms returned sat
[2023-03-23 17:04:40] [INFO ] After 832ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 507 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 4954 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Applied a total of 0 rules in 678 ms. Remains 4954 /4954 variables (removed 0) and now considering 8256/8256 (removed 0) transitions.
[2023-03-23 17:04:41] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-23 17:04:41] [INFO ] Invariant cache hit.
[2023-03-23 17:04:46] [INFO ] Implicit Places using invariants in 5301 ms returned []
[2023-03-23 17:04:46] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-23 17:04:46] [INFO ] Invariant cache hit.
[2023-03-23 17:04:51] [INFO ] Implicit Places using invariants and state equation in 5271 ms returned []
Implicit Place search using SMT with State Equation took 10575 ms to find 0 implicit places.
[2023-03-23 17:04:52] [INFO ] Redundant transitions in 964 ms returned []
[2023-03-23 17:04:52] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
[2023-03-23 17:04:52] [INFO ] Invariant cache hit.
[2023-03-23 17:04:58] [INFO ] Dead Transitions using invariants and state equation in 5094 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17334 ms. Remains : 4954/4954 places, 8256/8256 transitions.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 392 steps, including 6 resets, run visited all 1 properties in 6 ms. (steps per millisecond=65 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 418 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1671 reset in 1187 ms.
Product exploration explored 100000 steps with 1673 reset in 1210 ms.
Built C files in :
/tmp/ltsmin16520492100529500208
[2023-03-23 17:05:01] [INFO ] Too many transitions (8256) to apply POR reductions. Disabling POR matrices.
[2023-03-23 17:05:01] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16520492100529500208
Running compilation step : cd /tmp/ltsmin16520492100529500208;'/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/ltsmin16520492100529500208;'/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/ltsmin16520492100529500208;'/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 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Applied a total of 10 rules in 1743 ms. Remains 4949 /4954 variables (removed 5) and now considering 8237/8256 (removed 19) transitions.
[2023-03-23 17:05:06] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2023-03-23 17:05:06] [INFO ] Computed 1093 place invariants in 203 ms
[2023-03-23 17:05:10] [INFO ] Implicit Places using invariants in 4305 ms returned []
[2023-03-23 17:05:10] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-23 17:05:10] [INFO ] Invariant cache hit.
[2023-03-23 17:05:14] [INFO ] Implicit Places using invariants and state equation in 4072 ms returned []
Implicit Place search using SMT with State Equation took 8379 ms to find 0 implicit places.
[2023-03-23 17:05:15] [INFO ] Redundant transitions in 966 ms returned []
[2023-03-23 17:05:15] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-23 17:05:15] [INFO ] Invariant cache hit.
[2023-03-23 17:05:20] [INFO ] Dead Transitions using invariants and state equation in 4978 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/4954 places, 8237/8256 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16075 ms. Remains : 4949/4954 places, 8237/8256 transitions.
Built C files in :
/tmp/ltsmin1570454101687499302
[2023-03-23 17:05:20] [INFO ] Too many transitions (8237) to apply POR reductions. Disabling POR matrices.
[2023-03-23 17:05:20] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1570454101687499302
Running compilation step : cd /tmp/ltsmin1570454101687499302;'/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/ltsmin1570454101687499302;'/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/ltsmin1570454101687499302;'/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-23 17:05:24] [INFO ] Flatten gal took : 242 ms
[2023-03-23 17:05:25] [INFO ] Flatten gal took : 250 ms
[2023-03-23 17:05:25] [INFO ] Time to serialize gal into /tmp/LTL14213322374994824420.gal : 325 ms
[2023-03-23 17:05:25] [INFO ] Time to serialize properties into /tmp/LTL10229788577505679680.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/LTL14213322374994824420.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8930272667874866160.hoa' '-atoms' '/tmp/LTL10229788577505679680.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/LTL10229788577505679680.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8930272667874866160.hoa
Detected timeout of ITS tools.
[2023-03-23 17:05:41] [INFO ] Flatten gal took : 241 ms
[2023-03-23 17:05:41] [INFO ] Flatten gal took : 255 ms
[2023-03-23 17:05:41] [INFO ] Time to serialize gal into /tmp/LTL545200902932292724.gal : 47 ms
[2023-03-23 17:05:41] [INFO ] Time to serialize properties into /tmp/LTL4144262332462439529.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL545200902932292724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4144262332462439529.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...274
Read 1 LTL properties
Checking formula 0 : !(((G(F("(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeaf...264
Formula 0 simplified : FG!"(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeafSet>=1)...248
Detected timeout of ITS tools.
[2023-03-23 17:05:56] [INFO ] Flatten gal took : 204 ms
[2023-03-23 17:05:56] [INFO ] Applying decomposition
[2023-03-23 17:05:57] [INFO ] Flatten gal took : 226 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/graph17715464699186985988.txt' '-o' '/tmp/graph17715464699186985988.bin' '-w' '/tmp/graph17715464699186985988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17715464699186985988.bin' '-l' '-1' '-v' '-w' '/tmp/graph17715464699186985988.weights' '-q' '0' '-e' '0.001'
[2023-03-23 17:05:57] [INFO ] Decomposing Gal with order
[2023-03-23 17:05:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 17:05:59] [INFO ] Removed a total of 6859 redundant transitions.
[2023-03-23 17:06:00] [INFO ] Flatten gal took : 1837 ms
[2023-03-23 17:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 5252 labels/synchronizations in 520 ms.
[2023-03-23 17:06:01] [INFO ] Time to serialize gal into /tmp/LTL13973106237634523088.gal : 92 ms
[2023-03-23 17:06:01] [INFO ] Time to serialize properties into /tmp/LTL3437326395738816595.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13973106237634523088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3437326395738816595.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...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i25.u391.Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((i0.u389.Node7ManageTheCrashOfNode15>=1)&&(i0.u388.Rx3IsAtT...303
Formula 0 simplified : FG!"(i25.u391.Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((i0.u389.Node7ManageTheCrashOfNode15>=1)&&(i0.u388.Rx3IsAtTheRight...287
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin738253662710841190
[2023-03-23 17:06:16] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin738253662710841190
Running compilation step : cd /tmp/ltsmin738253662710841190;'/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/ltsmin738253662710841190;'/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/ltsmin738253662710841190;'/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-S24C08-LTLFireability-07 finished in 122401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 553 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-23 17:06:19] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-23 17:06:21] [INFO ] Computed 1093 place invariants in 1509 ms
[2023-03-23 17:06:22] [INFO ] Implicit Places using invariants in 2759 ms returned []
Implicit Place search using SMT only with invariants took 2760 ms to find 0 implicit places.
[2023-03-23 17:06:22] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:06:22] [INFO ] Invariant cache hit.
[2023-03-23 17:06:24] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4696 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s9295 1) (LT s14876 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 87700 steps with 43850 reset in 10001 ms.
Product exploration timeout after 86500 steps with 43250 reset in 10002 ms.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Computed a total of 12512 stabilizing places and 17066 stable transitions
Detected a total of 12512/15136 stabilizing places and 17066/22267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 finished in 25055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17068
Deduced a syphon composed of 400 places in 13 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 8 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 2 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Applied a total of 20374 rules in 3216 ms. Remains 4949 /15136 variables (removed 10187) and now considering 8237/22267 (removed 14030) transitions.
[2023-03-23 17:06:47] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2023-03-23 17:06:47] [INFO ] Computed 1093 place invariants in 194 ms
[2023-03-23 17:06:52] [INFO ] Implicit Places using invariants in 5217 ms returned []
[2023-03-23 17:06:52] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-23 17:06:52] [INFO ] Invariant cache hit.
[2023-03-23 17:06:58] [INFO ] Implicit Places using invariants and state equation in 5344 ms returned []
Implicit Place search using SMT with State Equation took 10567 ms to find 0 implicit places.
[2023-03-23 17:06:59] [INFO ] Redundant transitions in 979 ms returned []
[2023-03-23 17:06:59] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
[2023-03-23 17:06:59] [INFO ] Invariant cache hit.
[2023-03-23 17:07:04] [INFO ] Dead Transitions using invariants and state equation in 4948 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/15136 places, 8237/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19723 ms. Remains : 4949/15136 places, 8237/22267 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1850 1), p1:(AND (GEQ s2832 1) (GEQ s4406 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 finished in 19945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4800 transitions
Trivial Post-agglo rules discarded 4800 transitions
Performed 4800 trivial Post agglomeration. Transition count delta: 4800
Iterating post reduction 0 with 4800 rules applied. Total rules applied 4800 place count 15136 transition count 17467
Reduce places removed 4800 places and 0 transitions.
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17067
Deduced a syphon composed of 400 places in 14 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10400 place count 9936 transition count 17067
Discarding 4400 places :
Symmetric choice reduction at 2 with 4400 rule applications. Total rules 14800 place count 5536 transition count 12667
Iterating global reduction 2 with 4400 rules applied. Total rules applied 19200 place count 5536 transition count 12667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19200 place count 5536 transition count 12651
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 19232 place count 5520 transition count 12651
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19781 place count 4971 transition count 8259
Iterating global reduction 2 with 549 rules applied. Total rules applied 20330 place count 4971 transition count 8259
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20380 place count 4946 transition count 8234
Applied a total of 20380 rules in 3336 ms. Remains 4946 /15136 variables (removed 10190) and now considering 8234/22267 (removed 14033) transitions.
[2023-03-23 17:07:07] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
// Phase 1: matrix 7634 rows 4946 cols
[2023-03-23 17:07:07] [INFO ] Computed 1093 place invariants in 217 ms
[2023-03-23 17:07:12] [INFO ] Implicit Places using invariants in 5256 ms returned []
[2023-03-23 17:07:12] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-23 17:07:12] [INFO ] Invariant cache hit.
[2023-03-23 17:07:17] [INFO ] Implicit Places using invariants and state equation in 4916 ms returned []
Implicit Place search using SMT with State Equation took 10177 ms to find 0 implicit places.
[2023-03-23 17:07:18] [INFO ] Redundant transitions in 950 ms returned []
[2023-03-23 17:07:18] [INFO ] Flow matrix only has 7634 transitions (discarded 600 similar events)
[2023-03-23 17:07:18] [INFO ] Invariant cache hit.
[2023-03-23 17:07:24] [INFO ] Dead Transitions using invariants and state equation in 5324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4946/15136 places, 8234/22267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19809 ms. Remains : 4946/15136 places, 8234/22267 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2633 1) (GEQ s4945 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 finished in 19912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p1||G(p2)))))'
Support contains 6 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 548 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2023-03-23 17:07:24] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2023-03-23 17:07:26] [INFO ] Computed 1093 place invariants in 1472 ms
[2023-03-23 17:07:27] [INFO ] Implicit Places using invariants in 2726 ms returned []
Implicit Place search using SMT only with invariants took 2727 ms to find 0 implicit places.
[2023-03-23 17:07:27] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2023-03-23 17:07:27] [INFO ] Invariant cache hit.
[2023-03-23 17:07:28] [INFO ] Dead Transitions using invariants and state equation in 1271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4551 ms. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s3151 1) (GEQ s3399 1)), p0:(AND (GEQ s9895 1) (GEQ s15011 1)), p2:(AND (GEQ s9045 1) (GEQ s15092 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 finished in 4745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(p1)&&F(G(p2))))))'
[2023-03-23 17:07:29] [INFO ] Flatten gal took : 612 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7509150683048430905
[2023-03-23 17:07:30] [INFO ] Too many transitions (22267) to apply POR reductions. Disabling POR matrices.
[2023-03-23 17:07:30] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7509150683048430905
Running compilation step : cd /tmp/ltsmin7509150683048430905;'/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-23 17:07:30] [INFO ] Applying decomposition
[2023-03-23 17:07:31] [INFO ] Flatten gal took : 895 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/graph4424188221422360231.txt' '-o' '/tmp/graph4424188221422360231.bin' '-w' '/tmp/graph4424188221422360231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4424188221422360231.bin' '-l' '-1' '-v' '-w' '/tmp/graph4424188221422360231.weights' '-q' '0' '-e' '0.001'
[2023-03-23 17:07:33] [INFO ] Decomposing Gal with order
[2023-03-23 17:07:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 17:07:38] [INFO ] Removed a total of 14270 redundant transitions.
[2023-03-23 17:07:38] [INFO ] Flatten gal took : 2484 ms
[2023-03-23 17:07:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1493 labels/synchronizations in 389 ms.
[2023-03-23 17:07:39] [INFO ] Time to serialize gal into /tmp/LTLFireability17248361524829213681.gal : 141 ms
[2023-03-23 17:07:39] [INFO ] Time to serialize properties into /tmp/LTLFireability8854102251113227777.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/LTLFireability17248361524829213681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8854102251113227777.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...277
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i17.u379.Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((i1.u164.Node7ManageTheCrashOfNode15>=1)&&(i6.u365.Rx3IsAtT...307
Formula 0 simplified : FG!"(i17.u379.Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((i1.u164.Node7ManageTheCrashOfNode15>=1)&&(i6.u365.Rx3IsAtTheRight...291
Compilation finished in 314184 ms.
Running link step : cd /tmp/ltsmin7509150683048430905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 228 ms.
Running LTSmin : cd /tmp/ltsmin7509150683048430905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&<>([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 17:29:37] [INFO ] Flatten gal took : 2376 ms
[2023-03-23 17:29:38] [INFO ] Time to serialize gal into /tmp/LTLFireability13335842984059858489.gal : 474 ms
[2023-03-23 17:29:38] [INFO ] Time to serialize properties into /tmp/LTLFireability12173142810707960572.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/LTLFireability13335842984059858489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12173142810707960572.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...299
Read 1 LTL properties
Checking formula 0 : !(((G(F("(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeaf...264
Formula 0 simplified : FG!"(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeafSet>=1)...248
Detected timeout of ITS tools.
[2023-03-23 17:51:36] [INFO ] Flatten gal took : 2330 ms
[2023-03-23 17:51:38] [INFO ] Input system was already deterministic with 22267 transitions.
[2023-03-23 17:51:39] [INFO ] Transformed 15136 places.
[2023-03-23 17:51:39] [INFO ] Transformed 22267 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-23 17:52:17] [INFO ] Time to serialize gal into /tmp/LTLFireability11373101925929976804.gal : 216 ms
[2023-03-23 17:52:17] [INFO ] Time to serialize properties into /tmp/LTLFireability14338721701293365375.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/LTLFireability11373101925929976804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14338721701293365375.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 : !(((G(F("(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)")))||(G((F("((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeaf...264
Formula 0 simplified : FG!"(Node13HasTheLeafSetOfRx1ToReplaceNode20<1)" & F(G!"((Node7ManageTheCrashOfNode15>=1)&&(Rx3IsAtTheRightExtremityOfTheLeafSet>=1)...248
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13667448 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14342196 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-S24C08"
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-S24C08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-167856413800852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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