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.r417-tall-171690556700543.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 Szymanski-PT-b04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556700543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717169146918

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 15:25:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 15:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 15:25:48] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-05-31 15:25:48] [INFO ] Transformed 568 places.
[2024-05-31 15:25:48] [INFO ] Transformed 8320 transitions.
[2024-05-31 15:25:48] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 577 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 123 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:25:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:25:49] [INFO ] Computed 1 invariants in 70 ms
[2024-05-31 15:25:49] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-31 15:25:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:25:49] [INFO ] Invariant cache hit.
[2024-05-31 15:25:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:53] [INFO ] Implicit Places using invariants and state equation in 4012 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
[2024-05-31 15:25:53] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:25:53] [INFO ] Invariant cache hit.
[2024-05-31 15:25:55] [INFO ] Dead Transitions using invariants and state equation in 2011 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6736 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 54 out of 306 places after structural reductions.
[2024-05-31 15:25:56] [INFO ] Flatten gal took : 382 ms
[2024-05-31 15:25:56] [INFO ] Flatten gal took : 235 ms
[2024-05-31 15:25:57] [INFO ] Input system was already deterministic with 8064 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2024-05-31 15:25:57] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:25:57] [INFO ] Invariant cache hit.
[2024-05-31 15:25:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:25:58] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-05-31 15:25:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:26:15] [INFO ] After 17192ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :25
[2024-05-31 15:26:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:26:23] [INFO ] After 7471ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :24
[2024-05-31 15:26:23] [INFO ] After 7472ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :24
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 15:26:23] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :24
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 504 ms.
Support contains 44 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 306 transition count 8015
Applied a total of 49 rules in 371 ms. Remains 306 /306 variables (removed 0) and now considering 8015/8064 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 306/306 places, 8015/8064 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 128326 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{5=1, 9=1, 10=1, 14=1, 17=1}
Probabilistic random walk after 128326 steps, saw 50156 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :5
Running SMT prover for 18 properties.
[2024-05-31 15:26:27] [INFO ] Flow matrix only has 2684 transitions (discarded 5331 similar events)
// Phase 1: matrix 2684 rows 306 cols
[2024-05-31 15:26:27] [INFO ] Computed 1 invariants in 34 ms
[2024-05-31 15:26:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:26:27] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-31 15:26:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:26:43] [INFO ] After 15956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-31 15:26:43] [INFO ] State equation strengthened by 147 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.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:647)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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-31 15:26:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 15:26:52] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Parikh walk visited 0 properties in 421 ms.
Support contains 34 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8015/8015 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 306 transition count 8010
Applied a total of 5 rules in 220 ms. Remains 306 /306 variables (removed 0) and now considering 8010/8015 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 306/306 places, 8010/8015 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 142728 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142728 steps, saw 56101 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 17 properties.
[2024-05-31 15:26:56] [INFO ] Flow matrix only has 2679 transitions (discarded 5331 similar events)
// Phase 1: matrix 2679 rows 306 cols
[2024-05-31 15:26:56] [INFO ] Computed 1 invariants in 24 ms
[2024-05-31 15:26:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:26:56] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-31 15:26:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 15:27:07] [INFO ] After 10122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-31 15:27:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:27:21] [INFO ] After 14616ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-31 15:27:21] [INFO ] After 14617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 15:27:21] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 309 ms.
Support contains 32 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8010/8010 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 8009
Applied a total of 1 rules in 261 ms. Remains 306 /306 variables (removed 0) and now considering 8009/8010 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 306/306 places, 8009/8010 transitions.
Incomplete random walk after 10001 steps, including 7 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-31 15:27:22] [INFO ] Flow matrix only has 2678 transitions (discarded 5331 similar events)
// Phase 1: matrix 2678 rows 306 cols
[2024-05-31 15:27:22] [INFO ] Computed 1 invariants in 17 ms
[2024-05-31 15:27:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:27:23] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-31 15:27:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:27:33] [INFO ] After 9905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-31 15:27:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:27:48] [INFO ] After 14917ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2024-05-31 15:27:48] [INFO ] After 14919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 15:27:48] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 255 ms.
Support contains 28 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8009/8009 transitions.
Applied a total of 0 rules in 193 ms. Remains 306 /306 variables (removed 0) and now considering 8009/8009 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 306/306 places, 8009/8009 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA Szymanski-PT-b04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 2432 stable transitions
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((X(p0) U p1))&&(F(p2) U p2))) U p0))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 646 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:27:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:27:49] [INFO ] Computed 1 invariants in 23 ms
[2024-05-31 15:27:49] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-31 15:27:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:27:49] [INFO ] Invariant cache hit.
[2024-05-31 15:27:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:27:57] [INFO ] Implicit Places using invariants and state equation in 7501 ms returned []
Implicit Place search using SMT with State Equation took 7974 ms to find 0 implicit places.
[2024-05-31 15:27:58] [INFO ] Redundant transitions in 1147 ms returned []
[2024-05-31 15:27:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:27:58] [INFO ] Invariant cache hit.
[2024-05-31 15:28:00] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11664 ms. Remains : 305/306 places, 7936/8064 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 274 ms :[(NOT p0), (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s96 1) (GEQ s273 1)), p2:(AND (GEQ s16 1) (GEQ s296 1)), p1:(AND (GEQ s34 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 506 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-00 finished in 12526 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(((X(p0)&&(!p1 U (p2||G(!p1))))||G(p0)))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 69 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:28:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:01] [INFO ] Invariant cache hit.
[2024-05-31 15:28:01] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-31 15:28:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:01] [INFO ] Invariant cache hit.
[2024-05-31 15:28:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:28:09] [INFO ] Implicit Places using invariants and state equation in 7547 ms returned []
Implicit Place search using SMT with State Equation took 7961 ms to find 0 implicit places.
[2024-05-31 15:28:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:09] [INFO ] Invariant cache hit.
[2024-05-31 15:28:11] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9906 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s274 1))) (NOT (AND (GEQ s36 1) (GEQ s275 1)))), p1:(AND (GEQ s36 1) (GEQ s275 1)), p0:(AND (GEQ s125 1) (GEQ s288 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-01 finished in 10123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 214 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:28:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:11] [INFO ] Invariant cache hit.
[2024-05-31 15:28:11] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 15:28:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:11] [INFO ] Invariant cache hit.
[2024-05-31 15:28:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:28:19] [INFO ] Implicit Places using invariants and state equation in 7016 ms returned []
Implicit Place search using SMT with State Equation took 7415 ms to find 0 implicit places.
[2024-05-31 15:28:19] [INFO ] Redundant transitions in 843 ms returned []
[2024-05-31 15:28:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:19] [INFO ] Invariant cache hit.
[2024-05-31 15:28:21] [INFO ] Dead Transitions using invariants and state equation in 1901 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10384 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s104 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 5 reset in 445 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 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 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1316 steps, run visited all 1 properties in 33 ms. (steps per millisecond=39 )
Probabilistic random walk after 1316 steps, saw 1010 distinct states, run finished after 34 ms. (steps per millisecond=38 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:28:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:23] [INFO ] Invariant cache hit.
[2024-05-31 15:28:23] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-31 15:28:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:23] [INFO ] Invariant cache hit.
[2024-05-31 15:28:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:28:30] [INFO ] Implicit Places using invariants and state equation in 6461 ms returned []
Implicit Place search using SMT with State Equation took 6871 ms to find 0 implicit places.
[2024-05-31 15:28:30] [INFO ] Redundant transitions in 661 ms returned []
[2024-05-31 15:28:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:30] [INFO ] Invariant cache hit.
[2024-05-31 15:28:32] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9566 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 31 ms :[(NOT p0)]
Incomplete random walk after 10002 steps, including 2 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 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1316 steps, run visited all 1 properties in 23 ms. (steps per millisecond=57 )
Probabilistic random walk after 1316 steps, saw 1010 distinct states, run finished after 23 ms. (steps per millisecond=57 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 366 ms.
Product exploration explored 100000 steps with 2 reset in 371 ms.
Built C files in :
/tmp/ltsmin6128381482119712708
[2024-05-31 15:28:33] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:28:33] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6128381482119712708
Running compilation step : cd /tmp/ltsmin6128381482119712708;'/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/ltsmin6128381482119712708;'/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/ltsmin6128381482119712708;'/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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 207 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:28:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:37] [INFO ] Invariant cache hit.
[2024-05-31 15:28:37] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-31 15:28:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:37] [INFO ] Invariant cache hit.
[2024-05-31 15:28:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:28:45] [INFO ] Implicit Places using invariants and state equation in 7409 ms returned []
Implicit Place search using SMT with State Equation took 7849 ms to find 0 implicit places.
[2024-05-31 15:28:45] [INFO ] Redundant transitions in 845 ms returned []
[2024-05-31 15:28:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:28:45] [INFO ] Invariant cache hit.
[2024-05-31 15:28:47] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10745 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin13586078010818196832
[2024-05-31 15:28:47] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:28:47] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13586078010818196832
Running compilation step : cd /tmp/ltsmin13586078010818196832;'/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/ltsmin13586078010818196832;'/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/ltsmin13586078010818196832;'/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-31 15:28:51] [INFO ] Flatten gal took : 202 ms
[2024-05-31 15:28:51] [INFO ] Flatten gal took : 200 ms
[2024-05-31 15:28:51] [INFO ] Time to serialize gal into /tmp/LTL15844314944263692545.gal : 49 ms
[2024-05-31 15:28:51] [INFO ] Time to serialize properties into /tmp/LTL11011659337596397578.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/LTL15844314944263692545.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12178806813857942841.hoa' '-atoms' '/tmp/LTL11011659337596397578.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/LTL11011659337596397578.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12178806813857942841.hoa
Detected timeout of ITS tools.
[2024-05-31 15:29:07] [INFO ] Flatten gal took : 221 ms
[2024-05-31 15:29:07] [INFO ] Flatten gal took : 193 ms
[2024-05-31 15:29:07] [INFO ] Time to serialize gal into /tmp/LTL6750405339100491449.gal : 28 ms
[2024-05-31 15:29:07] [INFO ] Time to serialize properties into /tmp/LTL10852638060779061570.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/LTL6750405339100491449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10852638060779061570.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p104<1)||(l50<1))"))))
Formula 0 simplified : GF!"((p104<1)||(l50<1))"
Detected timeout of ITS tools.
[2024-05-31 15:29:22] [INFO ] Flatten gal took : 176 ms
[2024-05-31 15:29:22] [INFO ] Applying decomposition
[2024-05-31 15:29:22] [INFO ] Flatten gal took : 182 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/graph2804798110602141986.txt' '-o' '/tmp/graph2804798110602141986.bin' '-w' '/tmp/graph2804798110602141986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2804798110602141986.bin' '-l' '-1' '-v' '-w' '/tmp/graph2804798110602141986.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:29:23] [INFO ] Decomposing Gal with order
[2024-05-31 15:29:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:29:23] [INFO ] Removed a total of 17839 redundant transitions.
[2024-05-31 15:29:23] [INFO ] Flatten gal took : 648 ms
[2024-05-31 15:29:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1086 labels/synchronizations in 347 ms.
[2024-05-31 15:29:24] [INFO ] Time to serialize gal into /tmp/LTL857901018249670785.gal : 31 ms
[2024-05-31 15:29:24] [INFO ] Time to serialize properties into /tmp/LTL7802666719024552894.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/LTL857901018249670785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7802666719024552894.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.u54.p104<1)||(i0.u61.l50<1))"))))
Formula 0 simplified : GF!"((i4.u54.p104<1)||(i0.u61.l50<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13929755454953022719
[2024-05-31 15:29:39] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13929755454953022719
Running compilation step : cd /tmp/ltsmin13929755454953022719;'/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/ltsmin13929755454953022719;'/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/ltsmin13929755454953022719;'/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 Szymanski-PT-b04-LTLFireability-02 finished in 91236 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(F(p1)) U (G(p2) U !p1))&&p0)))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:29:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:29:42] [INFO ] Invariant cache hit.
[2024-05-31 15:29:43] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-31 15:29:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:29:43] [INFO ] Invariant cache hit.
[2024-05-31 15:29:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:29:50] [INFO ] Implicit Places using invariants and state equation in 7075 ms returned []
Implicit Place search using SMT with State Equation took 7539 ms to find 0 implicit places.
[2024-05-31 15:29:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:29:50] [INFO ] Invariant cache hit.
[2024-05-31 15:29:52] [INFO ] Dead Transitions using invariants and state equation in 1819 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9412 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p1), p1, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s57 1) (GEQ s261 1)), p1:(AND (GEQ s114 1) (GEQ s262 1)), p2:(AND (GEQ s81 1) (GEQ s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-03 finished in 9639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))||p0)))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 213 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:29:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:29:52] [INFO ] Invariant cache hit.
[2024-05-31 15:29:52] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-31 15:29:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:29:52] [INFO ] Invariant cache hit.
[2024-05-31 15:29:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:29:59] [INFO ] Implicit Places using invariants and state equation in 6822 ms returned []
Implicit Place search using SMT with State Equation took 7217 ms to find 0 implicit places.
[2024-05-31 15:30:00] [INFO ] Redundant transitions in 777 ms returned []
[2024-05-31 15:30:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:00] [INFO ] Invariant cache hit.
[2024-05-31 15:30:02] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10094 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s300 1)) (AND (GEQ s100 1) (GEQ s274 1))), p1:(AND (GEQ s109 1) (GEQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 396 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-05 finished in 10589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:30:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:02] [INFO ] Invariant cache hit.
[2024-05-31 15:30:03] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-31 15:30:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:03] [INFO ] Invariant cache hit.
[2024-05-31 15:30:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:30:11] [INFO ] Implicit Places using invariants and state equation in 7981 ms returned []
Implicit Place search using SMT with State Equation took 8392 ms to find 0 implicit places.
[2024-05-31 15:30:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:11] [INFO ] Invariant cache hit.
[2024-05-31 15:30:13] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10295 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s55 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-06 finished in 10400 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)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 50 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:30:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:13] [INFO ] Invariant cache hit.
[2024-05-31 15:30:13] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-31 15:30:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:13] [INFO ] Invariant cache hit.
[2024-05-31 15:30:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:30:20] [INFO ] Implicit Places using invariants and state equation in 6792 ms returned []
Implicit Place search using SMT with State Equation took 7198 ms to find 0 implicit places.
[2024-05-31 15:30:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:20] [INFO ] Invariant cache hit.
[2024-05-31 15:30:22] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9100 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s98 1) (GEQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 340 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-07 finished in 9193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X((p2||X(F(p3)))))))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 48 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:30:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:22] [INFO ] Invariant cache hit.
[2024-05-31 15:30:22] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-31 15:30:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:22] [INFO ] Invariant cache hit.
[2024-05-31 15:30:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:30:29] [INFO ] Implicit Places using invariants and state equation in 7102 ms returned []
Implicit Place search using SMT with State Equation took 7498 ms to find 0 implicit places.
[2024-05-31 15:30:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:29] [INFO ] Invariant cache hit.
[2024-05-31 15:30:31] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9406 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s42 1) (GEQ s303 1)), p3:(AND (OR (LT s20 1) (LT s268 1)) (OR (LT s102 1) (LT s266 1))), p0:(AND (GEQ s23 1) (GEQ s288 1)), p1:(AND (GEQ s20 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 782 ms.
Product exploration explored 100000 steps with 25000 reset in 657 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 157 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193905 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193905 steps, saw 70547 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:30:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:30:36] [INFO ] Invariant cache hit.
[2024-05-31 15:30:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:30:40] [INFO ] After 3456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:30:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:30:50] [INFO ] After 9838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10002 steps, including 2 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 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211522 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211522 steps, saw 66816 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:30:53] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-31 15:30:53] [INFO ] Computed 1 invariants in 19 ms
[2024-05-31 15:30:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:30:55] [INFO ] After 1751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:30:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:30:57] [INFO ] After 2157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:30:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:31:00] [INFO ] After 3267ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:31:04] [INFO ] After 6732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9030 ms.
[2024-05-31 15:31:13] [INFO ] After 17989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-31 15:31:13] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 15:31:13] [INFO ] Invariant cache hit.
[2024-05-31 15:31:14] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-31 15:31:14] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 15:31:14] [INFO ] Invariant cache hit.
[2024-05-31 15:31:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:31:21] [INFO ] Implicit Places using invariants and state equation in 7861 ms returned []
Implicit Place search using SMT with State Equation took 8279 ms to find 0 implicit places.
[2024-05-31 15:31:22] [INFO ] Redundant transitions in 819 ms returned []
[2024-05-31 15:31:22] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 15:31:22] [INFO ] Invariant cache hit.
[2024-05-31 15:31:24] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11103 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5096 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 14 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2327 transitions
Reduce isomorphic transitions removed 5431 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 2 place count 282 transition count 2378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 281 transition count 2376
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 279 transition count 2376
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 277 transition count 2374
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 277 transition count 2373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 277 transition count 2372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 276 transition count 2372
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 276 transition count 2371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 275 transition count 2371
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 275 transition count 2371
Applied a total of 17 rules in 343 ms. Remains 275 /305 variables (removed 30) and now considering 2371/7810 (removed 5439) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2371 rows 275 cols
[2024-05-31 15:31:24] [INFO ] Computed 1 invariants in 12 ms
[2024-05-31 15:31:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:31:24] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:31:25] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:31:26] [INFO ] After 1072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:31:26] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 15:31:26] [INFO ] After 580ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:31:27] [INFO ] After 1460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 478 ms.
[2024-05-31 15:31:28] [INFO ] After 3061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 4 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 40 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:31:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:31:28] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 15:31:28] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 15:31:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:31:28] [INFO ] Invariant cache hit.
[2024-05-31 15:31:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:31:35] [INFO ] Implicit Places using invariants and state equation in 7116 ms returned []
Implicit Place search using SMT with State Equation took 7546 ms to find 0 implicit places.
[2024-05-31 15:31:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:31:35] [INFO ] Invariant cache hit.
[2024-05-31 15:31:37] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9423 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p3, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10002 steps, including 2 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 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197905 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197905 steps, saw 72182 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:31:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:31:41] [INFO ] Invariant cache hit.
[2024-05-31 15:31:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:31:44] [INFO ] After 3465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:31:44] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:31:54] [INFO ] After 9816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10001 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217327 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217327 steps, saw 67574 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:31:57] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-31 15:31:57] [INFO ] Computed 1 invariants in 19 ms
[2024-05-31 15:31:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:31:59] [INFO ] After 1721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:31:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:32:01] [INFO ] After 2120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:32:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:32:04] [INFO ] After 3267ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:32:08] [INFO ] After 6750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9018 ms.
[2024-05-31 15:32:17] [INFO ] After 17949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 172 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-31 15:32:17] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 15:32:17] [INFO ] Invariant cache hit.
[2024-05-31 15:32:18] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-31 15:32:18] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 15:32:18] [INFO ] Invariant cache hit.
[2024-05-31 15:32:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:32:26] [INFO ] Implicit Places using invariants and state equation in 8006 ms returned []
Implicit Place search using SMT with State Equation took 8395 ms to find 0 implicit places.
[2024-05-31 15:32:26] [INFO ] Redundant transitions in 809 ms returned []
[2024-05-31 15:32:26] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-31 15:32:26] [INFO ] Invariant cache hit.
[2024-05-31 15:32:28] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11163 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5096 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2327 transitions
Reduce isomorphic transitions removed 5431 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 2 place count 282 transition count 2378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 281 transition count 2376
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 279 transition count 2376
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 277 transition count 2374
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 277 transition count 2373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 277 transition count 2372
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 276 transition count 2372
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 276 transition count 2371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 275 transition count 2371
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 275 transition count 2371
Applied a total of 17 rules in 203 ms. Remains 275 /305 variables (removed 30) and now considering 2371/7810 (removed 5439) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2371 rows 275 cols
[2024-05-31 15:32:28] [INFO ] Computed 1 invariants in 12 ms
[2024-05-31 15:32:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:32:29] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:32:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:32:30] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:32:30] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 15:32:30] [INFO ] After 573ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:32:31] [INFO ] After 1458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 469 ms.
[2024-05-31 15:32:32] [INFO ] After 3064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p3, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 25000 reset in 576 ms.
Product exploration explored 100000 steps with 25000 reset in 614 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:32:35] [INFO ] Redundant transitions in 786 ms returned []
[2024-05-31 15:32:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:32:35] [INFO ] Computed 1 invariants in 21 ms
[2024-05-31 15:32:37] [INFO ] Dead Transitions using invariants and state equation in 1858 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2860 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin7177605718959678602
[2024-05-31 15:32:37] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7177605718959678602
Running compilation step : cd /tmp/ltsmin7177605718959678602;'/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/ltsmin7177605718959678602;'/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/ltsmin7177605718959678602;'/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 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:32:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:32:40] [INFO ] Invariant cache hit.
[2024-05-31 15:32:40] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-31 15:32:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:32:40] [INFO ] Invariant cache hit.
[2024-05-31 15:32:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:32:48] [INFO ] Implicit Places using invariants and state equation in 8037 ms returned []
Implicit Place search using SMT with State Equation took 8441 ms to find 0 implicit places.
[2024-05-31 15:32:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:32:48] [INFO ] Invariant cache hit.
[2024-05-31 15:32:50] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10291 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin10636414141719581519
[2024-05-31 15:32:50] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10636414141719581519
Running compilation step : cd /tmp/ltsmin10636414141719581519;'/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/ltsmin10636414141719581519;'/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/ltsmin10636414141719581519;'/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-31 15:32:53] [INFO ] Flatten gal took : 178 ms
[2024-05-31 15:32:54] [INFO ] Flatten gal took : 183 ms
[2024-05-31 15:32:54] [INFO ] Time to serialize gal into /tmp/LTL14981085965352802589.gal : 45 ms
[2024-05-31 15:32:54] [INFO ] Time to serialize properties into /tmp/LTL15506780239148620418.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/LTL14981085965352802589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7272795663040146488.hoa' '-atoms' '/tmp/LTL15506780239148620418.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15506780239148620418.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7272795663040146488.hoa
Detected timeout of ITS tools.
[2024-05-31 15:33:09] [INFO ] Flatten gal took : 171 ms
[2024-05-31 15:33:09] [INFO ] Flatten gal took : 182 ms
[2024-05-31 15:33:09] [INFO ] Time to serialize gal into /tmp/LTL17057982635456918343.gal : 27 ms
[2024-05-31 15:33:09] [INFO ] Time to serialize properties into /tmp/LTL5235382263884284980.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/LTL17057982635456918343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5235382263884284980.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(((G("((p20>=1)&&(l12>=1))"))||(X(("((p42>=1)&&(l49>=1))")||(X(F("(((p20<1)||(l12<1))&&((p102<1)||(l10<1)))"))))))||("((p23>=1)&&(...168
Formula 0 simplified : X(!"((p23>=1)&&(l34>=1))" & F!"((p20>=1)&&(l12>=1))" & X(!"((p42>=1)&&(l49>=1))" & XG!"(((p20<1)||(l12<1))&&((p102<1)||(l10<1)))"))
Detected timeout of ITS tools.
[2024-05-31 15:33:24] [INFO ] Flatten gal took : 168 ms
[2024-05-31 15:33:24] [INFO ] Applying decomposition
[2024-05-31 15:33:24] [INFO ] Flatten gal took : 176 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/graph2320281860983071977.txt' '-o' '/tmp/graph2320281860983071977.bin' '-w' '/tmp/graph2320281860983071977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2320281860983071977.bin' '-l' '-1' '-v' '-w' '/tmp/graph2320281860983071977.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:33:25] [INFO ] Decomposing Gal with order
[2024-05-31 15:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:33:25] [INFO ] Removed a total of 18142 redundant transitions.
[2024-05-31 15:33:25] [INFO ] Flatten gal took : 333 ms
[2024-05-31 15:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1215 labels/synchronizations in 184 ms.
[2024-05-31 15:33:26] [INFO ] Time to serialize gal into /tmp/LTL15777349714514032617.gal : 24 ms
[2024-05-31 15:33:26] [INFO ] Time to serialize properties into /tmp/LTL90550338000635924.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/LTL15777349714514032617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL90550338000635924.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...253
Read 1 LTL properties
Checking formula 0 : !((X(((G("((u49.p20>=1)&&(i3.i1.u55.l12>=1))"))||(X(("((i3.i1.u55.p42>=1)&&(i8.u62.l49>=1))")||(X(F("(((u49.p20<1)||(i3.i1.u55.l12<1))...247
Formula 0 simplified : X(!"((i4.u50.p23>=1)&&(i6.i2.u56.l34>=1))" & F!"((u49.p20>=1)&&(i3.i1.u55.l12>=1))" & X(!"((i3.i1.u55.p42>=1)&&(i8.u62.l49>=1))" & X...233
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8737097674626182904
[2024-05-31 15:33:41] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8737097674626182904
Running compilation step : cd /tmp/ltsmin8737097674626182904;'/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/ltsmin8737097674626182904;'/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/ltsmin8737097674626182904;'/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 Szymanski-PT-b04-LTLFireability-08 finished in 201803 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)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:33:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:33:44] [INFO ] Invariant cache hit.
[2024-05-31 15:33:44] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-31 15:33:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:33:44] [INFO ] Invariant cache hit.
[2024-05-31 15:33:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:33:52] [INFO ] Implicit Places using invariants and state equation in 7469 ms returned []
Implicit Place search using SMT with State Equation took 7870 ms to find 0 implicit places.
[2024-05-31 15:33:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:33:52] [INFO ] Invariant cache hit.
[2024-05-31 15:33:53] [INFO ] Dead Transitions using invariants and state equation in 1833 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9757 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s104 1) (GEQ s296 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 417 steps with 0 reset in 6 ms.
FORMULA Szymanski-PT-b04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-09 finished in 9846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p1||G(p2))))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:33:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:33:54] [INFO ] Invariant cache hit.
[2024-05-31 15:33:54] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-31 15:33:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:33:54] [INFO ] Invariant cache hit.
[2024-05-31 15:33:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:34:02] [INFO ] Implicit Places using invariants and state equation in 8288 ms returned []
Implicit Place search using SMT with State Equation took 8705 ms to find 0 implicit places.
[2024-05-31 15:34:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:34:02] [INFO ] Invariant cache hit.
[2024-05-31 15:34:04] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10644 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], 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 0 reset in 372 ms.
Product exploration explored 100000 steps with 1 reset in 430 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-31 15:34:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:34:06] [INFO ] Invariant cache hit.
[2024-05-31 15:34:06] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:34:06] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-31 15:34:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:34:10] [INFO ] After 3824ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-31 15:34:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:34:25] [INFO ] After 15139ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-31 15:34:27] [INFO ] After 16348ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 1942 ms.
[2024-05-31 15:34:29] [INFO ] After 22190ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 172914 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172914 steps, saw 62845 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:34:32] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:34:32] [INFO ] Computed 2 invariants in 21 ms
[2024-05-31 15:34:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:34:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:34:41] [INFO ] After 9051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:34:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:34:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:34:43] [INFO ] After 2261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:34:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:34:53] [INFO ] After 9580ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:34:57] [INFO ] After 13690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8992 ms.
[2024-05-31 15:35:06] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 171 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:35:06] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:35:06] [INFO ] Invariant cache hit.
[2024-05-31 15:35:07] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-31 15:35:07] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:35:07] [INFO ] Invariant cache hit.
[2024-05-31 15:35:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:35:15] [INFO ] Implicit Places using invariants and state equation in 8340 ms returned []
Implicit Place search using SMT with State Equation took 8763 ms to find 0 implicit places.
[2024-05-31 15:35:16] [INFO ] Redundant transitions in 809 ms returned []
[2024-05-31 15:35:16] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:35:16] [INFO ] Invariant cache hit.
[2024-05-31 15:35:18] [INFO ] Dead Transitions using invariants and state equation in 1842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11595 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4656 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 190 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2569 rows 281 cols
[2024-05-31 15:35:18] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 15:35:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:35:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:35:23] [INFO ] After 4751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:35:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:35:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:35:24] [INFO ] After 1428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:35:26] [INFO ] After 3430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3661 ms.
[2024-05-31 15:35:30] [INFO ] After 7146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 141 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Support contains 4 out of 305 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 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:35:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:35:31] [INFO ] Computed 1 invariants in 23 ms
[2024-05-31 15:35:31] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-31 15:35:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:35:31] [INFO ] Invariant cache hit.
[2024-05-31 15:35:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:35:38] [INFO ] Implicit Places using invariants and state equation in 7439 ms returned []
Implicit Place search using SMT with State Equation took 7866 ms to find 0 implicit places.
[2024-05-31 15:35:39] [INFO ] Redundant transitions in 768 ms returned []
[2024-05-31 15:35:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:35:39] [INFO ] Invariant cache hit.
[2024-05-31 15:35:41] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10619 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 198707 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 198707 steps, saw 72271 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-31 15:35:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:35:44] [INFO ] Invariant cache hit.
[2024-05-31 15:35:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:35:46] [INFO ] After 1516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:35:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:35:48] [INFO ] After 2269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:35:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:35:53] [INFO ] After 4741ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:35:54] [INFO ] After 6268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1746 ms.
[2024-05-31 15:35:56] [INFO ] After 10343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10003 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219264 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219264 steps, saw 75402 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:35:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:35:59] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 15:35:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:35:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:36:00] [INFO ] After 880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:36:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:36:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:36:02] [INFO ] After 1187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:36:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:36:09] [INFO ] After 7816ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:36:09] [INFO ] After 7943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-31 15:36:10] [INFO ] After 9361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 171 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:36:10] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:36:10] [INFO ] Invariant cache hit.
[2024-05-31 15:36:10] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-31 15:36:10] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:36:10] [INFO ] Invariant cache hit.
[2024-05-31 15:36:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:36:18] [INFO ] Implicit Places using invariants and state equation in 7255 ms returned []
Implicit Place search using SMT with State Equation took 7701 ms to find 0 implicit places.
[2024-05-31 15:36:19] [INFO ] Redundant transitions in 799 ms returned []
[2024-05-31 15:36:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:36:19] [INFO ] Invariant cache hit.
[2024-05-31 15:36:20] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10521 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 192 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2024-05-31 15:36:21] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 15:36:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:36:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:36:21] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:36:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:36:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:36:22] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:36:23] [INFO ] After 1092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 605 ms.
[2024-05-31 15:36:23] [INFO ] After 1743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 363 ms.
Built C files in :
/tmp/ltsmin7337925643704458209
[2024-05-31 15:36:25] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:36:25] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7337925643704458209
Running compilation step : cd /tmp/ltsmin7337925643704458209;'/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/ltsmin7337925643704458209;'/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/ltsmin7337925643704458209;'/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 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:36:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:36:28] [INFO ] Computed 1 invariants in 18 ms
[2024-05-31 15:36:28] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-31 15:36:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:36:28] [INFO ] Invariant cache hit.
[2024-05-31 15:36:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:36:36] [INFO ] Implicit Places using invariants and state equation in 7319 ms returned []
Implicit Place search using SMT with State Equation took 7742 ms to find 0 implicit places.
[2024-05-31 15:36:36] [INFO ] Redundant transitions in 778 ms returned []
[2024-05-31 15:36:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:36:36] [INFO ] Invariant cache hit.
[2024-05-31 15:36:38] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10628 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin9554235792847294371
[2024-05-31 15:36:38] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:36:38] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9554235792847294371
Running compilation step : cd /tmp/ltsmin9554235792847294371;'/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/ltsmin9554235792847294371;'/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/ltsmin9554235792847294371;'/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-31 15:36:42] [INFO ] Flatten gal took : 183 ms
[2024-05-31 15:36:42] [INFO ] Flatten gal took : 168 ms
[2024-05-31 15:36:42] [INFO ] Time to serialize gal into /tmp/LTL3728719352537171096.gal : 26 ms
[2024-05-31 15:36:42] [INFO ] Time to serialize properties into /tmp/LTL11036710235570855221.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/LTL3728719352537171096.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12225627399125298918.hoa' '-atoms' '/tmp/LTL11036710235570855221.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11036710235570855221.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12225627399125298918.hoa
Detected timeout of ITS tools.
[2024-05-31 15:36:57] [INFO ] Flatten gal took : 169 ms
[2024-05-31 15:36:57] [INFO ] Flatten gal took : 174 ms
[2024-05-31 15:36:57] [INFO ] Time to serialize gal into /tmp/LTL18317998446166776431.gal : 23 ms
[2024-05-31 15:36:57] [INFO ] Time to serialize properties into /tmp/LTL15618174837488113872.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/LTL18317998446166776431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15618174837488113872.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(G((X(F(("((p32>=1)&&(l23>=1))")||(G("((p99<1)||(l50<1))")))))||("((p126>=1)&&(l5>=1))")))))
Formula 0 simplified : XF(!"((p126>=1)&&(l5>=1))" & XG(!"((p32>=1)&&(l23>=1))" & F!"((p99<1)||(l50<1))"))
Detected timeout of ITS tools.
[2024-05-31 15:37:13] [INFO ] Flatten gal took : 171 ms
[2024-05-31 15:37:13] [INFO ] Applying decomposition
[2024-05-31 15:37:13] [INFO ] Flatten gal took : 177 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/graph12401133083370840357.txt' '-o' '/tmp/graph12401133083370840357.bin' '-w' '/tmp/graph12401133083370840357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12401133083370840357.bin' '-l' '-1' '-v' '-w' '/tmp/graph12401133083370840357.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:37:13] [INFO ] Decomposing Gal with order
[2024-05-31 15:37:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:37:13] [INFO ] Removed a total of 18365 redundant transitions.
[2024-05-31 15:37:13] [INFO ] Flatten gal took : 303 ms
[2024-05-31 15:37:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1043 labels/synchronizations in 190 ms.
[2024-05-31 15:37:14] [INFO ] Time to serialize gal into /tmp/LTL7696412583497449663.gal : 23 ms
[2024-05-31 15:37:14] [INFO ] Time to serialize properties into /tmp/LTL15621176135798646923.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/LTL7696412583497449663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15621176135798646923.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F(("((i2.u47.p32>=1)&&(i7.u55.l23>=1))")||(G("((i2.u33.p99<1)||(i1.u63.l50<1))")))))||("((i0.i1.u42.p126>=1)&&(i2.u46.l5>=1)...162
Formula 0 simplified : XF(!"((i0.i1.u42.p126>=1)&&(i2.u46.l5>=1))" & XG(!"((i2.u47.p32>=1)&&(i7.u55.l23>=1))" & F!"((i2.u33.p99<1)||(i1.u63.l50<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14536008102647485839
[2024-05-31 15:37:29] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14536008102647485839
Running compilation step : cd /tmp/ltsmin14536008102647485839;'/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/ltsmin14536008102647485839;'/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/ltsmin14536008102647485839;'/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 Szymanski-PT-b04-LTLFireability-10 finished in 218253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 212 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:37:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:37:32] [INFO ] Invariant cache hit.
[2024-05-31 15:37:32] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-31 15:37:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:37:32] [INFO ] Invariant cache hit.
[2024-05-31 15:37:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:37:41] [INFO ] Implicit Places using invariants and state equation in 8066 ms returned []
Implicit Place search using SMT with State Equation took 8474 ms to find 0 implicit places.
[2024-05-31 15:37:41] [INFO ] Redundant transitions in 831 ms returned []
[2024-05-31 15:37:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:37:41] [INFO ] Invariant cache hit.
[2024-05-31 15:37:43] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11366 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s56 1) (LT s291 1)), p1:(AND (GEQ s56 1) (GEQ s262 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 420 ms.
Product exploration explored 100000 steps with 6 reset in 401 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:37:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:37:44] [INFO ] Invariant cache hit.
[2024-05-31 15:37:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:37:48] [INFO ] After 3675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:37:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:37:53] [INFO ] After 4874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:37:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:38:08] [INFO ] After 15164ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:13] [INFO ] After 20063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 15:38:13] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 206935 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{1=1}
Probabilistic random walk after 206935 steps, saw 66120 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-31 15:38:16] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:38:16] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 15:38:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:38:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:38:19] [INFO ] After 2268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:38:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:38:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 15:38:20] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:38:24] [INFO ] After 4361ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:27] [INFO ] After 6816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 570 ms.
[2024-05-31 15:38:27] [INFO ] After 8841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213639 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213639 steps, saw 67089 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:38:31] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:38:31] [INFO ] Invariant cache hit.
[2024-05-31 15:38:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:38:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 15:38:33] [INFO ] After 2309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:38:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:38:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:38:34] [INFO ] After 1400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:38:39] [INFO ] After 4417ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:41] [INFO ] After 6992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 595 ms.
[2024-05-31 15:38:42] [INFO ] After 9051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:38:42] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:38:42] [INFO ] Invariant cache hit.
[2024-05-31 15:38:43] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-31 15:38:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:38:43] [INFO ] Invariant cache hit.
[2024-05-31 15:38:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:38:51] [INFO ] Implicit Places using invariants and state equation in 7743 ms returned []
Implicit Place search using SMT with State Equation took 8176 ms to find 0 implicit places.
[2024-05-31 15:38:51] [INFO ] Redundant transitions in 788 ms returned []
[2024-05-31 15:38:51] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:38:51] [INFO ] Invariant cache hit.
[2024-05-31 15:38:53] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10966 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4880 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 282 transition count 2568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 280 transition count 2568
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 280 transition count 2565
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 277 transition count 2565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 276 transition count 2564
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 430 place count 276 transition count 2147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 276 transition count 2146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 275 transition count 2146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 275 transition count 2146
Applied a total of 433 rules in 178 ms. Remains 275 /305 variables (removed 30) and now considering 2146/7809 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2146 rows 275 cols
[2024-05-31 15:38:53] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 15:38:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:38:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:38:55] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:38:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:38:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:38:56] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:56] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-31 15:38:57] [INFO ] After 848ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:38:58] [INFO ] After 2058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2756 ms.
[2024-05-31 15:39:01] [INFO ] After 6329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:39:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:39:02] [INFO ] Computed 1 invariants in 19 ms
[2024-05-31 15:39:02] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-31 15:39:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:39:02] [INFO ] Invariant cache hit.
[2024-05-31 15:39:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:39:10] [INFO ] Implicit Places using invariants and state equation in 7975 ms returned []
Implicit Place search using SMT with State Equation took 8387 ms to find 0 implicit places.
[2024-05-31 15:39:11] [INFO ] Redundant transitions in 831 ms returned []
[2024-05-31 15:39:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:39:11] [INFO ] Invariant cache hit.
[2024-05-31 15:39:13] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11230 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:39:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:39:13] [INFO ] Invariant cache hit.
[2024-05-31 15:39:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:39:17] [INFO ] After 3655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:39:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:39:22] [INFO ] After 4851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:39:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:39:37] [INFO ] After 15184ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:39:42] [INFO ] After 19998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-31 15:39:42] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 212231 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{1=1}
Probabilistic random walk after 212231 steps, saw 66901 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-31 15:39:45] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:39:45] [INFO ] Computed 2 invariants in 21 ms
[2024-05-31 15:39:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:39:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:39:47] [INFO ] After 2277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:39:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:39:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:39:49] [INFO ] After 1360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:39:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:39:53] [INFO ] After 4321ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:39:55] [INFO ] After 6799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 561 ms.
[2024-05-31 15:39:56] [INFO ] After 8786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 168 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10003 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 218765 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218765 steps, saw 67802 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:39:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:39:59] [INFO ] Invariant cache hit.
[2024-05-31 15:39:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:39:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 15:40:02] [INFO ] After 2270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:40:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:40:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 15:40:03] [INFO ] After 1368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:40:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:40:07] [INFO ] After 4364ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:40:10] [INFO ] After 6846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 565 ms.
[2024-05-31 15:40:10] [INFO ] After 8847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 171 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:40:11] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:40:11] [INFO ] Invariant cache hit.
[2024-05-31 15:40:11] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-31 15:40:11] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:40:11] [INFO ] Invariant cache hit.
[2024-05-31 15:40:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:40:19] [INFO ] Implicit Places using invariants and state equation in 7731 ms returned []
Implicit Place search using SMT with State Equation took 8167 ms to find 0 implicit places.
[2024-05-31 15:40:20] [INFO ] Redundant transitions in 796 ms returned []
[2024-05-31 15:40:20] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:40:20] [INFO ] Invariant cache hit.
[2024-05-31 15:40:22] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10978 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4880 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 282 transition count 2568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 280 transition count 2568
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 280 transition count 2565
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 277 transition count 2565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 276 transition count 2564
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 430 place count 276 transition count 2147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 276 transition count 2146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 275 transition count 2146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 275 transition count 2146
Applied a total of 433 rules in 167 ms. Remains 275 /305 variables (removed 30) and now considering 2146/7809 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2146 rows 275 cols
[2024-05-31 15:40:22] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 15:40:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:40:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:40:23] [INFO ] After 1353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:40:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:40:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:40:25] [INFO ] After 1426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:40:25] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-31 15:40:25] [INFO ] After 846ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:40:27] [INFO ] After 2018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2718 ms.
[2024-05-31 15:40:29] [INFO ] After 6212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 181 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 0 reset in 390 ms.
Built C files in :
/tmp/ltsmin11065683748392004584
[2024-05-31 15:40:30] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:40:31] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11065683748392004584
Running compilation step : cd /tmp/ltsmin11065683748392004584;'/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/ltsmin11065683748392004584;'/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/ltsmin11065683748392004584;'/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 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:40:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:40:34] [INFO ] Computed 1 invariants in 13 ms
[2024-05-31 15:40:34] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-31 15:40:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:40:34] [INFO ] Invariant cache hit.
[2024-05-31 15:40:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:40:41] [INFO ] Implicit Places using invariants and state equation in 7059 ms returned []
Implicit Place search using SMT with State Equation took 7472 ms to find 0 implicit places.
[2024-05-31 15:40:42] [INFO ] Redundant transitions in 764 ms returned []
[2024-05-31 15:40:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:40:42] [INFO ] Invariant cache hit.
[2024-05-31 15:40:44] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10265 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin14071793591386900321
[2024-05-31 15:40:44] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:40:44] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14071793591386900321
Running compilation step : cd /tmp/ltsmin14071793591386900321;'/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/ltsmin14071793591386900321;'/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/ltsmin14071793591386900321;'/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-31 15:40:47] [INFO ] Flatten gal took : 168 ms
[2024-05-31 15:40:47] [INFO ] Flatten gal took : 173 ms
[2024-05-31 15:40:47] [INFO ] Time to serialize gal into /tmp/LTL12981434501831078716.gal : 23 ms
[2024-05-31 15:40:47] [INFO ] Time to serialize properties into /tmp/LTL1198700272655818534.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/LTL12981434501831078716.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9622053300455694796.hoa' '-atoms' '/tmp/LTL1198700272655818534.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/LTL1198700272655818534.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9622053300455694796.hoa
Detected timeout of ITS tools.
[2024-05-31 15:41:03] [INFO ] Flatten gal took : 164 ms
[2024-05-31 15:41:03] [INFO ] Flatten gal took : 169 ms
[2024-05-31 15:41:03] [INFO ] Time to serialize gal into /tmp/LTL5297984700525821226.gal : 22 ms
[2024-05-31 15:41:03] [INFO ] Time to serialize properties into /tmp/LTL9822447369593742826.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/LTL5297984700525821226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9822447369593742826.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 : !((F((G("((p56<1)||(l37<1))"))||(G("((p56>=1)&&(l6>=1))")))))
Formula 0 simplified : G(F!"((p56<1)||(l37<1))" & F!"((p56>=1)&&(l6>=1))")
Detected timeout of ITS tools.
[2024-05-31 15:41:18] [INFO ] Flatten gal took : 170 ms
[2024-05-31 15:41:18] [INFO ] Applying decomposition
[2024-05-31 15:41:18] [INFO ] Flatten gal took : 177 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/graph15478137314454959691.txt' '-o' '/tmp/graph15478137314454959691.bin' '-w' '/tmp/graph15478137314454959691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15478137314454959691.bin' '-l' '-1' '-v' '-w' '/tmp/graph15478137314454959691.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:41:19] [INFO ] Decomposing Gal with order
[2024-05-31 15:41:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:41:19] [INFO ] Removed a total of 17839 redundant transitions.
[2024-05-31 15:41:19] [INFO ] Flatten gal took : 320 ms
[2024-05-31 15:41:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1159 labels/synchronizations in 179 ms.
[2024-05-31 15:41:19] [INFO ] Time to serialize gal into /tmp/LTL16791838031652607478.gal : 20 ms
[2024-05-31 15:41:19] [INFO ] Time to serialize properties into /tmp/LTL676969254188723476.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/LTL16791838031652607478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL676969254188723476.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i7.i1.u19.p56<1)||(i7.i1.u57.l37<1))"))||(G("((i7.i1.u19.p56>=1)&&(i2.i0.u46.l6>=1))")))))
Formula 0 simplified : G(F!"((i7.i1.u19.p56<1)||(i7.i1.u57.l37<1))" & F!"((i7.i1.u19.p56>=1)&&(i2.i0.u46.l6>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16245651014228622540
[2024-05-31 15:41:34] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16245651014228622540
Running compilation step : cd /tmp/ltsmin16245651014228622540;'/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/ltsmin16245651014228622540;'/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/ltsmin16245651014228622540;'/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 Szymanski-PT-b04-LTLFireability-13 finished in 245585 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((!p0&&X(X(G(p1))))) U G(!p2))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 30 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:41:37] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:41:37] [INFO ] Computed 1 invariants in 21 ms
[2024-05-31 15:41:38] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-31 15:41:38] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:41:38] [INFO ] Invariant cache hit.
[2024-05-31 15:41:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:41:45] [INFO ] Implicit Places using invariants and state equation in 6984 ms returned []
Implicit Place search using SMT with State Equation took 7435 ms to find 0 implicit places.
[2024-05-31 15:41:45] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:41:45] [INFO ] Invariant cache hit.
[2024-05-31 15:41:47] [INFO ] Dead Transitions using invariants and state equation in 1895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9361 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 364 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 6}, { cond=(NOT p2), acceptance={} source=8 dest: 9}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p2 p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s286 1)), p0:(AND (GEQ s19 1) (GEQ s302 1)), p1:(AND (GEQ s39 1) (GEQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Incomplete random walk after 10002 steps, including 3 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 127553 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127553 steps, saw 49363 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 11 properties.
[2024-05-31 15:41:52] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:41:52] [INFO ] Invariant cache hit.
[2024-05-31 15:41:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:41:54] [INFO ] After 1567ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2024-05-31 15:41:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:42:04] [INFO ] After 10459ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2024-05-31 15:42:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:42:19] [INFO ] After 14402ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2024-05-31 15:42:19] [INFO ] After 14403ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 15:42:19] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 306 transition count 7941
Applied a total of 123 rules in 182 ms. Remains 306 /306 variables (removed 0) and now considering 7941/8064 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 306/306 places, 7941/8064 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 142661 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142661 steps, saw 55850 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-31 15:42:22] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
// Phase 1: matrix 2610 rows 306 cols
[2024-05-31 15:42:22] [INFO ] Computed 1 invariants in 19 ms
[2024-05-31 15:42:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:42:25] [INFO ] After 2541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 15:42:25] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:42:42] [INFO ] After 16793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-31 15:42:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:42:50] [INFO ] After 8094ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-31 15:42:50] [INFO ] After 8095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 15:42:50] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 71 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7941/7941 transitions.
Applied a total of 0 rules in 172 ms. Remains 306 /306 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 306/306 places, 7941/7941 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7941/7941 transitions.
Applied a total of 0 rules in 171 ms. Remains 306 /306 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
[2024-05-31 15:42:50] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:42:50] [INFO ] Invariant cache hit.
[2024-05-31 15:42:51] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-31 15:42:51] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:42:51] [INFO ] Invariant cache hit.
[2024-05-31 15:42:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:42:59] [INFO ] Implicit Places using invariants and state equation in 8516 ms returned []
Implicit Place search using SMT with State Equation took 8925 ms to find 0 implicit places.
[2024-05-31 15:43:00] [INFO ] Redundant transitions in 814 ms returned []
[2024-05-31 15:43:00] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:43:00] [INFO ] Invariant cache hit.
[2024-05-31 15:43:02] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11738 ms. Remains : 306/306 places, 7941/7941 transitions.
Graph (trivial) has 4848 edges and 306 vertex of which 36 / 306 are part of one of the 2 SCC in 1 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1753 transitions
Reduce isomorphic transitions removed 5569 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 2371
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 2370
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 271 transition count 1954
Applied a total of 420 rules in 125 ms. Remains 271 /306 variables (removed 35) and now considering 1954/7941 (removed 5987) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1954 rows 271 cols
[2024-05-31 15:43:02] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 15:43:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:43:03] [INFO ] After 734ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2024-05-31 15:43:03] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:43:03] [INFO ] After 260ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 15:43:03] [INFO ] After 1090ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 15:43:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:43:05] [INFO ] After 1474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-31 15:43:13] [INFO ] After 8702ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-31 15:43:21] [INFO ] After 15841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 5078 ms.
[2024-05-31 15:43:26] [INFO ] After 22509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (G (NOT (AND p0 p2))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 136 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 340 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 31 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:43:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:43:27] [INFO ] Computed 1 invariants in 20 ms
[2024-05-31 15:43:27] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 15:43:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:43:27] [INFO ] Invariant cache hit.
[2024-05-31 15:43:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:43:32] [INFO ] Implicit Places using invariants and state equation in 5188 ms returned []
Implicit Place search using SMT with State Equation took 5619 ms to find 0 implicit places.
[2024-05-31 15:43:32] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:43:32] [INFO ] Invariant cache hit.
[2024-05-31 15:43:34] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7515 ms. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 147468 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147468 steps, saw 58927 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-31 15:43:38] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:43:38] [INFO ] Invariant cache hit.
[2024-05-31 15:43:38] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:43:39] [INFO ] After 1204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 15:43:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:43:43] [INFO ] After 4077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 15:43:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:02] [INFO ] After 18844ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-31 15:44:04] [INFO ] After 20834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-31 15:44:04] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 70 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 306 transition count 7941
Applied a total of 123 rules in 182 ms. Remains 306 /306 variables (removed 0) and now considering 7941/8064 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 306/306 places, 7941/8064 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 158391 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158391 steps, saw 64122 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-31 15:44:08] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
// Phase 1: matrix 2610 rows 306 cols
[2024-05-31 15:44:08] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 15:44:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:44:10] [INFO ] After 2071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 15:44:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:44:19] [INFO ] After 8991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 15:44:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:24] [INFO ] After 4988ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-31 15:44:29] [INFO ] Deduced a trap composed of 61 places in 319 ms of which 0 ms to minimize.
[2024-05-31 15:44:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2024-05-31 15:44:33] [INFO ] After 14239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1681 ms.
[2024-05-31 15:44:35] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 55 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7941/7941 transitions.
Applied a total of 0 rules in 171 ms. Remains 306 /306 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 306/306 places, 7941/7941 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7941/7941 transitions.
Applied a total of 0 rules in 171 ms. Remains 306 /306 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
[2024-05-31 15:44:35] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:44:35] [INFO ] Invariant cache hit.
[2024-05-31 15:44:35] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-31 15:44:35] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:44:35] [INFO ] Invariant cache hit.
[2024-05-31 15:44:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:44:43] [INFO ] Implicit Places using invariants and state equation in 7765 ms returned []
Implicit Place search using SMT with State Equation took 8165 ms to find 0 implicit places.
[2024-05-31 15:44:44] [INFO ] Redundant transitions in 845 ms returned []
[2024-05-31 15:44:44] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:44:44] [INFO ] Invariant cache hit.
[2024-05-31 15:44:46] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11061 ms. Remains : 306/306 places, 7941/7941 transitions.
Graph (trivial) has 4848 edges and 306 vertex of which 36 / 306 are part of one of the 2 SCC in 0 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1753 transitions
Reduce isomorphic transitions removed 5569 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 2371
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 2370
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 271 transition count 1954
Applied a total of 420 rules in 116 ms. Remains 271 /306 variables (removed 35) and now considering 1954/7941 (removed 5987) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1954 rows 271 cols
[2024-05-31 15:44:46] [INFO ] Computed 1 invariants in 13 ms
[2024-05-31 15:44:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:44:47] [INFO ] After 559ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-31 15:44:47] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:44:47] [INFO ] After 129ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 15:44:47] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 15:44:47] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:44:48] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 15:44:51] [INFO ] After 2531ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-31 15:44:55] [INFO ] After 6823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7761 ms.
[2024-05-31 15:45:03] [INFO ] After 15861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 370 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 355 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Product exploration explored 100000 steps with 1 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 380 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, false, true]
Stuttering acceptance computed with spot in 373 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 176 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:45:06] [INFO ] Redundant transitions in 790 ms returned []
[2024-05-31 15:45:06] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:45:06] [INFO ] Computed 1 invariants in 20 ms
[2024-05-31 15:45:08] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2907 ms. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin10221067944649649490
[2024-05-31 15:45:08] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10221067944649649490
Running compilation step : cd /tmp/ltsmin10221067944649649490;'/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/ltsmin10221067944649649490;'/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/ltsmin10221067944649649490;'/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 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 28 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:45:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:45:11] [INFO ] Invariant cache hit.
[2024-05-31 15:45:12] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-31 15:45:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:45:12] [INFO ] Invariant cache hit.
[2024-05-31 15:45:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:45:18] [INFO ] Implicit Places using invariants and state equation in 6055 ms returned []
Implicit Place search using SMT with State Equation took 6475 ms to find 0 implicit places.
[2024-05-31 15:45:18] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:45:18] [INFO ] Invariant cache hit.
[2024-05-31 15:45:20] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8388 ms. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin17872814447991746394
[2024-05-31 15:45:20] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17872814447991746394
Running compilation step : cd /tmp/ltsmin17872814447991746394;'/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/ltsmin17872814447991746394;'/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/ltsmin17872814447991746394;'/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-31 15:45:23] [INFO ] Flatten gal took : 172 ms
[2024-05-31 15:45:23] [INFO ] Flatten gal took : 178 ms
[2024-05-31 15:45:23] [INFO ] Time to serialize gal into /tmp/LTL1807587498661276236.gal : 24 ms
[2024-05-31 15:45:23] [INFO ] Time to serialize properties into /tmp/LTL2090416151389958150.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/LTL1807587498661276236.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2524628019510070781.hoa' '-atoms' '/tmp/LTL2090416151389958150.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/LTL2090416151389958150.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2524628019510070781.hoa
Detected timeout of ITS tools.
[2024-05-31 15:45:39] [INFO ] Flatten gal took : 169 ms
[2024-05-31 15:45:39] [INFO ] Flatten gal took : 174 ms
[2024-05-31 15:45:39] [INFO ] Time to serialize gal into /tmp/LTL11515927410721430766.gal : 22 ms
[2024-05-31 15:45:39] [INFO ] Time to serialize properties into /tmp/LTL3803439863439486638.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/LTL11515927410721430766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3803439863439486638.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((!("((p19>=1)&&(l48>=1))"))&&(X(X(G("((p39>=1)&&(l9>=1))"))))))U(G(!("((p13>=1)&&(l32>=1))"))))))
Formula 0 simplified : X(X("((p19>=1)&&(l48>=1))" | XXF!"((p39>=1)&&(l9>=1))") R F"((p13>=1)&&(l32>=1))")
Detected timeout of ITS tools.
[2024-05-31 15:45:54] [INFO ] Flatten gal took : 170 ms
[2024-05-31 15:45:54] [INFO ] Applying decomposition
[2024-05-31 15:45:54] [INFO ] Flatten gal took : 175 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/graph11945452047715317226.txt' '-o' '/tmp/graph11945452047715317226.bin' '-w' '/tmp/graph11945452047715317226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11945452047715317226.bin' '-l' '-1' '-v' '-w' '/tmp/graph11945452047715317226.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:45:54] [INFO ] Decomposing Gal with order
[2024-05-31 15:45:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:45:55] [INFO ] Removed a total of 18316 redundant transitions.
[2024-05-31 15:45:55] [INFO ] Flatten gal took : 299 ms
[2024-05-31 15:45:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 896 labels/synchronizations in 160 ms.
[2024-05-31 15:45:55] [INFO ] Time to serialize gal into /tmp/LTL2640067933469147389.gal : 18 ms
[2024-05-31 15:45:55] [INFO ] Time to serialize properties into /tmp/LTL16489901683823225888.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/LTL2640067933469147389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16489901683823225888.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...255
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i8.u6.p19>=1)&&(i0.u62.l48>=1))"))&&(X(X(G("((i2.u13.p39>=1)&&(i3.u47.l9>=1))"))))))U(G(!("((i7.u5.p13>=1)&&(i7.u56.l32>...166
Formula 0 simplified : X(X("((i8.u6.p19>=1)&&(i0.u62.l48>=1))" | XXF!"((i2.u13.p39>=1)&&(i3.u47.l9>=1))") R F"((i7.u5.p13>=1)&&(i7.u56.l32>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12140416840230120947
[2024-05-31 15:46:10] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12140416840230120947
Running compilation step : cd /tmp/ltsmin12140416840230120947;'/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/ltsmin12140416840230120947;'/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/ltsmin12140416840230120947;'/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 Szymanski-PT-b04-LTLFireability-14 finished in 275807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 212 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:46:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:46:13] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 15:46:14] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-31 15:46:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:14] [INFO ] Invariant cache hit.
[2024-05-31 15:46:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:22] [INFO ] Implicit Places using invariants and state equation in 7839 ms returned []
Implicit Place search using SMT with State Equation took 8260 ms to find 0 implicit places.
[2024-05-31 15:46:23] [INFO ] Redundant transitions in 840 ms returned []
[2024-05-31 15:46:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:23] [INFO ] Invariant cache hit.
[2024-05-31 15:46:24] [INFO ] Dead Transitions using invariants and state equation in 1791 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11114 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s117 1) (LT s256 1)), p1:(AND (GEQ s47 1) (GEQ s287 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 2 reset in 421 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10002 steps, including 4 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2024-05-31 15:46:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:46:26] [INFO ] Invariant cache hit.
[2024-05-31 15:46:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:46:26] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-31 15:46:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:46:28] [INFO ] After 1703ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-31 15:46:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:30] [INFO ] After 1863ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-31 15:46:39] [INFO ] After 10876ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-31 15:46:39] [INFO ] After 12648ms 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 12 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219178 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219178 steps, saw 67869 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:46:42] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:46:42] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 15:46:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:46:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:46:43] [INFO ] After 1270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:46:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:46:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:46:45] [INFO ] After 1477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:46:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:46:48] [INFO ] After 2876ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:46:57] [INFO ] After 11891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 15:46:57] [INFO ] After 13441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 172 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 168 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:46:57] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:46:57] [INFO ] Invariant cache hit.
[2024-05-31 15:46:57] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-31 15:46:57] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:46:57] [INFO ] Invariant cache hit.
[2024-05-31 15:46:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:04] [INFO ] Implicit Places using invariants and state equation in 6931 ms returned []
Implicit Place search using SMT with State Equation took 7354 ms to find 0 implicit places.
[2024-05-31 15:47:05] [INFO ] Redundant transitions in 798 ms returned []
[2024-05-31 15:47:05] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:47:05] [INFO ] Invariant cache hit.
[2024-05-31 15:47:07] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10167 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4880 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 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 2 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2569
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2566
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2565
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 428 place count 277 transition count 2148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 428 place count 277 transition count 2147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 276 transition count 2147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 276 transition count 2147
Applied a total of 431 rules in 166 ms. Remains 276 /305 variables (removed 29) and now considering 2147/7809 (removed 5662) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2147 rows 276 cols
[2024-05-31 15:47:07] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 15:47:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:47:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:47:08] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:47:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:47:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:47:09] [INFO ] After 923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:09] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-31 15:47:09] [INFO ] After 308ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:10] [INFO ] After 1241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 577 ms.
[2024-05-31 15:47:11] [INFO ] After 2798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 151 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 305 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 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 172 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:47:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:47:11] [INFO ] Computed 1 invariants in 24 ms
[2024-05-31 15:47:12] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-31 15:47:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:12] [INFO ] Invariant cache hit.
[2024-05-31 15:47:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:19] [INFO ] Implicit Places using invariants and state equation in 7465 ms returned []
Implicit Place search using SMT with State Equation took 7897 ms to find 0 implicit places.
[2024-05-31 15:47:20] [INFO ] Redundant transitions in 762 ms returned []
[2024-05-31 15:47:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:20] [INFO ] Invariant cache hit.
[2024-05-31 15:47:22] [INFO ] Dead Transitions using invariants and state equation in 1811 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10652 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 p0)]
Incomplete random walk after 10002 steps, including 2 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 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200213 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200213 steps, saw 72542 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:47:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:25] [INFO ] Invariant cache hit.
[2024-05-31 15:47:25] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:47:27] [INFO ] After 1853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:47:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:47:28] [INFO ] After 1432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:30] [INFO ] After 1632ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:30] [INFO ] After 2204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-31 15:47:30] [INFO ] After 3805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219550 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219550 steps, saw 67873 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:47:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:47:34] [INFO ] Computed 3 invariants in 17 ms
[2024-05-31 15:47:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:47:35] [INFO ] After 1487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:47:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:47:36] [INFO ] After 978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:38] [INFO ] After 1378ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:38] [INFO ] After 1812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3112 ms.
[2024-05-31 15:47:41] [INFO ] After 5963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 170 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 171 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:47:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:47:42] [INFO ] Invariant cache hit.
[2024-05-31 15:47:42] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-31 15:47:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:47:42] [INFO ] Invariant cache hit.
[2024-05-31 15:47:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:47:44] [INFO ] Implicit Places using invariants and state equation in 2062 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
[2024-05-31 15:47:45] [INFO ] Redundant transitions in 814 ms returned []
[2024-05-31 15:47:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:47:45] [INFO ] Invariant cache hit.
[2024-05-31 15:47:47] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5583 ms. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 5136 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 112 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2024-05-31 15:47:47] [INFO ] Computed 3 invariants in 14 ms
[2024-05-31 15:47:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 15:47:48] [INFO ] After 406ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 15:47:48] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:47:48] [INFO ] After 125ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:47:48] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:47:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 15:47:48] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:49] [INFO ] After 325ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:47:49] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1007 ms.
[2024-05-31 15:47:50] [INFO ] After 2498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 358 ms.
Product exploration explored 100000 steps with 1 reset in 360 ms.
Built C files in :
/tmp/ltsmin4117730507889992671
[2024-05-31 15:47:51] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:47:51] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4117730507889992671
Running compilation step : cd /tmp/ltsmin4117730507889992671;'/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/ltsmin4117730507889992671;'/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/ltsmin4117730507889992671;'/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 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:47:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:47:54] [INFO ] Computed 1 invariants in 24 ms
[2024-05-31 15:47:55] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-31 15:47:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:47:55] [INFO ] Invariant cache hit.
[2024-05-31 15:47:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:48:02] [INFO ] Implicit Places using invariants and state equation in 6848 ms returned []
Implicit Place search using SMT with State Equation took 7293 ms to find 0 implicit places.
[2024-05-31 15:48:02] [INFO ] Redundant transitions in 765 ms returned []
[2024-05-31 15:48:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:48:02] [INFO ] Invariant cache hit.
[2024-05-31 15:48:04] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10119 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin6232022595000947816
[2024-05-31 15:48:04] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:48:04] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6232022595000947816
Running compilation step : cd /tmp/ltsmin6232022595000947816;'/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/ltsmin6232022595000947816;'/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/ltsmin6232022595000947816;'/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-31 15:48:08] [INFO ] Flatten gal took : 165 ms
[2024-05-31 15:48:08] [INFO ] Flatten gal took : 169 ms
[2024-05-31 15:48:08] [INFO ] Time to serialize gal into /tmp/LTL389654098563052922.gal : 22 ms
[2024-05-31 15:48:08] [INFO ] Time to serialize properties into /tmp/LTL10484516238906133768.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/LTL389654098563052922.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6289470880241231204.hoa' '-atoms' '/tmp/LTL10484516238906133768.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/LTL10484516238906133768.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6289470880241231204.hoa
Detected timeout of ITS tools.
[2024-05-31 15:48:23] [INFO ] Flatten gal took : 169 ms
[2024-05-31 15:48:23] [INFO ] Flatten gal took : 187 ms
[2024-05-31 15:48:23] [INFO ] Time to serialize gal into /tmp/LTL9296079321085698533.gal : 23 ms
[2024-05-31 15:48:23] [INFO ] Time to serialize properties into /tmp/LTL7472650431104882887.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/LTL9296079321085698533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7472650431104882887.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 : !((F((G("((p117<1)||(l0<1))"))||(G("((p47>=1)&&(l33>=1))")))))
Formula 0 simplified : G(F!"((p117<1)||(l0<1))" & F!"((p47>=1)&&(l33>=1))")
Detected timeout of ITS tools.
[2024-05-31 15:48:39] [INFO ] Flatten gal took : 172 ms
[2024-05-31 15:48:39] [INFO ] Applying decomposition
[2024-05-31 15:48:39] [INFO ] Flatten gal took : 178 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/graph2947421089242580655.txt' '-o' '/tmp/graph2947421089242580655.bin' '-w' '/tmp/graph2947421089242580655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2947421089242580655.bin' '-l' '-1' '-v' '-w' '/tmp/graph2947421089242580655.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:48:39] [INFO ] Decomposing Gal with order
[2024-05-31 15:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:48:39] [INFO ] Removed a total of 18142 redundant transitions.
[2024-05-31 15:48:39] [INFO ] Flatten gal took : 314 ms
[2024-05-31 15:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1143 labels/synchronizations in 174 ms.
[2024-05-31 15:48:40] [INFO ] Time to serialize gal into /tmp/LTL4036428232512839033.gal : 19 ms
[2024-05-31 15:48:40] [INFO ] Time to serialize properties into /tmp/LTL12964263669199533457.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/LTL4036428232512839033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12964263669199533457.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...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i4.u51.p117<1)||(i2.i1.u44.l0<1))"))||(G("((i6.u15.p47>=1)&&(i6.u56.l33>=1))")))))
Formula 0 simplified : G(F!"((i4.u51.p117<1)||(i2.i1.u44.l0<1))" & F!"((i6.u15.p47>=1)&&(i6.u56.l33>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17886017519765772550
[2024-05-31 15:48:55] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17886017519765772550
Running compilation step : cd /tmp/ltsmin17886017519765772550;'/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/ltsmin17886017519765772550;'/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/ltsmin17886017519765772550;'/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 Szymanski-PT-b04-LTLFireability-15 finished in 164635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X((p2||X(F(p3)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p1||G(p2))))))))'
Found a Lengthening insensitive property : Szymanski-PT-b04-LTLFireability-10
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 77 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2024-05-31 15:48:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:48:58] [INFO ] Invariant cache hit.
[2024-05-31 15:48:59] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-31 15:48:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:48:59] [INFO ] Invariant cache hit.
[2024-05-31 15:48:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:49:05] [INFO ] Implicit Places using invariants and state equation in 6042 ms returned []
Implicit Place search using SMT with State Equation took 6459 ms to find 0 implicit places.
[2024-05-31 15:49:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:49:05] [INFO ] Invariant cache hit.
[2024-05-31 15:49:07] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8351 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], 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 0 reset in 409 ms.
Product exploration explored 100000 steps with 1 reset in 411 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-31 15:49:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:49:08] [INFO ] Invariant cache hit.
[2024-05-31 15:49:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:49:09] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-31 15:49:09] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:49:12] [INFO ] After 3810ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-31 15:49:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:49:28] [INFO ] After 15182ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-31 15:49:29] [INFO ] After 16398ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 1938 ms.
[2024-05-31 15:49:31] [INFO ] After 22223ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 185739 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185739 steps, saw 66024 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 15:49:34] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:49:34] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 15:49:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:49:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:49:43] [INFO ] After 9209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:49:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:49:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:49:46] [INFO ] After 2218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:49:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:49:55] [INFO ] After 9544ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:49:59] [INFO ] After 13634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9098 ms.
[2024-05-31 15:50:08] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 168 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:50:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:50:09] [INFO ] Invariant cache hit.
[2024-05-31 15:50:09] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-31 15:50:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:50:09] [INFO ] Invariant cache hit.
[2024-05-31 15:50:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:50:17] [INFO ] Implicit Places using invariants and state equation in 8234 ms returned []
Implicit Place search using SMT with State Equation took 8654 ms to find 0 implicit places.
[2024-05-31 15:50:18] [INFO ] Redundant transitions in 804 ms returned []
[2024-05-31 15:50:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:50:18] [INFO ] Invariant cache hit.
[2024-05-31 15:50:20] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11482 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4656 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 196 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2569 rows 281 cols
[2024-05-31 15:50:20] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 15:50:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:50:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:50:25] [INFO ] After 4738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 15:50:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:50:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:50:26] [INFO ] After 1416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 15:50:28] [INFO ] After 3397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3698 ms.
[2024-05-31 15:50:32] [INFO ] After 7153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 137 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Support contains 4 out of 305 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 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:50:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:50:33] [INFO ] Computed 1 invariants in 25 ms
[2024-05-31 15:50:33] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-31 15:50:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:50:33] [INFO ] Invariant cache hit.
[2024-05-31 15:50:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:50:41] [INFO ] Implicit Places using invariants and state equation in 7482 ms returned []
Implicit Place search using SMT with State Equation took 7906 ms to find 0 implicit places.
[2024-05-31 15:50:41] [INFO ] Redundant transitions in 825 ms returned []
[2024-05-31 15:50:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:50:41] [INFO ] Invariant cache hit.
[2024-05-31 15:50:43] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10731 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:50:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:50:44] [INFO ] Invariant cache hit.
[2024-05-31 15:50:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:50:45] [INFO ] After 1522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:50:45] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:50:47] [INFO ] After 2312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:50:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:50:52] [INFO ] After 4827ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:50:54] [INFO ] After 6354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1767 ms.
[2024-05-31 15:50:56] [INFO ] After 10493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217387 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217387 steps, saw 75179 distinct states, run finished after 3003 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 15:50:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-31 15:50:59] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 15:50:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:50:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:51:00] [INFO ] After 902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:51:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 15:51:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:51:01] [INFO ] After 1215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:51:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:51:09] [INFO ] After 8011ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 15:51:09] [INFO ] After 8132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-31 15:51:09] [INFO ] After 9581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 169 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 168 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2024-05-31 15:51:10] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:51:10] [INFO ] Invariant cache hit.
[2024-05-31 15:51:10] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-31 15:51:10] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:51:10] [INFO ] Invariant cache hit.
[2024-05-31 15:51:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:51:18] [INFO ] Implicit Places using invariants and state equation in 7494 ms returned []
Implicit Place search using SMT with State Equation took 7923 ms to find 0 implicit places.
[2024-05-31 15:51:18] [INFO ] Redundant transitions in 810 ms returned []
[2024-05-31 15:51:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2024-05-31 15:51:18] [INFO ] Invariant cache hit.
[2024-05-31 15:51:20] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10739 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 192 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2024-05-31 15:51:20] [INFO ] Computed 2 invariants in 17 ms
[2024-05-31 15:51:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:51:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:51:21] [INFO ] After 870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 15:51:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 15:51:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:51:22] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 15:51:22] [INFO ] After 1100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 615 ms.
[2024-05-31 15:51:23] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 378 ms.
Product exploration explored 100000 steps with 4 reset in 421 ms.
Built C files in :
/tmp/ltsmin17492790194716951262
[2024-05-31 15:51:24] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:51:24] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17492790194716951262
Running compilation step : cd /tmp/ltsmin17492790194716951262;'/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/ltsmin17492790194716951262;'/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/ltsmin17492790194716951262;'/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 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-31 15:51:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-31 15:51:28] [INFO ] Computed 1 invariants in 21 ms
[2024-05-31 15:51:28] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-31 15:51:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:51:28] [INFO ] Invariant cache hit.
[2024-05-31 15:51:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:51:35] [INFO ] Implicit Places using invariants and state equation in 7127 ms returned []
Implicit Place search using SMT with State Equation took 7556 ms to find 0 implicit places.
[2024-05-31 15:51:36] [INFO ] Redundant transitions in 766 ms returned []
[2024-05-31 15:51:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-31 15:51:36] [INFO ] Invariant cache hit.
[2024-05-31 15:51:38] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10354 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin960775068022249165
[2024-05-31 15:51:38] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:51:38] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin960775068022249165
Running compilation step : cd /tmp/ltsmin960775068022249165;'/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/ltsmin960775068022249165;'/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/ltsmin960775068022249165;'/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-31 15:51:41] [INFO ] Flatten gal took : 171 ms
[2024-05-31 15:51:41] [INFO ] Flatten gal took : 176 ms
[2024-05-31 15:51:41] [INFO ] Time to serialize gal into /tmp/LTL14904274731464190171.gal : 23 ms
[2024-05-31 15:51:41] [INFO ] Time to serialize properties into /tmp/LTL4911532177797767564.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/LTL14904274731464190171.gal' '-t' 'CGAL' '-hoa' '/tmp/aut516877511206856481.hoa' '-atoms' '/tmp/LTL4911532177797767564.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/LTL4911532177797767564.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut516877511206856481.hoa
Detected timeout of ITS tools.
[2024-05-31 15:51:57] [INFO ] Flatten gal took : 174 ms
[2024-05-31 15:51:57] [INFO ] Flatten gal took : 179 ms
[2024-05-31 15:51:57] [INFO ] Time to serialize gal into /tmp/LTL15327803075111471757.gal : 24 ms
[2024-05-31 15:51:57] [INFO ] Time to serialize properties into /tmp/LTL13683302489454318270.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/LTL15327803075111471757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13683302489454318270.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(G((X(F(("((p32>=1)&&(l23>=1))")||(G("((p99<1)||(l50<1))")))))||("((p126>=1)&&(l5>=1))")))))
Formula 0 simplified : XF(!"((p126>=1)&&(l5>=1))" & XG(!"((p32>=1)&&(l23>=1))" & F!"((p99<1)||(l50<1))"))
Detected timeout of ITS tools.
[2024-05-31 15:52:12] [INFO ] Flatten gal took : 167 ms
[2024-05-31 15:52:12] [INFO ] Applying decomposition
[2024-05-31 15:52:12] [INFO ] Flatten gal took : 175 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/graph4512756174507925967.txt' '-o' '/tmp/graph4512756174507925967.bin' '-w' '/tmp/graph4512756174507925967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4512756174507925967.bin' '-l' '-1' '-v' '-w' '/tmp/graph4512756174507925967.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:52:13] [INFO ] Decomposing Gal with order
[2024-05-31 15:52:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:52:13] [INFO ] Removed a total of 17839 redundant transitions.
[2024-05-31 15:52:13] [INFO ] Flatten gal took : 315 ms
[2024-05-31 15:52:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1017 labels/synchronizations in 171 ms.
[2024-05-31 15:52:13] [INFO ] Time to serialize gal into /tmp/LTL18032001585372354279.gal : 19 ms
[2024-05-31 15:52:13] [INFO ] Time to serialize properties into /tmp/LTL7323723765144582000.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/LTL18032001585372354279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7323723765144582000.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F(("((i1.u46.p32>=1)&&(i5.u53.l23>=1))")||(G("((i1.u33.p99<1)||(i8.i1.u61.l50<1))")))))||("((i2.u43.p126>=1)&&(i1.u46.l5>=1)...162
Formula 0 simplified : XF(!"((i2.u43.p126>=1)&&(i1.u46.l5>=1))" & XG(!"((i1.u46.p32>=1)&&(i5.u53.l23>=1))" & F!"((i1.u33.p99<1)||(i8.i1.u61.l50<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12024796836782840285
[2024-05-31 15:52:28] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12024796836782840285
Running compilation step : cd /tmp/ltsmin12024796836782840285;'/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/ltsmin12024796836782840285;'/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/ltsmin12024796836782840285;'/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 Szymanski-PT-b04-LTLFireability-10 finished in 213335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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((!p0&&X(X(G(p1))))) U G(!p2))))'
Found a Lengthening insensitive property : Szymanski-PT-b04-LTLFireability-14
Stuttering acceptance computed with spot in 366 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 43 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:52:32] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:52:32] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 15:52:32] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-31 15:52:32] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:52:32] [INFO ] Invariant cache hit.
[2024-05-31 15:52:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:52:37] [INFO ] Implicit Places using invariants and state equation in 4449 ms returned []
Implicit Place search using SMT with State Equation took 4872 ms to find 0 implicit places.
[2024-05-31 15:52:37] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:52:37] [INFO ] Invariant cache hit.
[2024-05-31 15:52:39] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6768 ms. Remains : 306/306 places, 8064/8064 transitions.
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 6}, { cond=(NOT p2), acceptance={} source=8 dest: 9}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p2 p1), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s286 1)), p0:(AND (GEQ s19 1) (GEQ s302 1)), p1:(AND (GEQ s39 1) (GEQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 363 ms.
Product exploration explored 100000 steps with 0 reset in 370 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 135 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 15:52:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:52:40] [INFO ] Invariant cache hit.
[2024-05-31 15:52:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:52:42] [INFO ] After 1201ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-31 15:52:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:52:49] [INFO ] After 7465ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-05-31 15:52:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:53:03] [INFO ] After 13617ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2024-05-31 15:53:07] [INFO ] After 17429ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 15:53:07] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 306 transition count 7941
Applied a total of 123 rules in 179 ms. Remains 306 /306 variables (removed 0) and now considering 7941/8064 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 306/306 places, 7941/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 147368 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147368 steps, saw 59108 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-31 15:53:10] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
// Phase 1: matrix 2610 rows 306 cols
[2024-05-31 15:53:10] [INFO ] Computed 1 invariants in 12 ms
[2024-05-31 15:53:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:53:12] [INFO ] After 1765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 15:53:12] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:53:14] [INFO ] After 2165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 15:53:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:53:22] [INFO ] After 7954ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-31 15:53:27] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 1 ms to minimize.
[2024-05-31 15:53:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-05-31 15:53:30] [INFO ] After 15677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7056 ms.
[2024-05-31 15:53:37] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 44 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7941/7941 transitions.
Applied a total of 0 rules in 173 ms. Remains 306 /306 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 306/306 places, 7941/7941 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7941/7941 transitions.
Applied a total of 0 rules in 173 ms. Remains 306 /306 variables (removed 0) and now considering 7941/7941 (removed 0) transitions.
[2024-05-31 15:53:37] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:53:37] [INFO ] Invariant cache hit.
[2024-05-31 15:53:38] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 15:53:38] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:53:38] [INFO ] Invariant cache hit.
[2024-05-31 15:53:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:53:48] [INFO ] Implicit Places using invariants and state equation in 10571 ms returned []
Implicit Place search using SMT with State Equation took 10978 ms to find 0 implicit places.
[2024-05-31 15:53:49] [INFO ] Redundant transitions in 824 ms returned []
[2024-05-31 15:53:49] [INFO ] Flow matrix only has 2610 transitions (discarded 5331 similar events)
[2024-05-31 15:53:49] [INFO ] Invariant cache hit.
[2024-05-31 15:53:51] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13796 ms. Remains : 306/306 places, 7941/7941 transitions.
Graph (trivial) has 4848 edges and 306 vertex of which 36 / 306 are part of one of the 2 SCC in 1 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1753 transitions
Reduce isomorphic transitions removed 5569 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 2371
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 2370
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 271 transition count 1954
Applied a total of 420 rules in 113 ms. Remains 271 /306 variables (removed 35) and now considering 1954/7941 (removed 5987) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1954 rows 271 cols
[2024-05-31 15:53:51] [INFO ] Computed 1 invariants in 14 ms
[2024-05-31 15:53:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:53:52] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 15:53:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:53:53] [INFO ] After 1060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-31 15:53:53] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:53:57] [INFO ] After 3971ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-31 15:54:10] [INFO ] After 16829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6209 ms.
[2024-05-31 15:54:16] [INFO ] After 24197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (G (NOT (AND p0 p2))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 243 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 410 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 32 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:54:17] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:54:17] [INFO ] Computed 1 invariants in 22 ms
[2024-05-31 15:54:17] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-31 15:54:17] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:54:17] [INFO ] Invariant cache hit.
[2024-05-31 15:54:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:54:22] [INFO ] Implicit Places using invariants and state equation in 4976 ms returned []
Implicit Place search using SMT with State Equation took 5403 ms to find 0 implicit places.
[2024-05-31 15:54:22] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:54:22] [INFO ] Invariant cache hit.
[2024-05-31 15:54:24] [INFO ] Dead Transitions using invariants and state equation in 1847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7284 ms. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
[2024-05-31 15:54:25] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:54:25] [INFO ] Invariant cache hit.
[2024-05-31 15:54:25] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:54:27] [INFO ] After 2672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:54:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:54:30] [INFO ] After 2568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 15:54:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:54:46] [INFO ] After 15720ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 15:54:51] [INFO ] After 20999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1370 ms.
[2024-05-31 15:54:53] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 306 transition count 7940
Applied a total of 124 rules in 182 ms. Remains 306 /306 variables (removed 0) and now considering 7940/8064 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 306/306 places, 7940/8064 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 169684 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169684 steps, saw 65698 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 15:54:56] [INFO ] Flow matrix only has 2609 transitions (discarded 5331 similar events)
// Phase 1: matrix 2609 rows 306 cols
[2024-05-31 15:54:56] [INFO ] Computed 1 invariants in 16 ms
[2024-05-31 15:54:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:54:58] [INFO ] After 2367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:54:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:55:01] [INFO ] After 3062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 15:55:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:55:09] [INFO ] After 7503ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-31 15:55:18] [INFO ] After 17121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4749 ms.
[2024-05-31 15:55:23] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7940/7940 transitions.
Applied a total of 0 rules in 183 ms. Remains 306 /306 variables (removed 0) and now considering 7940/7940 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 306/306 places, 7940/7940 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7940/7940 transitions.
Applied a total of 0 rules in 174 ms. Remains 306 /306 variables (removed 0) and now considering 7940/7940 (removed 0) transitions.
[2024-05-31 15:55:24] [INFO ] Flow matrix only has 2609 transitions (discarded 5331 similar events)
[2024-05-31 15:55:24] [INFO ] Invariant cache hit.
[2024-05-31 15:55:24] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-31 15:55:24] [INFO ] Flow matrix only has 2609 transitions (discarded 5331 similar events)
[2024-05-31 15:55:24] [INFO ] Invariant cache hit.
[2024-05-31 15:55:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:55:32] [INFO ] Implicit Places using invariants and state equation in 7528 ms returned []
Implicit Place search using SMT with State Equation took 7932 ms to find 0 implicit places.
[2024-05-31 15:55:32] [INFO ] Redundant transitions in 822 ms returned []
[2024-05-31 15:55:32] [INFO ] Flow matrix only has 2609 transitions (discarded 5331 similar events)
[2024-05-31 15:55:32] [INFO ] Invariant cache hit.
[2024-05-31 15:55:34] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10805 ms. Remains : 306/306 places, 7940/7940 transitions.
Graph (trivial) has 4944 edges and 306 vertex of which 36 / 306 are part of one of the 2 SCC in 0 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1753 transitions
Reduce isomorphic transitions removed 5569 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 2370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 2369
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 271 transition count 1953
Applied a total of 420 rules in 117 ms. Remains 271 /306 variables (removed 35) and now considering 1953/7940 (removed 5987) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1953 rows 271 cols
[2024-05-31 15:55:34] [INFO ] Computed 1 invariants in 18 ms
[2024-05-31 15:55:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 15:55:35] [INFO ] After 865ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 15:55:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 15:55:36] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 15:55:36] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-31 15:55:37] [INFO ] After 1265ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-31 15:55:39] [INFO ] After 3181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1094 ms.
[2024-05-31 15:55:40] [INFO ] After 5022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (AND (NOT p2) p1))]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 347 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 359 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Product exploration explored 100000 steps with 1 reset in 382 ms.
Product exploration explored 100000 steps with 4 reset in 411 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, false, true]
Stuttering acceptance computed with spot in 380 ms :[p2, p2, (OR (NOT p1) p0), (OR (AND (NOT p1) p2) (AND p0 p2)), true, (NOT p1), (NOT p1), p2, (AND (NOT p1) p2), p2]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 177 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:55:44] [INFO ] Redundant transitions in 797 ms returned []
[2024-05-31 15:55:44] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-05-31 15:55:44] [INFO ] Computed 1 invariants in 20 ms
[2024-05-31 15:55:46] [INFO ] Dead Transitions using invariants and state equation in 1912 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2895 ms. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin9636790453150451896
[2024-05-31 15:55:46] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9636790453150451896
Running compilation step : cd /tmp/ltsmin9636790453150451896;'/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/ltsmin9636790453150451896;'/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/ltsmin9636790453150451896;'/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 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 28 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2024-05-31 15:55:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:55:49] [INFO ] Invariant cache hit.
[2024-05-31 15:55:49] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-31 15:55:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:55:49] [INFO ] Invariant cache hit.
[2024-05-31 15:55:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:55:55] [INFO ] Implicit Places using invariants and state equation in 6049 ms returned []
Implicit Place search using SMT with State Equation took 6454 ms to find 0 implicit places.
[2024-05-31 15:55:55] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-31 15:55:55] [INFO ] Invariant cache hit.
[2024-05-31 15:55:57] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8422 ms. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin12285892536226189501
[2024-05-31 15:55:57] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12285892536226189501
Running compilation step : cd /tmp/ltsmin12285892536226189501;'/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/ltsmin12285892536226189501;'/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/ltsmin12285892536226189501;'/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-31 15:56:01] [INFO ] Flatten gal took : 168 ms
[2024-05-31 15:56:01] [INFO ] Flatten gal took : 172 ms
[2024-05-31 15:56:01] [INFO ] Time to serialize gal into /tmp/LTL1096090079880983118.gal : 22 ms
[2024-05-31 15:56:01] [INFO ] Time to serialize properties into /tmp/LTL10230869565256385447.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/LTL1096090079880983118.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15131260164725235735.hoa' '-atoms' '/tmp/LTL10230869565256385447.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10230869565256385447.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15131260164725235735.hoa
Detected timeout of ITS tools.
[2024-05-31 15:56:16] [INFO ] Flatten gal took : 171 ms
[2024-05-31 15:56:16] [INFO ] Flatten gal took : 177 ms
[2024-05-31 15:56:16] [INFO ] Time to serialize gal into /tmp/LTL6469007556116825663.gal : 24 ms
[2024-05-31 15:56:16] [INFO ] Time to serialize properties into /tmp/LTL12157245081201973227.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/LTL6469007556116825663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12157245081201973227.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((!("((p19>=1)&&(l48>=1))"))&&(X(X(G("((p39>=1)&&(l9>=1))"))))))U(G(!("((p13>=1)&&(l32>=1))"))))))
Formula 0 simplified : X(X("((p19>=1)&&(l48>=1))" | XXF!"((p39>=1)&&(l9>=1))") R F"((p13>=1)&&(l32>=1))")
Detected timeout of ITS tools.
[2024-05-31 15:56:32] [INFO ] Flatten gal took : 172 ms
[2024-05-31 15:56:32] [INFO ] Applying decomposition
[2024-05-31 15:56:32] [INFO ] Flatten gal took : 181 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/graph14758917719858656764.txt' '-o' '/tmp/graph14758917719858656764.bin' '-w' '/tmp/graph14758917719858656764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14758917719858656764.bin' '-l' '-1' '-v' '-w' '/tmp/graph14758917719858656764.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:56:32] [INFO ] Decomposing Gal with order
[2024-05-31 15:56:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:56:32] [INFO ] Removed a total of 18396 redundant transitions.
[2024-05-31 15:56:32] [INFO ] Flatten gal took : 315 ms
[2024-05-31 15:56:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1222 labels/synchronizations in 183 ms.
[2024-05-31 15:56:33] [INFO ] Time to serialize gal into /tmp/LTL15004348382936422320.gal : 19 ms
[2024-05-31 15:56:33] [INFO ] Time to serialize properties into /tmp/LTL4052224956859211993.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/LTL15004348382936422320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4052224956859211993.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...255
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i0.i1.u6.p19>=1)&&(i8.u62.l48>=1))"))&&(X(X(G("((i8.u12.p39>=1)&&(i4.u48.l9>=1))"))))))U(G(!("((i3.i0.u5.p13>=1)&&(i2.i1...175
Formula 0 simplified : X(X("((i0.i1.u6.p19>=1)&&(i8.u62.l48>=1))" | XXF!"((i8.u12.p39>=1)&&(i4.u48.l9>=1))") R F"((i3.i0.u5.p13>=1)&&(i2.i1.u56.l32>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12313047308607852433
[2024-05-31 15:56:48] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12313047308607852433
Running compilation step : cd /tmp/ltsmin12313047308607852433;'/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/ltsmin12313047308607852433;'/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/ltsmin12313047308607852433;'/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 Szymanski-PT-b04-LTLFireability-14 finished in 259363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2024-05-31 15:56:51] [INFO ] Flatten gal took : 170 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12629514728596685284
[2024-05-31 15:56:51] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2024-05-31 15:56:51] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12629514728596685284
Running compilation step : cd /tmp/ltsmin12629514728596685284;'/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-31 15:56:51] [INFO ] Applying decomposition
[2024-05-31 15:56:51] [INFO ] Flatten gal took : 181 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/graph3649306394720422518.txt' '-o' '/tmp/graph3649306394720422518.bin' '-w' '/tmp/graph3649306394720422518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3649306394720422518.bin' '-l' '-1' '-v' '-w' '/tmp/graph3649306394720422518.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:56:52] [INFO ] Decomposing Gal with order
[2024-05-31 15:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:56:52] [INFO ] Removed a total of 18093 redundant transitions.
[2024-05-31 15:56:52] [INFO ] Flatten gal took : 318 ms
[2024-05-31 15:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1046 labels/synchronizations in 177 ms.
[2024-05-31 15:56:52] [INFO ] Time to serialize gal into /tmp/LTLFireability14898573886794798264.gal : 19 ms
[2024-05-31 15:56:52] [INFO ] Time to serialize properties into /tmp/LTLFireability9889875027140500355.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/LTLFireability14898573886794798264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9889875027140500355.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...277
Read 6 LTL properties
Checking formula 0 : !((F(G("((i2.i1.u54.p104<1)||(i0.u61.l50<1))"))))
Formula 0 simplified : GF!"((i2.i1.u54.p104<1)||(i0.u61.l50<1))"
Compilation finished in 31656 ms.
Running link step : cd /tmp/ltsmin12629514728596685284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin12629514728596685284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin12629514728596685284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12629514728596685284;'/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(((LTLAPp1==true)||[]((LTLAPp2==true))||X(((LTLAPp3==true)||X(<>((LTLAPp4==true)))))))' '--buchi-type=spotba'
LTSmin run took 1013 ms.
FORMULA Szymanski-PT-b04-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12629514728596685284;'/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([](((LTLAPp5==true)||X(<>(((LTLAPp6==true)||[]((LTLAPp7==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin12629514728596685284;'/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([](((LTLAPp5==true)||X(<>(((LTLAPp6==true)||[]((LTLAPp7==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12629514728596685284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp8==true))||[]((LTLAPp9==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3279784 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14205536 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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