Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 DoubleExponent-PT-100-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716429757982

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 02:02:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 02:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:02:39] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-23 02:02:39] [INFO ] Transformed 5304 places.
[2024-05-23 02:02:39] [INFO ] Transformed 4998 transitions.
[2024-05-23 02:02:39] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DoubleExponent-PT-100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1088 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:02:42] [INFO ] Invariants computation overflowed in 182 ms
[2024-05-23 02:02:44] [INFO ] Implicit Places using invariants in 2516 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:02:44] [INFO ] Invariants computation overflowed in 155 ms
[2024-05-23 02:02:45] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 3665 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:02:45] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-23 02:02:48] [INFO ] Dead Transitions using invariants and state equation in 3236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7994 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 37 out of 5300 places after structural reductions.
[2024-05-23 02:02:49] [INFO ] Flatten gal took : 311 ms
[2024-05-23 02:02:49] [INFO ] Flatten gal took : 190 ms
[2024-05-23 02:02:50] [INFO ] Input system was already deterministic with 4998 transitions.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 58176 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{7=1}
Probabilistic random walk after 58176 steps, saw 29092 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :1
Running SMT prover for 22 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:02:55] [INFO ] Invariants computation overflowed in 121 ms
[2024-05-23 02:02:57] [INFO ] After 2139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-23 02:03:22] [INFO ] After 21847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2024-05-23 02:03:22] [INFO ] After 21858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 02:03:22] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1159 transitions
Trivial Post-agglo rules discarded 1159 transitions
Performed 1159 trivial Post agglomeration. Transition count delta: 1159
Iterating post reduction 0 with 1162 rules applied. Total rules applied 1163 place count 5297 transition count 3837
Reduce places removed 1159 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 1177 rules applied. Total rules applied 2340 place count 4138 transition count 3819
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 2358 place count 4120 transition count 3819
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2358 place count 4120 transition count 3618
Deduced a syphon composed of 201 places in 179 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2760 place count 3919 transition count 3618
Performed 887 Post agglomeration using F-continuation condition.Transition count delta: 887
Deduced a syphon composed of 887 places in 210 ms
Reduce places removed 887 places and 0 transitions.
Iterating global reduction 3 with 1774 rules applied. Total rules applied 4534 place count 3032 transition count 2731
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4736 place count 2931 transition count 2731
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 50 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 4916 place count 2841 transition count 2731
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4918 place count 2841 transition count 2729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4920 place count 2839 transition count 2729
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 4 with 408 rules applied. Total rules applied 5328 place count 2839 transition count 2321
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 4 with 408 rules applied. Total rules applied 5736 place count 2431 transition count 2321
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 5 with 398 rules applied. Total rules applied 6134 place count 2431 transition count 2321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6135 place count 2430 transition count 2320
Applied a total of 6135 rules in 2234 ms. Remains 2430 /5300 variables (removed 2870) and now considering 2320/4998 (removed 2678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2235 ms. Remains : 2430/5300 places, 2320/4998 transitions.
Incomplete random walk after 10000 steps, including 1253 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 104806 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104806 steps, saw 52446 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-23 02:03:28] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:03:29] [INFO ] After 1085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-23 02:03:54] [INFO ] After 23333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-23 02:03:54] [INFO ] State equation strengthened by 387 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:03:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:03:54] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 2320/2320 transitions.
Applied a total of 0 rules in 147 ms. Remains 2430 /2430 variables (removed 0) and now considering 2320/2320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 2430/2430 places, 2320/2320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 2320/2320 transitions.
Applied a total of 0 rules in 142 ms. Remains 2430 /2430 variables (removed 0) and now considering 2320/2320 (removed 0) transitions.
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-23 02:03:55] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-23 02:04:03] [INFO ] Implicit Places using invariants in 8608 ms returned []
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-23 02:04:03] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:04:12] [INFO ] Implicit Places using invariants and state equation in 9021 ms returned []
Implicit Place search using SMT with State Equation took 17632 ms to find 0 implicit places.
[2024-05-23 02:04:12] [INFO ] Redundant transitions in 138 ms returned []
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-23 02:04:12] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-23 02:04:14] [INFO ] Dead Transitions using invariants and state equation in 1370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19311 ms. Remains : 2430/2430 places, 2320/2320 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2430 transition count 2317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 2427 transition count 2317
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 190 Pre rules applied. Total rules applied 6 place count 2427 transition count 2127
Deduced a syphon composed of 190 places in 52 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 386 place count 2237 transition count 2127
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 2237 transition count 2125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 390 place count 2235 transition count 2125
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 2235 transition count 2124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 2234 transition count 2124
Applied a total of 392 rules in 543 ms. Remains 2234 /2430 variables (removed 196) and now considering 2124/2320 (removed 196) transitions.
Running SMT prover for 22 properties.
// Phase 1: matrix 2124 rows 2234 cols
[2024-05-23 02:04:14] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-23 02:04:15] [INFO ] After 1050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2024-05-23 02:05:38] [INFO ] After 80616ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :15
[2024-05-23 02:05:41] [INFO ] Deduced a trap composed of 576 places in 2529 ms of which 18 ms to minimize.
[2024-05-23 02:05:44] [INFO ] Deduced a trap composed of 571 places in 2503 ms of which 4 ms to minimize.
[2024-05-23 02:05:47] [INFO ] Deduced a trap composed of 18 places in 2492 ms of which 3 ms to minimize.
[2024-05-23 02:05:49] [INFO ] Deduced a trap composed of 23 places in 2511 ms of which 2 ms to minimize.
[2024-05-23 02:05:52] [INFO ] Deduced a trap composed of 591 places in 2488 ms of which 2 ms to minimize.
[2024-05-23 02:05:55] [INFO ] Deduced a trap composed of 592 places in 2506 ms of which 2 ms to minimize.
[2024-05-23 02:05:58] [INFO ] Deduced a trap composed of 578 places in 2476 ms of which 2 ms to minimize.
[2024-05-23 02:06:01] [INFO ] Deduced a trap composed of 620 places in 2512 ms of which 2 ms to minimize.
[2024-05-23 02:06:04] [INFO ] Deduced a trap composed of 570 places in 2516 ms of which 2 ms to minimize.
[2024-05-23 02:06:07] [INFO ] Deduced a trap composed of 585 places in 2482 ms of which 2 ms to minimize.
[2024-05-23 02:06:10] [INFO ] Deduced a trap composed of 554 places in 2497 ms of which 2 ms to minimize.
[2024-05-23 02:06:13] [INFO ] Deduced a trap composed of 619 places in 2521 ms of which 2 ms to minimize.
[2024-05-23 02:06:16] [INFO ] Deduced a trap composed of 606 places in 2486 ms of which 2 ms to minimize.
[2024-05-23 02:06:19] [INFO ] Deduced a trap composed of 590 places in 2669 ms of which 2 ms to minimize.
[2024-05-23 02:06:22] [INFO ] Deduced a trap composed of 577 places in 2503 ms of which 2 ms to minimize.
[2024-05-23 02:06:25] [INFO ] Deduced a trap composed of 571 places in 2510 ms of which 2 ms to minimize.
[2024-05-23 02:06:28] [INFO ] Deduced a trap composed of 584 places in 2576 ms of which 2 ms to minimize.
[2024-05-23 02:06:31] [INFO ] Deduced a trap composed of 586 places in 2500 ms of which 2 ms to minimize.
[2024-05-23 02:06:34] [INFO ] Deduced a trap composed of 601 places in 2521 ms of which 2 ms to minimize.
[2024-05-23 02:06:37] [INFO ] Deduced a trap composed of 567 places in 2481 ms of which 3 ms to minimize.
[2024-05-23 02:06:40] [INFO ] Deduced a trap composed of 575 places in 2472 ms of which 2 ms to minimize.
[2024-05-23 02:06:43] [INFO ] Deduced a trap composed of 598 places in 2470 ms of which 2 ms to minimize.
[2024-05-23 02:06:46] [INFO ] Deduced a trap composed of 591 places in 2518 ms of which 2 ms to minimize.
[2024-05-23 02:06:49] [INFO ] Deduced a trap composed of 541 places in 2505 ms of which 2 ms to minimize.
[2024-05-23 02:06:52] [INFO ] Deduced a trap composed of 556 places in 2532 ms of which 4 ms to minimize.
[2024-05-23 02:06:54] [INFO ] Deduced a trap composed of 573 places in 2496 ms of which 2 ms to minimize.
[2024-05-23 02:06:55] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 76830 ms
[2024-05-23 02:07:08] [INFO ] Deduced a trap composed of 715 places in 2111 ms of which 2 ms to minimize.
[2024-05-23 02:07:11] [INFO ] Deduced a trap composed of 32 places in 2152 ms of which 2 ms to minimize.
[2024-05-23 02:07:13] [INFO ] Deduced a trap composed of 56 places in 2152 ms of which 4 ms to minimize.
[2024-05-23 02:07:15] [INFO ] Deduced a trap composed of 643 places in 2100 ms of which 2 ms to minimize.
[2024-05-23 02:07:17] [INFO ] Deduced a trap composed of 719 places in 2122 ms of which 2 ms to minimize.
[2024-05-23 02:07:19] [INFO ] Deduced a trap composed of 719 places in 2116 ms of which 1 ms to minimize.
[2024-05-23 02:07:22] [INFO ] Deduced a trap composed of 685 places in 2109 ms of which 1 ms to minimize.
[2024-05-23 02:07:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 15617 ms
[2024-05-23 02:07:39] [INFO ] Deduced a trap composed of 8 places in 2085 ms of which 3 ms to minimize.
[2024-05-23 02:07:41] [INFO ] Deduced a trap composed of 13 places in 2111 ms of which 2 ms to minimize.
[2024-05-23 02:07:43] [INFO ] Deduced a trap composed of 38 places in 2069 ms of which 2 ms to minimize.
[2024-05-23 02:07:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6753 ms
[2024-05-23 02:07:49] [INFO ] Deduced a trap composed of 68 places in 1300 ms of which 1 ms to minimize.
[2024-05-23 02:07:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1854 ms
[2024-05-23 02:07:53] [INFO ] Deduced a trap composed of 107 places in 1509 ms of which 2 ms to minimize.
[2024-05-23 02:07:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1970 ms
[2024-05-23 02:07:55] [INFO ] Deduced a trap composed of 199 places in 477 ms of which 1 ms to minimize.
[2024-05-23 02:07:56] [INFO ] Deduced a trap composed of 202 places in 463 ms of which 0 ms to minimize.
[2024-05-23 02:07:56] [INFO ] Deduced a trap composed of 216 places in 458 ms of which 0 ms to minimize.
[2024-05-23 02:07:57] [INFO ] Deduced a trap composed of 245 places in 432 ms of which 0 ms to minimize.
[2024-05-23 02:07:58] [INFO ] Deduced a trap composed of 262 places in 423 ms of which 0 ms to minimize.
[2024-05-23 02:07:58] [INFO ] Deduced a trap composed of 268 places in 425 ms of which 1 ms to minimize.
[2024-05-23 02:07:59] [INFO ] Deduced a trap composed of 272 places in 426 ms of which 0 ms to minimize.
[2024-05-23 02:07:59] [INFO ] Deduced a trap composed of 275 places in 419 ms of which 0 ms to minimize.
[2024-05-23 02:08:00] [INFO ] Deduced a trap composed of 272 places in 428 ms of which 0 ms to minimize.
[2024-05-23 02:08:00] [INFO ] Deduced a trap composed of 278 places in 422 ms of which 0 ms to minimize.
[2024-05-23 02:08:01] [INFO ] Deduced a trap composed of 281 places in 418 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 02:08:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 02:08:01] [INFO ] After 225216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA DoubleExponent-PT-100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 857 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:08:02] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-23 02:08:04] [INFO ] Implicit Places using invariants in 2085 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:08:04] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:08:05] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 3022 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:08:05] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:08:08] [INFO ] Dead Transitions using invariants and state equation in 3238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7120 ms. Remains : 5300/5300 places, 4998/4998 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 3 s3841) (GT s824 s2912)), p1:(GT 1 s1310)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3316 reset in 359 ms.
Product exploration explored 100000 steps with 3285 reset in 267 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 80399 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80399 steps, saw 40205 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:08:13] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-23 02:08:38] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1202 place count 5297 transition count 3798
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2401 place count 4099 transition count 3797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 177 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 63 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 53 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 399 times.
Iterating global reduction 3 with 399 rules applied. Total rules applied 5407 place count 2795 transition count 2293
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 3 with 399 rules applied. Total rules applied 5806 place count 2396 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6206 place count 2396 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6207 place count 2395 transition count 2292
Applied a total of 6207 rules in 1833 ms. Remains 2395 /5300 variables (removed 2905) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1836 ms. Remains : 2395/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 169907 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169907 steps, saw 84980 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-23 02:08:43] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:09:08] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2292/2292 transitions.
Applied a total of 0 rules in 205 ms. Remains 2395 /2395 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 2395/2395 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2292/2292 transitions.
Applied a total of 0 rules in 205 ms. Remains 2395 /2395 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-23 02:09:09] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-23 02:09:32] [INFO ] Implicit Places using invariants in 22699 ms returned []
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-23 02:09:32] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:09:55] [INFO ] Implicit Places using invariants and state equation in 23497 ms returned []
Implicit Place search using SMT with State Equation took 46201 ms to find 0 implicit places.
[2024-05-23 02:09:55] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-23 02:09:55] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:09:57] [INFO ] Dead Transitions using invariants and state equation in 1546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48118 ms. Remains : 2395/2395 places, 2292/2292 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Support contains 1 out of 5300 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 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2391 place count 4105 transition count 3800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3599
Deduced a syphon composed of 201 places in 179 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 63 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 51 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 4992 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2804 transition count 2700
Applied a total of 4993 rules in 1411 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:09:59] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:10:00] [INFO ] Implicit Places using invariants in 1454 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:00] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:10:02] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 3859 ms to find 0 implicit places.
[2024-05-23 02:10:02] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:02] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:10:04] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6595 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1394 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100066 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100066 steps, saw 50050 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:10:07] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:10:26] [INFO ] After 19320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 749 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 2398/2804 places, 2294/2700 transitions.
Incomplete random walk after 10000 steps, including 1228 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 124685 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124685 steps, saw 62396 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:10:30] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:10:47] [INFO ] After 16445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 216 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 191 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:10:47] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:11:10] [INFO ] Implicit Places using invariants in 22899 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:11:10] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:11:34] [INFO ] Implicit Places using invariants and state equation in 23580 ms returned []
Implicit Place search using SMT with State Equation took 46486 ms to find 0 implicit places.
[2024-05-23 02:11:34] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:11:34] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:11:35] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48328 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2398 transition count 2094
Deduced a syphon composed of 200 places in 88 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2198 transition count 2094
Applied a total of 400 rules in 333 ms. Remains 2198 /2398 variables (removed 200) and now considering 2094/2294 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2198 cols
[2024-05-23 02:11:36] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:11:54] [INFO ] After 18425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13849 reset in 172 ms.
Product exploration explored 100000 steps with 13852 reset in 178 ms.
Built C files in :
/tmp/ltsmin8443708209561586826
[2024-05-23 02:11:55] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:11:55] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8443708209561586826
Running compilation step : cd /tmp/ltsmin8443708209561586826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8443708209561586826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8443708209561586826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2804 transition count 2696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2800 transition count 2696
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 47 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2799 transition count 2695
Applied a total of 10 rules in 254 ms. Remains 2799 /2804 variables (removed 5) and now considering 2695/2700 (removed 5) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:11:58] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-23 02:12:00] [INFO ] Implicit Places using invariants in 1396 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:12:00] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:12:02] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 3717 ms to find 0 implicit places.
[2024-05-23 02:12:02] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:12:02] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:12:03] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2804 places, 2695/2700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5278 ms. Remains : 2799/2804 places, 2695/2700 transitions.
Built C files in :
/tmp/ltsmin12298903997968842883
[2024-05-23 02:12:03] [INFO ] Too many transitions (2695) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:12:03] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12298903997968842883
Running compilation step : cd /tmp/ltsmin12298903997968842883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12298903997968842883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12298903997968842883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:12:07] [INFO ] Flatten gal took : 117 ms
[2024-05-23 02:12:07] [INFO ] Flatten gal took : 99 ms
[2024-05-23 02:12:07] [INFO ] Time to serialize gal into /tmp/LTL3602103116086524215.gal : 30 ms
[2024-05-23 02:12:07] [INFO ] Time to serialize properties into /tmp/LTL5425594445216493562.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3602103116086524215.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10816643799070535790.hoa' '-atoms' '/tmp/LTL5425594445216493562.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5425594445216493562.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10816643799070535790.hoa
Detected timeout of ITS tools.
[2024-05-23 02:12:22] [INFO ] Flatten gal took : 87 ms
[2024-05-23 02:12:22] [INFO ] Flatten gal took : 87 ms
[2024-05-23 02:12:22] [INFO ] Time to serialize gal into /tmp/LTL17512421177931550688.gal : 18 ms
[2024-05-23 02:12:22] [INFO ] Time to serialize properties into /tmp/LTL8062506417630695697.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17512421177931550688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8062506417630695697.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("(p2178<1)")))&&("((p4456<3)||(p1740>p362))")))))
Formula 0 simplified : X(GF!"(p2178<1)" | G!"((p4456<3)||(p1740>p362))")
Detected timeout of ITS tools.
[2024-05-23 02:12:38] [INFO ] Flatten gal took : 80 ms
[2024-05-23 02:12:38] [INFO ] Applying decomposition
[2024-05-23 02:12:38] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4345996444214130872.txt' '-o' '/tmp/graph4345996444214130872.bin' '-w' '/tmp/graph4345996444214130872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4345996444214130872.bin' '-l' '-1' '-v' '-w' '/tmp/graph4345996444214130872.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:12:38] [INFO ] Decomposing Gal with order
[2024-05-23 02:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:12:39] [INFO ] Removed a total of 2110 redundant transitions.
[2024-05-23 02:12:39] [INFO ] Flatten gal took : 242 ms
[2024-05-23 02:12:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 127 ms.
[2024-05-23 02:12:40] [INFO ] Time to serialize gal into /tmp/LTL9686384373530708300.gal : 39 ms
[2024-05-23 02:12:40] [INFO ] Time to serialize properties into /tmp/LTL3481775495374709571.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9686384373530708300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3481775495374709571.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("(gi1.gu254.p2178<1)")))&&("((gi4.gi0.gi2.gi3.gu762.p4456<3)||(gu578.p1740>gu578.p362))")))))
Formula 0 simplified : X(GF!"(gi1.gu254.p2178<1)" | G!"((gi4.gi0.gi2.gi3.gu762.p4456<3)||(gu578.p1740>gu578.p362))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9176787885798571440
[2024-05-23 02:12:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9176787885798571440
Running compilation step : cd /tmp/ltsmin9176787885798571440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9176787885798571440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9176787885798571440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-00 finished in 297028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&(p2||G(F(p3)))))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 860 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:12:59] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-23 02:13:01] [INFO ] Implicit Places using invariants in 2180 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:13:01] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-23 02:13:02] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 3209 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:13:02] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-23 02:13:05] [INFO ] Dead Transitions using invariants and state equation in 3232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7303 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s2513 s714), p1:(LEQ s3468 s2939), p2:(LEQ s3433 s4657), p3:(LEQ 3 s3605)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-01 finished in 8115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(G(p1))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 846 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:13:07] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-23 02:13:09] [INFO ] Implicit Places using invariants in 2281 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:13:09] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 02:13:10] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 3193 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:13:10] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-23 02:13:13] [INFO ] Dead Transitions using invariants and state equation in 3265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7305 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s4847 s2802), p0:(AND (GT 1 s579) (LEQ s4847 s2802))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33265 reset in 2458 ms.
Product exploration explored 100000 steps with 33248 reset in 2463 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 325 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 52042 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{1=1}
Probabilistic random walk after 52042 steps, saw 26026 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:13:24] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-23 02:13:24] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 02:13:28] [INFO ] After 3118ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-23 02:13:28] [INFO ] After 3785ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9269 ms.
[2024-05-23 02:13:38] [INFO ] After 13675ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1098 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1202 place count 5297 transition count 3798
Reduce places removed 1198 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2402 place count 4099 transition count 3796
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 182 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 61 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4614 place count 2992 transition count 2691
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4816 place count 2891 transition count 2691
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 58 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 5008 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 3 with 398 rules applied. Total rules applied 5406 place count 2795 transition count 2293
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 3 with 398 rules applied. Total rules applied 5804 place count 2397 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6204 place count 2397 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6205 place count 2396 transition count 2292
Applied a total of 6205 rules in 1839 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1839 ms. Remains : 2396/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1305 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 123069 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123069 steps, saw 61585 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:13:44] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:13:44] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:13:55] [INFO ] After 10613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 216 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 198 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:13:55] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:14:18] [INFO ] Implicit Places using invariants in 23008 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:14:18] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:14:42] [INFO ] Implicit Places using invariants and state equation in 23844 ms returned []
Implicit Place search using SMT with State Equation took 46858 ms to find 0 implicit places.
[2024-05-23 02:14:42] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:14:42] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:14:44] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48754 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 198 Pre rules applied. Total rules applied 0 place count 2396 transition count 2094
Deduced a syphon composed of 198 places in 107 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2198 transition count 2094
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 397 place count 2198 transition count 2093
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 398 place count 2197 transition count 2093
Applied a total of 398 rules in 570 ms. Remains 2197 /2396 variables (removed 199) and now considering 2093/2292 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2093 rows 2197 cols
[2024-05-23 02:14:44] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:14:45] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:14:46] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:14:55] [INFO ] After 10236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-23 02:14:55] [INFO ] After 10503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Support contains 2 out of 5300 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 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2393 place count 4104 transition count 3799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 188 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 69 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 63 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 52 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2695
Applied a total of 4997 rules in 1248 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:14:57] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:14:58] [INFO ] Implicit Places using invariants in 1516 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:14:58] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-23 02:15:01] [INFO ] Implicit Places using invariants and state equation in 2400 ms returned []
Implicit Place search using SMT with State Equation took 3918 ms to find 0 implicit places.
[2024-05-23 02:15:01] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:15:01] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:15:02] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6583 ms. Remains : 2800/5300 places, 2695/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1358 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 793 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97084 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97084 steps, saw 48553 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:15:06] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:15:06] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:15:16] [INFO ] After 10357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 2797 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 2797 transition count 2691
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2399 transition count 2294
Applied a total of 1200 rules in 657 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122338 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122338 steps, saw 61206 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:15:20] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:15:20] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:15:34] [INFO ] After 13336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 205 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 211 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:15:34] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:15:57] [INFO ] Implicit Places using invariants in 22759 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:15:57] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:16:20] [INFO ] Implicit Places using invariants and state equation in 23186 ms returned []
Implicit Place search using SMT with State Equation took 45949 ms to find 0 implicit places.
[2024-05-23 02:16:20] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:16:20] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:16:22] [INFO ] Dead Transitions using invariants and state equation in 1461 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47726 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 199 places in 86 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2200 transition count 2095
Applied a total of 398 rules in 335 ms. Remains 2200 /2399 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2200 cols
[2024-05-23 02:16:22] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:16:22] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:16:58] [INFO ] After 36164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13866 reset in 200 ms.
Product exploration explored 100000 steps with 13789 reset in 206 ms.
Built C files in :
/tmp/ltsmin5278833666311799108
[2024-05-23 02:16:59] [INFO ] Too many transitions (2695) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:16:59] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5278833666311799108
Running compilation step : cd /tmp/ltsmin5278833666311799108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5278833666311799108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5278833666311799108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2695/2695 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 2800 transition count 2694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2799 transition count 2694
Applied a total of 2 rules in 144 ms. Remains 2799 /2800 variables (removed 1) and now considering 2694/2695 (removed 1) transitions.
// Phase 1: matrix 2694 rows 2799 cols
[2024-05-23 02:17:02] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:17:04] [INFO ] Implicit Places using invariants in 1355 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2024-05-23 02:17:04] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:17:06] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 3595 ms to find 0 implicit places.
[2024-05-23 02:17:06] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2024-05-23 02:17:06] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:17:07] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2800 places, 2694/2695 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4987 ms. Remains : 2799/2800 places, 2694/2695 transitions.
Built C files in :
/tmp/ltsmin4411451352138697460
[2024-05-23 02:17:07] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:17:07] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4411451352138697460
Running compilation step : cd /tmp/ltsmin4411451352138697460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4411451352138697460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4411451352138697460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:17:11] [INFO ] Flatten gal took : 117 ms
[2024-05-23 02:17:11] [INFO ] Flatten gal took : 80 ms
[2024-05-23 02:17:11] [INFO ] Time to serialize gal into /tmp/LTL659066584424011174.gal : 14 ms
[2024-05-23 02:17:11] [INFO ] Time to serialize properties into /tmp/LTL15856807960871414543.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL659066584424011174.gal' '-t' 'CGAL' '-hoa' '/tmp/aut895630599476568993.hoa' '-atoms' '/tmp/LTL15856807960871414543.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL15856807960871414543.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut895630599476568993.hoa
Detected timeout of ITS tools.
[2024-05-23 02:17:26] [INFO ] Flatten gal took : 75 ms
[2024-05-23 02:17:26] [INFO ] Flatten gal took : 80 ms
[2024-05-23 02:17:26] [INFO ] Time to serialize gal into /tmp/LTL11956220142950442245.gal : 13 ms
[2024-05-23 02:17:26] [INFO ] Time to serialize properties into /tmp/LTL1492393592824101887.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11956220142950442245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1492393592824101887.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(!("((p152<1)&&(p591<=p3520))")))U(X(G("(p591<=p3520)")))))
Formula 0 simplified : G"((p152<1)&&(p591<=p3520))" R XF!"(p591<=p3520)"
Detected timeout of ITS tools.
[2024-05-23 02:17:41] [INFO ] Flatten gal took : 83 ms
[2024-05-23 02:17:41] [INFO ] Applying decomposition
[2024-05-23 02:17:41] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16780984022181179069.txt' '-o' '/tmp/graph16780984022181179069.bin' '-w' '/tmp/graph16780984022181179069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16780984022181179069.bin' '-l' '-1' '-v' '-w' '/tmp/graph16780984022181179069.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:17:41] [INFO ] Decomposing Gal with order
[2024-05-23 02:17:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:17:42] [INFO ] Removed a total of 2210 redundant transitions.
[2024-05-23 02:17:42] [INFO ] Flatten gal took : 175 ms
[2024-05-23 02:17:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 84 ms.
[2024-05-23 02:17:43] [INFO ] Time to serialize gal into /tmp/LTL12174471461121331601.gal : 39 ms
[2024-05-23 02:17:43] [INFO ] Time to serialize properties into /tmp/LTL5299644000167439120.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12174471461121331601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5299644000167439120.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(!("((gi3.gi1.gi0.gi6.gu136.p152<1)&&(gu576.p591<=gu576.p3520))")))U(X(G("(gu576.p591<=gu576.p3520)")))))
Formula 0 simplified : G"((gi3.gi1.gi0.gi6.gu136.p152<1)&&(gu576.p591<=gu576.p3520))" R XF!"(gu576.p591<=gu576.p3520)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13869155062187769552
[2024-05-23 02:17:58] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13869155062187769552
Running compilation step : cd /tmp/ltsmin13869155062187769552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13869155062187769552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13869155062187769552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-02 finished in 295114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((p1||G(p2)))))))'
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 788 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:02] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-23 02:18:04] [INFO ] Implicit Places using invariants in 2136 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:04] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-23 02:18:05] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 3118 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:05] [INFO ] Invariants computation overflowed in 103 ms
[2024-05-23 02:18:08] [INFO ] Dead Transitions using invariants and state equation in 3255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7163 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 1 s4917), p2:(LEQ s2502 s2949), p1:(AND (LEQ s2176 s4214) (GT 3 s3114))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4085 ms.
Product exploration explored 100000 steps with 50000 reset in 4083 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 11 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLCardinality-03 finished in 15952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(F(p0)))&&(p1||F(p2))))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 792 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:18] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 02:18:20] [INFO ] Implicit Places using invariants in 2160 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:20] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:18:21] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 3119 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:21] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 02:18:24] [INFO ] Dead Transitions using invariants and state equation in 3194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7108 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s925), p2:(GT 1 s4130), p0:(LEQ s1573 s2673)], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 20000 reset in 1794 ms.
Product exploration explored 100000 steps with 20000 reset in 1800 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 57018 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 57018 steps, saw 28515 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:18:33] [INFO ] Invariants computation overflowed in 109 ms
[2024-05-23 02:18:33] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:18:58] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1204 place count 5297 transition count 3796
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 189 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 65 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 58 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 52 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5006 place count 2796 transition count 2693
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 5404 place count 2796 transition count 2295
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 1669 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1669 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1299 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 124275 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124275 steps, saw 62195 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:19:03] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:19:03] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:19:28] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 210 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 203 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:19:29] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:19:51] [INFO ] Implicit Places using invariants in 22548 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:19:51] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:20:14] [INFO ] Implicit Places using invariants and state equation in 23183 ms returned []
Implicit Place search using SMT with State Equation took 45740 ms to find 0 implicit places.
[2024-05-23 02:20:15] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:20:15] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:20:16] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47530 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Knowledge obtained : [(AND (NOT p1) p2 p0), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 772 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:17] [INFO ] Invariants computation overflowed in 103 ms
[2024-05-23 02:20:19] [INFO ] Implicit Places using invariants in 2120 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:20] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:20:20] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:20] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-23 02:20:24] [INFO ] Dead Transitions using invariants and state equation in 3147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6978 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 323 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 58218 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58218 steps, saw 29114 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:20:28] [INFO ] Invariants computation overflowed in 97 ms
[2024-05-23 02:20:29] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:20:54] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1204 place count 5297 transition count 3796
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 185 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 64 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4610 place count 2994 transition count 2693
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 57 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4812 place count 2893 transition count 2693
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 53 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5006 place count 2796 transition count 2693
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 5404 place count 2796 transition count 2295
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 1672 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1672 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1302 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122597 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122597 steps, saw 61347 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:20:58] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:20:59] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:21:24] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 202 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 206 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:21:24] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:21:47] [INFO ] Implicit Places using invariants in 22850 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:21:47] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:22:10] [INFO ] Implicit Places using invariants and state equation in 23450 ms returned []
Implicit Place search using SMT with State Equation took 46311 ms to find 0 implicit places.
[2024-05-23 02:22:11] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-23 02:22:11] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:22:12] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48063 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 1742 ms.
Product exploration explored 100000 steps with 20000 reset in 1743 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1198 place count 5300 transition count 5198
Deduced a syphon composed of 1399 places in 237 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1399 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1401 place count 5298 transition count 5196
Deduced a syphon composed of 1397 places in 219 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1403 place count 5298 transition count 5196
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: -199
Deduced a syphon composed of 2297 places in 149 ms
Iterating global reduction 1 with 900 rules applied. Total rules applied 2303 place count 5298 transition count 5395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2304 place count 5297 transition count 5394
Deduced a syphon composed of 2296 places in 133 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2305 place count 5297 transition count 5394
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -662
Deduced a syphon composed of 2397 places in 139 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2406 place count 5297 transition count 6056
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2507 place count 5196 transition count 5854
Deduced a syphon composed of 2296 places in 131 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2608 place count 5196 transition count 5854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -628
Deduced a syphon composed of 2395 places in 141 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2707 place count 5196 transition count 6482
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2806 place count 5097 transition count 6284
Deduced a syphon composed of 2296 places in 128 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2905 place count 5097 transition count 6284
Deduced a syphon composed of 2296 places in 128 ms
Applied a total of 2905 rules in 4408 ms. Remains 5097 /5300 variables (removed 203) and now considering 6284/4998 (removed -1286) transitions.
[2024-05-23 02:22:21] [INFO ] Redundant transitions in 309 ms returned []
// Phase 1: matrix 6284 rows 5097 cols
[2024-05-23 02:22:21] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 02:22:25] [INFO ] Dead Transitions using invariants and state equation in 3853 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6284/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8575 ms. Remains : 5097/5300 places, 6284/4998 transitions.
Built C files in :
/tmp/ltsmin13773091548050546724
[2024-05-23 02:22:25] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13773091548050546724
Running compilation step : cd /tmp/ltsmin13773091548050546724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13773091548050546724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13773091548050546724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1009 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:22:29] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 02:22:31] [INFO ] Implicit Places using invariants in 2138 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:22:31] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:22:32] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:22:32] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-23 02:22:36] [INFO ] Dead Transitions using invariants and state equation in 3217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7316 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin16593452218215265025
[2024-05-23 02:22:36] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16593452218215265025
Running compilation step : cd /tmp/ltsmin16593452218215265025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16593452218215265025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16593452218215265025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:22:39] [INFO ] Flatten gal took : 114 ms
[2024-05-23 02:22:39] [INFO ] Flatten gal took : 116 ms
[2024-05-23 02:22:39] [INFO ] Time to serialize gal into /tmp/LTL397657062630452169.gal : 25 ms
[2024-05-23 02:22:39] [INFO ] Time to serialize properties into /tmp/LTL422923076888330291.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL397657062630452169.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6021144938464335708.hoa' '-atoms' '/tmp/LTL422923076888330291.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL422923076888330291.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6021144938464335708.hoa
Detected timeout of ITS tools.
[2024-05-23 02:22:55] [INFO ] Flatten gal took : 113 ms
[2024-05-23 02:22:55] [INFO ] Flatten gal took : 117 ms
[2024-05-23 02:22:55] [INFO ] Time to serialize gal into /tmp/LTL17320517936055615217.gal : 17 ms
[2024-05-23 02:22:55] [INFO ] Time to serialize properties into /tmp/LTL17624700900272612137.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17320517936055615217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17624700900272612137.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(F("(p2414<=p3404)"))))&&(("(p1831>=1)")||(F("(p4716<1)")))))))
Formula 0 simplified : XX(XXG!"(p2414<=p3404)" | (!"(p1831>=1)" & G!"(p4716<1)"))
Detected timeout of ITS tools.
[2024-05-23 02:23:11] [INFO ] Flatten gal took : 110 ms
[2024-05-23 02:23:11] [INFO ] Applying decomposition
[2024-05-23 02:23:11] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6965997297959075567.txt' '-o' '/tmp/graph6965997297959075567.bin' '-w' '/tmp/graph6965997297959075567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6965997297959075567.bin' '-l' '-1' '-v' '-w' '/tmp/graph6965997297959075567.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:23:11] [INFO ] Decomposing Gal with order
[2024-05-23 02:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:23:12] [INFO ] Removed a total of 1408 redundant transitions.
[2024-05-23 02:23:12] [INFO ] Flatten gal took : 213 ms
[2024-05-23 02:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 117 ms.
[2024-05-23 02:23:13] [INFO ] Time to serialize gal into /tmp/LTL4741658624778163163.gal : 33 ms
[2024-05-23 02:23:13] [INFO ] Time to serialize properties into /tmp/LTL11582291596832546059.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4741658624778163163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11582291596832546059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(F("(gu675.p2414<=gu675.p3404)"))))&&(("(gi1.gi0.gu396.p1831>=1)")||(F("(gi5.gu1724.p4716<1)")))))))
Formula 0 simplified : XX(XXG!"(gu675.p2414<=gu675.p3404)" | (!"(gi1.gi0.gu396.p1831>=1)" & G!"(gi5.gu1724.p4716<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin56777147478224348
[2024-05-23 02:23:28] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin56777147478224348
Running compilation step : cd /tmp/ltsmin56777147478224348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin56777147478224348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin56777147478224348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-06 finished in 314088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 209 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 61 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4604 place count 2997 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4806 place count 2896 transition count 2695
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 50 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5000 place count 2799 transition count 2695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5001 place count 2798 transition count 2694
Applied a total of 5001 rules in 1594 ms. Remains 2798 /5300 variables (removed 2502) and now considering 2694/4998 (removed 2304) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:23:33] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-23 02:23:34] [INFO ] Implicit Places using invariants in 1366 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:23:34] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:23:36] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 3584 ms to find 0 implicit places.
[2024-05-23 02:23:36] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:23:36] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:23:38] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/5300 places, 2694/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6434 ms. Remains : 2798/5300 places, 2694/4998 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-08 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:(GT 1 s737)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13868 reset in 177 ms.
Product exploration explored 100000 steps with 13901 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8874 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101866 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101866 steps, saw 50947 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:23:41] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:23:52] [INFO ] After 10757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8474 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2399 transition count 2295
Applied a total of 1196 rules in 729 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125247 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125247 steps, saw 62672 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:23:56] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-23 02:24:09] [INFO ] After 12673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 217 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 217 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:24:09] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-23 02:24:32] [INFO ] Implicit Places using invariants in 22686 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:24:32] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:24:55] [INFO ] Implicit Places using invariants and state equation in 22784 ms returned []
Implicit Place search using SMT with State Equation took 45474 ms to find 0 implicit places.
[2024-05-23 02:24:55] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:24:55] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-23 02:24:56] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47296 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 200 places in 87 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2199 transition count 2095
Applied a total of 400 rules in 365 ms. Remains 2199 /2399 variables (removed 200) and now considering 2095/2295 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2199 cols
[2024-05-23 02:24:57] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:25:10] [INFO ] After 13340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 169 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:25:11] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-23 02:25:12] [INFO ] Implicit Places using invariants in 1349 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:25:12] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:25:14] [INFO ] Implicit Places using invariants and state equation in 2229 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
[2024-05-23 02:25:14] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:25:14] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:25:16] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5012 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8874 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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)]
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102556 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102556 steps, saw 51284 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:25:19] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:25:30] [INFO ] After 10665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8474 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2399 transition count 2295
Applied a total of 1196 rules in 729 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 123761 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123761 steps, saw 61936 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:25:34] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-23 02:25:46] [INFO ] After 12783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 223 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 225 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:25:47] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-23 02:26:10] [INFO ] Implicit Places using invariants in 23206 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:26:10] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:26:33] [INFO ] Implicit Places using invariants and state equation in 23426 ms returned []
Implicit Place search using SMT with State Equation took 46634 ms to find 0 implicit places.
[2024-05-23 02:26:33] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2024-05-23 02:26:34] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-23 02:26:35] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48448 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 200 places in 85 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2199 transition count 2095
Applied a total of 400 rules in 359 ms. Remains 2199 /2399 variables (removed 200) and now considering 2095/2295 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2199 cols
[2024-05-23 02:26:35] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:26:49] [INFO ] After 13158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13865 reset in 174 ms.
Product exploration explored 100000 steps with 13870 reset in 185 ms.
Built C files in :
/tmp/ltsmin1367991053164575653
[2024-05-23 02:26:50] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:26:50] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1367991053164575653
Running compilation step : cd /tmp/ltsmin1367991053164575653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1367991053164575653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1367991053164575653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 167 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:26:53] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:26:54] [INFO ] Implicit Places using invariants in 1306 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:26:54] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:26:56] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 3569 ms to find 0 implicit places.
[2024-05-23 02:26:56] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2024-05-23 02:26:56] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:26:58] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5018 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Built C files in :
/tmp/ltsmin15884779483199606912
[2024-05-23 02:26:58] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:26:58] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15884779483199606912
Running compilation step : cd /tmp/ltsmin15884779483199606912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15884779483199606912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15884779483199606912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:27:01] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:27:01] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:27:01] [INFO ] Time to serialize gal into /tmp/LTL15679317087329629637.gal : 11 ms
[2024-05-23 02:27:01] [INFO ] Time to serialize properties into /tmp/LTL1087255851324578903.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15679317087329629637.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9647841060636335754.hoa' '-atoms' '/tmp/LTL1087255851324578903.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1087255851324578903.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9647841060636335754.hoa
Detected timeout of ITS tools.
[2024-05-23 02:27:16] [INFO ] Flatten gal took : 71 ms
[2024-05-23 02:27:16] [INFO ] Flatten gal took : 72 ms
[2024-05-23 02:27:16] [INFO ] Time to serialize gal into /tmp/LTL6238112298323944236.gal : 11 ms
[2024-05-23 02:27:16] [INFO ] Time to serialize properties into /tmp/LTL9258535184164757349.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6238112298323944236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9258535184164757349.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(p2252<1)"))))
Formula 0 simplified : FG!"(p2252<1)"
Detected timeout of ITS tools.
[2024-05-23 02:27:31] [INFO ] Flatten gal took : 68 ms
[2024-05-23 02:27:31] [INFO ] Applying decomposition
[2024-05-23 02:27:31] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15536370749383297849.txt' '-o' '/tmp/graph15536370749383297849.bin' '-w' '/tmp/graph15536370749383297849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15536370749383297849.bin' '-l' '-1' '-v' '-w' '/tmp/graph15536370749383297849.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:27:32] [INFO ] Decomposing Gal with order
[2024-05-23 02:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:27:32] [INFO ] Removed a total of 2119 redundant transitions.
[2024-05-23 02:27:32] [INFO ] Flatten gal took : 134 ms
[2024-05-23 02:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 54 ms.
[2024-05-23 02:27:32] [INFO ] Time to serialize gal into /tmp/LTL5394550968993917046.gal : 39 ms
[2024-05-23 02:27:32] [INFO ] Time to serialize properties into /tmp/LTL1861629286271230040.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5394550968993917046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1861629286271230040.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(i6.i1.i1.u266.p2252<1)"))))
Formula 0 simplified : FG!"(i6.i1.i1.u266.p2252<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin720370351344634002
[2024-05-23 02:27:47] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin720370351344634002
Running compilation step : cd /tmp/ltsmin720370351344634002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin720370351344634002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin720370351344634002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-08 finished in 259173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 990 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:51] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-23 02:27:53] [INFO ] Implicit Places using invariants in 2146 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:54] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:27:54] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 3104 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:27:54] [INFO ] Invariants computation overflowed in 88 ms
[2024-05-23 02:27:58] [INFO ] Dead Transitions using invariants and state equation in 3203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7298 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s3627 s1817)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3293 reset in 240 ms.
Product exploration explored 100000 steps with 3334 reset in 247 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 269 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 57714 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57714 steps, saw 28864 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:28:03] [INFO ] Invariants computation overflowed in 106 ms
[2024-05-23 02:28:03] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:28:28] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2403 place count 4098 transition count 3796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 176 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 66 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 71 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 46 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 5006 place count 2796 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5007 place count 2796 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5008 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 4 with 398 rules applied. Total rules applied 5406 place count 2795 transition count 2293
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 4 with 398 rules applied. Total rules applied 5804 place count 2397 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 5 with 399 rules applied. Total rules applied 6203 place count 2397 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6204 place count 2396 transition count 2292
Applied a total of 6204 rules in 2154 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2154 ms. Remains : 2396/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125813 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125813 steps, saw 62945 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:28:34] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:28:34] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:28:59] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 224 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 216 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:28:59] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:29:22] [INFO ] Implicit Places using invariants in 22383 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:29:22] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:29:45] [INFO ] Implicit Places using invariants and state equation in 23234 ms returned []
Implicit Place search using SMT with State Equation took 45621 ms to find 0 implicit places.
[2024-05-23 02:29:45] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:29:45] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:29:46] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47402 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 977 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:48] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 02:29:50] [INFO ] Implicit Places using invariants in 2102 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:50] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-23 02:29:51] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:51] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-23 02:29:54] [INFO ] Dead Transitions using invariants and state equation in 3207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7248 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 341 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 58072 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58072 steps, saw 29041 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:29:59] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-23 02:29:59] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:30:24] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2403 place count 4098 transition count 3796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2404 place count 4097 transition count 3796
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2404 place count 4097 transition count 3596
Deduced a syphon composed of 200 places in 184 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2804 place count 3897 transition count 3596
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 62 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 51 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 5006 place count 2796 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5007 place count 2796 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5008 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 4 with 398 rules applied. Total rules applied 5406 place count 2795 transition count 2293
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 4 with 398 rules applied. Total rules applied 5804 place count 2397 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 5 with 399 rules applied. Total rules applied 6203 place count 2397 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6204 place count 2396 transition count 2292
Applied a total of 6204 rules in 2159 ms. Remains 2396 /5300 variables (removed 2904) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2160 ms. Remains : 2396/5300 places, 2292/4998 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 124512 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124512 steps, saw 62306 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:30:29] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:30:30] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:30:55] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 232 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2292/2292 transitions.
Applied a total of 0 rules in 222 ms. Remains 2396 /2396 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:30:55] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:31:18] [INFO ] Implicit Places using invariants in 22537 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:31:18] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:31:41] [INFO ] Implicit Places using invariants and state equation in 23103 ms returned []
Implicit Place search using SMT with State Equation took 45643 ms to find 0 implicit places.
[2024-05-23 02:31:41] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2292 rows 2396 cols
[2024-05-23 02:31:41] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:31:42] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47432 ms. Remains : 2396/2396 places, 2292/2292 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3299 reset in 233 ms.
Product exploration explored 100000 steps with 3333 reset in 246 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1198 place count 5300 transition count 5198
Deduced a syphon composed of 1399 places in 236 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1399 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1401 place count 5298 transition count 5196
Deduced a syphon composed of 1397 places in 238 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1403 place count 5298 transition count 5196
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: -199
Deduced a syphon composed of 2298 places in 152 ms
Iterating global reduction 1 with 901 rules applied. Total rules applied 2304 place count 5298 transition count 5395
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5394
Deduced a syphon composed of 2297 places in 159 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5394
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2398 places in 141 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6058
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5856
Deduced a syphon composed of 2297 places in 135 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5856
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -624
Deduced a syphon composed of 2395 places in 143 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2707 place count 5196 transition count 6480
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 2805 place count 5098 transition count 6284
Deduced a syphon composed of 2297 places in 135 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 2903 place count 5098 transition count 6284
Deduced a syphon composed of 2297 places in 134 ms
Applied a total of 2903 rules in 4975 ms. Remains 5098 /5300 variables (removed 202) and now considering 6284/4998 (removed -1286) transitions.
[2024-05-23 02:31:49] [INFO ] Redundant transitions in 377 ms returned []
// Phase 1: matrix 6284 rows 5098 cols
[2024-05-23 02:31:49] [INFO ] Invariants computation overflowed in 128 ms
[2024-05-23 02:31:53] [INFO ] Dead Transitions using invariants and state equation in 3889 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5098/5300 places, 6284/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9253 ms. Remains : 5098/5300 places, 6284/4998 transitions.
Built C files in :
/tmp/ltsmin4221147568522882402
[2024-05-23 02:31:53] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4221147568522882402
Running compilation step : cd /tmp/ltsmin4221147568522882402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4221147568522882402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4221147568522882402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1010 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:31:57] [INFO ] Invariants computation overflowed in 103 ms
[2024-05-23 02:31:59] [INFO ] Implicit Places using invariants in 2140 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:31:59] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:32:00] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 3116 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:32:00] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-23 02:32:03] [INFO ] Dead Transitions using invariants and state equation in 2993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7120 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Built C files in :
/tmp/ltsmin4843030423353177355
[2024-05-23 02:32:03] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4843030423353177355
Running compilation step : cd /tmp/ltsmin4843030423353177355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4843030423353177355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4843030423353177355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:32:07] [INFO ] Flatten gal took : 123 ms
[2024-05-23 02:32:07] [INFO ] Flatten gal took : 115 ms
[2024-05-23 02:32:07] [INFO ] Time to serialize gal into /tmp/LTL18134648220084620204.gal : 17 ms
[2024-05-23 02:32:07] [INFO ] Time to serialize properties into /tmp/LTL14727150155261597913.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18134648220084620204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18282826887276669691.hoa' '-atoms' '/tmp/LTL14727150155261597913.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14727150155261597913.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18282826887276669691.hoa
Detected timeout of ITS tools.
[2024-05-23 02:32:23] [INFO ] Flatten gal took : 106 ms
[2024-05-23 02:32:23] [INFO ] Flatten gal took : 110 ms
[2024-05-23 02:32:23] [INFO ] Time to serialize gal into /tmp/LTL6493901229650769731.gal : 16 ms
[2024-05-23 02:32:23] [INFO ] Time to serialize properties into /tmp/LTL15530513822102600636.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6493901229650769731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15530513822102600636.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p4263<=p2634)")))))
Formula 0 simplified : XXF!"(p4263<=p2634)"
Detected timeout of ITS tools.
[2024-05-23 02:32:38] [INFO ] Flatten gal took : 111 ms
[2024-05-23 02:32:38] [INFO ] Applying decomposition
[2024-05-23 02:32:38] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6677130119970262538.txt' '-o' '/tmp/graph6677130119970262538.bin' '-w' '/tmp/graph6677130119970262538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6677130119970262538.bin' '-l' '-1' '-v' '-w' '/tmp/graph6677130119970262538.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:32:38] [INFO ] Decomposing Gal with order
[2024-05-23 02:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:32:40] [INFO ] Removed a total of 1418 redundant transitions.
[2024-05-23 02:32:40] [INFO ] Flatten gal took : 199 ms
[2024-05-23 02:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 87 ms.
[2024-05-23 02:32:41] [INFO ] Time to serialize gal into /tmp/LTL11368862546213906717.gal : 48 ms
[2024-05-23 02:32:41] [INFO ] Time to serialize properties into /tmp/LTL16647009570989390147.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11368862546213906717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16647009570989390147.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(gu773.p4263<=gu773.p2634)")))))
Formula 0 simplified : XXF!"(gu773.p4263<=gu773.p2634)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12213050783374441537
[2024-05-23 02:32:56] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12213050783374441537
Running compilation step : cd /tmp/ltsmin12213050783374441537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12213050783374441537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12213050783374441537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-11 finished in 308715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2399 place count 4100 transition count 3797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4099 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2400 place count 4099 transition count 3597
Deduced a syphon composed of 200 places in 177 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2800 place count 3899 transition count 3597
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 66 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 51 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 47 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4994 place count 2802 transition count 2697
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4995 place count 2802 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Applied a total of 4996 rules in 1580 ms. Remains 2801 /5300 variables (removed 2499) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:33:01] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:33:02] [INFO ] Implicit Places using invariants in 1319 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:33:02] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:33:04] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
[2024-05-23 02:33:04] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:33:04] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:33:05] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2801/5300 places, 2696/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6364 ms. Remains : 2801/5300 places, 2696/4998 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-14 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:(LEQ s1768 s1443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13847 reset in 171 ms.
Product exploration explored 100000 steps with 13870 reset in 181 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1374 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102087 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102087 steps, saw 51062 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:33:09] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:33:09] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:33:34] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Graph (complete) has 8473 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2799 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2799 transition count 2693
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2798 transition count 2693
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 2797 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2797 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2400 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2400 transition count 2295
Applied a total of 1200 rules in 907 ms. Remains 2400 /2801 variables (removed 401) and now considering 2295/2696 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 908 ms. Remains : 2400/2801 places, 2295/2696 transitions.
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125834 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125834 steps, saw 62954 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:33:39] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:33:39] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:34:04] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2295/2295 transitions.
Applied a total of 0 rules in 228 ms. Remains 2400 /2400 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 2400/2400 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2295/2295 transitions.
Applied a total of 0 rules in 215 ms. Remains 2400 /2400 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:34:04] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:34:26] [INFO ] Implicit Places using invariants in 21896 ms returned []
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:34:26] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:34:49] [INFO ] Implicit Places using invariants and state equation in 22693 ms returned []
Implicit Place search using SMT with State Equation took 44592 ms to find 0 implicit places.
[2024-05-23 02:34:49] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:34:49] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:34:50] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46369 ms. Remains : 2400/2400 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Applied a total of 0 rules in 165 ms. Remains 2801 /2801 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:34:51] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:34:52] [INFO ] Implicit Places using invariants in 1298 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:34:52] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:34:54] [INFO ] Implicit Places using invariants and state equation in 2244 ms returned []
Implicit Place search using SMT with State Equation took 3543 ms to find 0 implicit places.
[2024-05-23 02:34:54] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:34:55] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:34:56] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4978 ms. Remains : 2801/2801 places, 2696/2696 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1374 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 795 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102087 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102087 steps, saw 51062 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:34:59] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:34:59] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:35:24] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Graph (complete) has 8473 edges and 2801 vertex of which 2799 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2799 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2799 transition count 2693
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2798 transition count 2693
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 2797 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2797 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2400 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2400 transition count 2295
Applied a total of 1200 rules in 876 ms. Remains 2400 /2801 variables (removed 401) and now considering 2295/2696 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 ms. Remains : 2400/2801 places, 2295/2696 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125766 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125766 steps, saw 62921 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:35:28] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:35:29] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:35:54] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2295/2295 transitions.
Applied a total of 0 rules in 235 ms. Remains 2400 /2400 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 2400/2400 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2295/2295 transitions.
Applied a total of 0 rules in 220 ms. Remains 2400 /2400 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:35:54] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:36:16] [INFO ] Implicit Places using invariants in 21914 ms returned []
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:36:16] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-23 02:36:39] [INFO ] Implicit Places using invariants and state equation in 22851 ms returned []
Implicit Place search using SMT with State Equation took 44773 ms to find 0 implicit places.
[2024-05-23 02:36:39] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-23 02:36:39] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:36:40] [INFO ] Dead Transitions using invariants and state equation in 1447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46542 ms. Remains : 2400/2400 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13830 reset in 175 ms.
Product exploration explored 100000 steps with 13846 reset in 178 ms.
Built C files in :
/tmp/ltsmin16746915417266374408
[2024-05-23 02:36:41] [INFO ] Too many transitions (2696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:36:41] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16746915417266374408
Running compilation step : cd /tmp/ltsmin16746915417266374408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16746915417266374408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16746915417266374408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2801/2801 places, 2696/2696 transitions.
Applied a total of 0 rules in 168 ms. Remains 2801 /2801 variables (removed 0) and now considering 2696/2696 (removed 0) transitions.
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:36:44] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:36:46] [INFO ] Implicit Places using invariants in 1284 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:36:46] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-23 02:36:48] [INFO ] Implicit Places using invariants and state equation in 2225 ms returned []
Implicit Place search using SMT with State Equation took 3511 ms to find 0 implicit places.
[2024-05-23 02:36:48] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2696 rows 2801 cols
[2024-05-23 02:36:48] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:36:49] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4930 ms. Remains : 2801/2801 places, 2696/2696 transitions.
Built C files in :
/tmp/ltsmin10528921995671950433
[2024-05-23 02:36:49] [INFO ] Too many transitions (2696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:36:49] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10528921995671950433
Running compilation step : cd /tmp/ltsmin10528921995671950433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10528921995671950433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10528921995671950433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:36:52] [INFO ] Flatten gal took : 68 ms
[2024-05-23 02:36:52] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:36:52] [INFO ] Time to serialize gal into /tmp/LTL14192481265232820660.gal : 11 ms
[2024-05-23 02:36:52] [INFO ] Time to serialize properties into /tmp/LTL11914864767912017022.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14192481265232820660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10954029414298952050.hoa' '-atoms' '/tmp/LTL11914864767912017022.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11914864767912017022.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10954029414298952050.hoa
Detected timeout of ITS tools.
[2024-05-23 02:37:08] [INFO ] Flatten gal took : 67 ms
[2024-05-23 02:37:08] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:37:08] [INFO ] Time to serialize gal into /tmp/LTL16970003034260859080.gal : 11 ms
[2024-05-23 02:37:08] [INFO ] Time to serialize properties into /tmp/LTL9385927421987650598.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16970003034260859080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9385927421987650598.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p4012<=p3459)"))))
Formula 0 simplified : FG!"(p4012<=p3459)"
Detected timeout of ITS tools.
[2024-05-23 02:37:23] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:37:23] [INFO ] Applying decomposition
[2024-05-23 02:37:23] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14993616323958843027.txt' '-o' '/tmp/graph14993616323958843027.bin' '-w' '/tmp/graph14993616323958843027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14993616323958843027.bin' '-l' '-1' '-v' '-w' '/tmp/graph14993616323958843027.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:37:23] [INFO ] Decomposing Gal with order
[2024-05-23 02:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:37:23] [INFO ] Removed a total of 2085 redundant transitions.
[2024-05-23 02:37:24] [INFO ] Flatten gal took : 127 ms
[2024-05-23 02:37:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 47 ms.
[2024-05-23 02:37:24] [INFO ] Time to serialize gal into /tmp/LTL14084052525921738424.gal : 22 ms
[2024-05-23 02:37:24] [INFO ] Time to serialize properties into /tmp/LTL4994843464349504066.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14084052525921738424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4994843464349504066.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu517.p4012<=gu517.p3459)"))))
Formula 0 simplified : FG!"(gu517.p4012<=gu517.p3459)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3400318531155731089
[2024-05-23 02:37:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3400318531155731089
Running compilation step : cd /tmp/ltsmin3400318531155731089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3400318531155731089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3400318531155731089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-14 finished in 282976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p0))) U (p1 U p2)))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 974 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:37:43] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:37:45] [INFO ] Implicit Places using invariants in 2106 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:37:45] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-23 02:37:46] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-23 02:37:46] [INFO ] Invariants computation overflowed in 94 ms
[2024-05-23 02:37:49] [INFO ] Dead Transitions using invariants and state equation in 3159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7174 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s458), p1:(LEQ s844 s679), p0:(LEQ s2728 s4596)], 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 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLCardinality-15 finished in 7808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Found a Shortening insensitive property : DoubleExponent-PT-100-LTLCardinality-00
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2391 place count 4105 transition count 3800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3599
Deduced a syphon composed of 201 places in 181 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 66 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 59 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 59 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 4992 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2804 transition count 2700
Applied a total of 4993 rules in 1684 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:37:52] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:37:53] [INFO ] Implicit Places using invariants in 1304 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:37:53] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:37:55] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 3496 ms to find 0 implicit places.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:37:55] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:37:56] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6343 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT 3 s2033) (GT s439 s1542)), p1:(GT 1 s696)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13835 reset in 175 ms.
Product exploration explored 100000 steps with 13878 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1358 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 803 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102145 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102145 steps, saw 51091 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:38:00] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:38:19] [INFO ] After 18765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 51 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 870 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 870 ms. Remains : 2398/2804 places, 2294/2700 transitions.
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 866 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125415 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125415 steps, saw 62750 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:38:23] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:38:39] [INFO ] After 15684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 225 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 226 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:38:39] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:39:01] [INFO ] Implicit Places using invariants in 21617 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:39:01] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:39:23] [INFO ] Implicit Places using invariants and state equation in 22552 ms returned []
Implicit Place search using SMT with State Equation took 44173 ms to find 0 implicit places.
[2024-05-23 02:39:23] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:39:23] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:39:25] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46033 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2398 transition count 2094
Deduced a syphon composed of 200 places in 86 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2198 transition count 2094
Applied a total of 400 rules in 358 ms. Remains 2198 /2398 variables (removed 200) and now considering 2094/2294 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2198 cols
[2024-05-23 02:39:25] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:39:43] [INFO ] After 17522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 1 out of 2804 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 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 174 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:39:43] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:39:45] [INFO ] Implicit Places using invariants in 1301 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:39:45] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:39:47] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 3565 ms to find 0 implicit places.
[2024-05-23 02:39:47] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:39:47] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:39:48] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4993 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1384 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101812 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101812 steps, saw 50920 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-23 02:39:52] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:40:10] [INFO ] After 18795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 866 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 866 ms. Remains : 2398/2804 places, 2294/2700 transitions.
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125608 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125608 steps, saw 62846 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:40:14] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:40:31] [INFO ] After 16166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 221 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 216 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:40:31] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:40:53] [INFO ] Implicit Places using invariants in 21987 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:40:53] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:41:15] [INFO ] Implicit Places using invariants and state equation in 22421 ms returned []
Implicit Place search using SMT with State Equation took 44415 ms to find 0 implicit places.
[2024-05-23 02:41:16] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-23 02:41:16] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:41:17] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46188 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 2398 transition count 2094
Deduced a syphon composed of 200 places in 94 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2198 transition count 2094
Applied a total of 400 rules in 363 ms. Remains 2198 /2398 variables (removed 200) and now considering 2094/2294 (removed 200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2198 cols
[2024-05-23 02:41:17] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:41:35] [INFO ] After 17697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13915 reset in 175 ms.
Product exploration explored 100000 steps with 13853 reset in 178 ms.
Built C files in :
/tmp/ltsmin16986924186746278991
[2024-05-23 02:41:36] [INFO ] Too many transitions (2700) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:41:36] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16986924186746278991
Running compilation step : cd /tmp/ltsmin16986924186746278991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16986924186746278991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16986924186746278991;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2804 transition count 2696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2800 transition count 2696
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2799 transition count 2695
Applied a total of 10 rules in 342 ms. Remains 2799 /2804 variables (removed 5) and now considering 2695/2700 (removed 5) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:41:39] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:41:41] [INFO ] Implicit Places using invariants in 1327 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:41:41] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-23 02:41:43] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 3602 ms to find 0 implicit places.
[2024-05-23 02:41:43] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2024-05-23 02:41:43] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-23 02:41:44] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2804 places, 2695/2700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5247 ms. Remains : 2799/2804 places, 2695/2700 transitions.
Built C files in :
/tmp/ltsmin2234314454902542519
[2024-05-23 02:41:44] [INFO ] Too many transitions (2695) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:41:44] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2234314454902542519
Running compilation step : cd /tmp/ltsmin2234314454902542519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2234314454902542519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2234314454902542519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:41:47] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:41:48] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:41:48] [INFO ] Time to serialize gal into /tmp/LTL14559024610427449873.gal : 11 ms
[2024-05-23 02:41:48] [INFO ] Time to serialize properties into /tmp/LTL15450650940492268475.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14559024610427449873.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16393681341788378388.hoa' '-atoms' '/tmp/LTL15450650940492268475.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15450650940492268475.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16393681341788378388.hoa
Detected timeout of ITS tools.
[2024-05-23 02:42:03] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:42:03] [INFO ] Flatten gal took : 71 ms
[2024-05-23 02:42:03] [INFO ] Time to serialize gal into /tmp/LTL10187195347688500207.gal : 11 ms
[2024-05-23 02:42:03] [INFO ] Time to serialize properties into /tmp/LTL2417343567582658212.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10187195347688500207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2417343567582658212.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("(p2178<1)")))&&("((p4456<3)||(p1740>p362))")))))
Formula 0 simplified : X(GF!"(p2178<1)" | G!"((p4456<3)||(p1740>p362))")
Detected timeout of ITS tools.
[2024-05-23 02:42:18] [INFO ] Flatten gal took : 68 ms
[2024-05-23 02:42:18] [INFO ] Applying decomposition
[2024-05-23 02:42:18] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7244094858605570825.txt' '-o' '/tmp/graph7244094858605570825.bin' '-w' '/tmp/graph7244094858605570825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7244094858605570825.bin' '-l' '-1' '-v' '-w' '/tmp/graph7244094858605570825.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:42:18] [INFO ] Decomposing Gal with order
[2024-05-23 02:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:42:19] [INFO ] Removed a total of 2124 redundant transitions.
[2024-05-23 02:42:19] [INFO ] Flatten gal took : 127 ms
[2024-05-23 02:42:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 41 ms.
[2024-05-23 02:42:19] [INFO ] Time to serialize gal into /tmp/LTL3808831529503901231.gal : 23 ms
[2024-05-23 02:42:19] [INFO ] Time to serialize properties into /tmp/LTL3245486711777394093.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3808831529503901231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3245486711777394093.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((F(G("(gi2.gi1.gu255.p2178<1)")))&&("((gi5.gi0.gi2.gi2.gu752.p4456<3)||(gu162.p1740>gu162.p362))")))))
Formula 0 simplified : X(GF!"(gi2.gi1.gu255.p2178<1)" | G!"((gi5.gi0.gi2.gi2.gu752.p4456<3)||(gu162.p1740>gu162.p362))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5075922405681654959
[2024-05-23 02:42:34] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5075922405681654959
Running compilation step : cd /tmp/ltsmin5075922405681654959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5075922405681654959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5075922405681654959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-00 finished in 287285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(G(p1))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLCardinality-02
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2393 place count 4104 transition count 3799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 179 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 66 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 52 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 48 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2695
Applied a total of 4997 rules in 1424 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:42:39] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-23 02:42:40] [INFO ] Implicit Places using invariants in 1322 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:42:40] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:42:42] [INFO ] Implicit Places using invariants and state equation in 2195 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:42:42] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:42:43] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6134 ms. Remains : 2800/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s2566 s1478), p0:(AND (GT 1 s307) (LEQ s2566 s1478))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34055 reset in 1506 ms.
Product exploration explored 100000 steps with 34109 reset in 1522 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 92767 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{1=1}
Probabilistic random walk after 92767 steps, saw 46393 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:42:50] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:42:50] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-23 02:43:01] [INFO ] After 10397ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 2797 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 2797 transition count 2691
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2399 transition count 2294
Applied a total of 1200 rules in 714 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 714 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125834 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125834 steps, saw 62954 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:43:05] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-23 02:43:05] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:43:18] [INFO ] After 12824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 233 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 219 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:43:18] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:43:40] [INFO ] Implicit Places using invariants in 21924 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:43:40] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-23 02:44:03] [INFO ] Implicit Places using invariants and state equation in 23179 ms returned []
Implicit Place search using SMT with State Equation took 45106 ms to find 0 implicit places.
[2024-05-23 02:44:03] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:44:03] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:44:05] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46906 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 199 places in 86 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2200 transition count 2095
Applied a total of 398 rules in 361 ms. Remains 2200 /2399 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2200 cols
[2024-05-23 02:44:05] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:44:06] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:44:41] [INFO ] After 35879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Support contains 2 out of 2800 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 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 173 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:44:42] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:44:43] [INFO ] Implicit Places using invariants in 1332 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:44:43] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:44:45] [INFO ] Implicit Places using invariants and state equation in 2152 ms returned []
Implicit Place search using SMT with State Equation took 3484 ms to find 0 implicit places.
[2024-05-23 02:44:46] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:44:46] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-23 02:44:47] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4932 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102164 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102164 steps, saw 51098 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:44:50] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-23 02:44:50] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:45:01] [INFO ] After 10460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8475 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 4 place count 2798 transition count 2692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 2797 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 2797 transition count 2691
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1200 place count 2399 transition count 2294
Applied a total of 1200 rules in 720 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125568 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125568 steps, saw 62826 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:45:05] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:45:05] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:45:18] [INFO ] After 12725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 227 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 217 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:45:18] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-23 02:45:40] [INFO ] Implicit Places using invariants in 21848 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:45:40] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-23 02:46:03] [INFO ] Implicit Places using invariants and state equation in 22833 ms returned []
Implicit Place search using SMT with State Equation took 44687 ms to find 0 implicit places.
[2024-05-23 02:46:03] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:46:03] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:46:04] [INFO ] Dead Transitions using invariants and state equation in 1449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46459 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2399 transition count 2095
Deduced a syphon composed of 199 places in 92 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2200 transition count 2095
Applied a total of 398 rules in 376 ms. Remains 2200 /2399 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2200 cols
[2024-05-23 02:46:05] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-23 02:46:05] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:46:41] [INFO ] After 35732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13920 reset in 182 ms.
Product exploration explored 100000 steps with 13898 reset in 183 ms.
Built C files in :
/tmp/ltsmin300526759823653891
[2024-05-23 02:46:42] [INFO ] Too many transitions (2695) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:46:42] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin300526759823653891
Running compilation step : cd /tmp/ltsmin300526759823653891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin300526759823653891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin300526759823653891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2695/2695 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 2800 transition count 2694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2799 transition count 2694
Applied a total of 2 rules in 185 ms. Remains 2799 /2800 variables (removed 1) and now considering 2694/2695 (removed 1) transitions.
// Phase 1: matrix 2694 rows 2799 cols
[2024-05-23 02:46:45] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-23 02:46:46] [INFO ] Implicit Places using invariants in 1318 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2024-05-23 02:46:46] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:46:48] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
[2024-05-23 02:46:48] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2694 rows 2799 cols
[2024-05-23 02:46:49] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:46:50] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2799/2800 places, 2694/2695 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5036 ms. Remains : 2799/2800 places, 2694/2695 transitions.
Built C files in :
/tmp/ltsmin9274598481928072108
[2024-05-23 02:46:50] [INFO ] Too many transitions (2694) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:46:50] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9274598481928072108
Running compilation step : cd /tmp/ltsmin9274598481928072108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9274598481928072108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9274598481928072108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:46:53] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:46:53] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:46:53] [INFO ] Time to serialize gal into /tmp/LTL807129015759805440.gal : 11 ms
[2024-05-23 02:46:53] [INFO ] Time to serialize properties into /tmp/LTL4427829230904242811.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL807129015759805440.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7481162393785081606.hoa' '-atoms' '/tmp/LTL4427829230904242811.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL4427829230904242811.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7481162393785081606.hoa
Detected timeout of ITS tools.
[2024-05-23 02:47:08] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:47:08] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:47:08] [INFO ] Time to serialize gal into /tmp/LTL16664740519877818027.gal : 11 ms
[2024-05-23 02:47:08] [INFO ] Time to serialize properties into /tmp/LTL4721335634613501099.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16664740519877818027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4721335634613501099.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(!("((p152<1)&&(p591<=p3520))")))U(X(G("(p591<=p3520)")))))
Formula 0 simplified : G"((p152<1)&&(p591<=p3520))" R XF!"(p591<=p3520)"
Detected timeout of ITS tools.
[2024-05-23 02:47:23] [INFO ] Flatten gal took : 68 ms
[2024-05-23 02:47:23] [INFO ] Applying decomposition
[2024-05-23 02:47:23] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18063599812830827036.txt' '-o' '/tmp/graph18063599812830827036.bin' '-w' '/tmp/graph18063599812830827036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18063599812830827036.bin' '-l' '-1' '-v' '-w' '/tmp/graph18063599812830827036.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:47:24] [INFO ] Decomposing Gal with order
[2024-05-23 02:47:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:47:24] [INFO ] Removed a total of 2363 redundant transitions.
[2024-05-23 02:47:24] [INFO ] Flatten gal took : 130 ms
[2024-05-23 02:47:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 44 ms.
[2024-05-23 02:47:24] [INFO ] Time to serialize gal into /tmp/LTL16402725706044439014.gal : 23 ms
[2024-05-23 02:47:24] [INFO ] Time to serialize properties into /tmp/LTL17701460822868490564.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16402725706044439014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17701460822868490564.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(!("((gi0.gi1.gi1.gi0.gi2.gu142.p152<1)&&(gu604.p591<=gu604.p3520))")))U(X(G("(gu604.p591<=gu604.p3520)")))))
Formula 0 simplified : G"((gi0.gi1.gi1.gi0.gi2.gu142.p152<1)&&(gu604.p591<=gu604.p3520))" R XF!"(gu604.p591<=gu604.p3520)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8424964553314430936
[2024-05-23 02:47:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8424964553314430936
Running compilation step : cd /tmp/ltsmin8424964553314430936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8424964553314430936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8424964553314430936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-02 finished in 305488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(F(p0)))&&(p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLCardinality-11
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2397 place count 4101 transition count 3798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 180 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 69 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 51 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 48 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4996 place count 2801 transition count 2696
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4997 place count 2801 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4998 place count 2800 transition count 2695
Applied a total of 4998 rules in 1577 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:47:45] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:47:46] [INFO ] Implicit Places using invariants in 1311 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:47:46] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:47:48] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:47:48] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:47:49] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2800/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6271 ms. Remains : 2800/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s1915 s958)], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13911 reset in 172 ms.
Product exploration explored 100000 steps with 13842 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1389 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102013 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 102013 steps, saw 51012 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:47:53] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:47:53] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:48:18] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8477 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2692
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 2797 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 1199 place count 2399 transition count 2294
Applied a total of 1199 rules in 911 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125933 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125933 steps, saw 63022 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:48:22] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-23 02:48:23] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:48:48] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 228 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 217 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:48:48] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:49:10] [INFO ] Implicit Places using invariants in 21984 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:49:10] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:49:33] [INFO ] Implicit Places using invariants and state equation in 22862 ms returned []
Implicit Place search using SMT with State Equation took 44852 ms to find 0 implicit places.
[2024-05-23 02:49:33] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:49:33] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:49:34] [INFO ] Dead Transitions using invariants and state equation in 1475 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46644 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 155 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:49:35] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-23 02:49:36] [INFO ] Implicit Places using invariants in 1364 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:49:36] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-23 02:49:39] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 3618 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:49:39] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:49:40] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4980 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8875 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1389 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101669 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101669 steps, saw 50846 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:49:43] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-23 02:49:44] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:50:09] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Graph (complete) has 8477 edges and 2800 vertex of which 2798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2798 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2798 transition count 2692
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2797 transition count 2692
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 2797 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 2796 transition count 2691
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 404 place count 2796 transition count 2294
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 801 place count 2399 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 3 with 398 rules applied. Total rules applied 1199 place count 2399 transition count 2294
Applied a total of 1199 rules in 888 ms. Remains 2399 /2800 variables (removed 401) and now considering 2294/2695 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 888 ms. Remains : 2399/2800 places, 2294/2695 transitions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125996 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125996 steps, saw 63057 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:50:13] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-23 02:50:13] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:50:38] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 221 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2294/2294 transitions.
Applied a total of 0 rules in 219 ms. Remains 2399 /2399 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:50:38] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:51:01] [INFO ] Implicit Places using invariants in 22733 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:51:01] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-23 02:51:24] [INFO ] Implicit Places using invariants and state equation in 22892 ms returned []
Implicit Place search using SMT with State Equation took 45627 ms to find 0 implicit places.
[2024-05-23 02:51:24] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 2294 rows 2399 cols
[2024-05-23 02:51:24] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-23 02:51:26] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47396 ms. Remains : 2399/2399 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13880 reset in 177 ms.
Product exploration explored 100000 steps with 13948 reset in 179 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 175 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2024-05-23 02:51:27] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:51:27] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:51:28] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1435 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Built C files in :
/tmp/ltsmin1043658448593276618
[2024-05-23 02:51:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1043658448593276618
Running compilation step : cd /tmp/ltsmin1043658448593276618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1043658448593276618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1043658448593276618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2800/2800 places, 2695/2695 transitions.
Applied a total of 0 rules in 150 ms. Remains 2800 /2800 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:51:31] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-23 02:51:33] [INFO ] Implicit Places using invariants in 1316 ms returned []
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:51:33] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-23 02:51:35] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 3553 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2800 cols
[2024-05-23 02:51:35] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-23 02:51:36] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4896 ms. Remains : 2800/2800 places, 2695/2695 transitions.
Built C files in :
/tmp/ltsmin7798570317587175258
[2024-05-23 02:51:36] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7798570317587175258
Running compilation step : cd /tmp/ltsmin7798570317587175258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7798570317587175258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7798570317587175258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 02:51:39] [INFO ] Flatten gal took : 69 ms
[2024-05-23 02:51:39] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:51:39] [INFO ] Time to serialize gal into /tmp/LTL4427119933475830528.gal : 11 ms
[2024-05-23 02:51:39] [INFO ] Time to serialize properties into /tmp/LTL1774716895688258668.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4427119933475830528.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6057687593978954533.hoa' '-atoms' '/tmp/LTL1774716895688258668.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1774716895688258668.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6057687593978954533.hoa
Detected timeout of ITS tools.
[2024-05-23 02:51:55] [INFO ] Flatten gal took : 70 ms
[2024-05-23 02:51:55] [INFO ] Flatten gal took : 74 ms
[2024-05-23 02:51:55] [INFO ] Time to serialize gal into /tmp/LTL17258276187496956494.gal : 12 ms
[2024-05-23 02:51:55] [INFO ] Time to serialize properties into /tmp/LTL1622684470912658203.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17258276187496956494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1622684470912658203.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p4263<=p2634)")))))
Formula 0 simplified : XXF!"(p4263<=p2634)"
Detected timeout of ITS tools.
[2024-05-23 02:52:10] [INFO ] Flatten gal took : 72 ms
[2024-05-23 02:52:10] [INFO ] Applying decomposition
[2024-05-23 02:52:10] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph831147958535415597.txt' '-o' '/tmp/graph831147958535415597.bin' '-w' '/tmp/graph831147958535415597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph831147958535415597.bin' '-l' '-1' '-v' '-w' '/tmp/graph831147958535415597.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:52:10] [INFO ] Decomposing Gal with order
[2024-05-23 02:52:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:52:10] [INFO ] Removed a total of 2285 redundant transitions.
[2024-05-23 02:52:10] [INFO ] Flatten gal took : 135 ms
[2024-05-23 02:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 67 ms.
[2024-05-23 02:52:11] [INFO ] Time to serialize gal into /tmp/LTL827933558597172242.gal : 26 ms
[2024-05-23 02:52:11] [INFO ] Time to serialize properties into /tmp/LTL661965479839879694.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL827933558597172242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL661965479839879694.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(gu774.p4263<=gu774.p2634)")))))
Formula 0 simplified : XXF!"(gu774.p4263<=gu774.p2634)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17127557169041347746
[2024-05-23 02:52:26] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17127557169041347746
Running compilation step : cd /tmp/ltsmin17127557169041347746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17127557169041347746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17127557169041347746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-100-LTLCardinality-11 finished in 286270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-23 02:52:29] [INFO ] Flatten gal took : 110 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15740872275345386909
[2024-05-23 02:52:29] [INFO ] Too many transitions (4998) to apply POR reductions. Disabling POR matrices.
[2024-05-23 02:52:29] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15740872275345386909
Running compilation step : cd /tmp/ltsmin15740872275345386909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 02:52:29] [INFO ] Applying decomposition
[2024-05-23 02:52:29] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7208962396721810616.txt' '-o' '/tmp/graph7208962396721810616.bin' '-w' '/tmp/graph7208962396721810616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7208962396721810616.bin' '-l' '-1' '-v' '-w' '/tmp/graph7208962396721810616.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:52:30] [INFO ] Decomposing Gal with order
[2024-05-23 02:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:52:31] [INFO ] Removed a total of 1427 redundant transitions.
[2024-05-23 02:52:31] [INFO ] Flatten gal took : 203 ms
[2024-05-23 02:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 107 ms.
[2024-05-23 02:52:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality17605638541163526892.gal : 45 ms
[2024-05-23 02:52:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality9797198590463356021.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17605638541163526892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9797198590463356021.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 6 LTL properties
Checking formula 0 : !((X(F(("((gi6.gi0.gi2.gi1.gi0.gi1.gi6.gu1645.p4456<3)||(gu356.p1740>gu356.p362))")&&(F(G("(gi7.gi0.gi3.gi2.gi0.gi0.gi5.gu566.p2178<1)...163
Formula 0 simplified : X(GF!"(gi7.gi0.gi3.gi2.gi0.gi0.gi5.gu566.p2178<1)" | G!"((gi6.gi0.gi2.gi1.gi0.gi1.gi6.gu1645.p4456<3)||(gu356.p1740>gu356.p362))")
Compilation finished in 17433 ms.
Running link step : cd /tmp/ltsmin15740872275345386909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin15740872275345386909;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7475080 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16031008 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151600357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;