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.r087-tall-171620521500098.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 CANInsertWithFailure-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716238749950

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=CANInsertWithFailure-PT-080
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 20:59:11] [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-20 20:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:59:12] [INFO ] Load time of PNML (sax parser for PT used): 906 ms
[2024-05-20 20:59:12] [INFO ] Transformed 13764 places.
[2024-05-20 20:59:12] [INFO ] Transformed 38880 transitions.
[2024-05-20 20:59:12] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1083 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4549 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 20:59:26] [INFO ] Computed 82 invariants in 9167 ms
[2024-05-20 20:59:28] [INFO ] Implicit Places using invariants in 10706 ms returned []
Implicit Place search using SMT only with invariants took 10732 ms to find 0 implicit places.
[2024-05-20 20:59:28] [INFO ] Invariant cache hit.
[2024-05-20 20:59:29] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16445 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 44 out of 13763 places after structural reductions.
[2024-05-20 20:59:30] [INFO ] Flatten gal took : 1167 ms
[2024-05-20 20:59:31] [INFO ] Flatten gal took : 892 ms
[2024-05-20 20:59:33] [INFO ] Input system was already deterministic with 38880 transitions.
Support contains 42 out of 13763 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 32) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) 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 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 5 ms. (steps per millisecond=200 ) 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 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2024-05-20 20:59:34] [INFO ] Invariant cache hit.
[2024-05-20 20:59:40] [INFO ] [Real]Absence check using 80 positive place invariants in 129 ms returned sat
[2024-05-20 20:59:40] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 261 ms returned sat
[2024-05-20 20:59:59] [INFO ] After 14309ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:22
[2024-05-20 20:59:59] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:59:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:59:59] [INFO ] After 25204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 13763 transition count 38326
Reduce places removed 554 places and 0 transitions.
Iterating post reduction 1 with 554 rules applied. Total rules applied 1108 place count 13209 transition count 38326
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1108 place count 13209 transition count 38324
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1112 place count 13207 transition count 38324
Performed 6299 Post agglomeration using F-continuation condition.Transition count delta: 6299
Deduced a syphon composed of 6299 places in 29 ms
Reduce places removed 6299 places and 0 transitions.
Iterating global reduction 2 with 12598 rules applied. Total rules applied 13710 place count 6908 transition count 32025
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13715 place count 6908 transition count 32020
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 13720 place count 6903 transition count 32020
Partial Free-agglomeration rule applied 6476 times.
Drop transitions removed 6476 transitions
Iterating global reduction 3 with 6476 rules applied. Total rules applied 20196 place count 6903 transition count 32020
Partial Free-agglomeration rule applied 161 times.
Drop transitions removed 161 transitions
Iterating global reduction 3 with 161 rules applied. Total rules applied 20357 place count 6903 transition count 32020
Applied a total of 20357 rules in 17063 ms. Remains 6903 /13763 variables (removed 6860) and now considering 32020/38880 (removed 6860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17065 ms. Remains : 6903/13763 places, 32020/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-20 21:00:17] [INFO ] Flow matrix only has 32013 transitions (discarded 7 similar events)
// Phase 1: matrix 32013 rows 6903 cols
[2024-05-20 21:00:19] [INFO ] Computed 82 invariants in 1985 ms
[2024-05-20 21:00:21] [INFO ] [Real]Absence check using 80 positive place invariants in 71 ms returned sat
[2024-05-20 21:00:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 112 ms returned sat
[2024-05-20 21:00:44] [INFO ] After 20998ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19
[2024-05-20 21:00:44] [INFO ] State equation strengthened by 31708 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:00:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:00:44] [INFO ] After 25305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 22 out of 6903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6903/6903 places, 32020/32020 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 6897 transition count 32014
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 6897 transition count 32014
Applied a total of 14 rules in 6581 ms. Remains 6897 /6903 variables (removed 6) and now considering 32014/32020 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6582 ms. Remains : 6897/6903 places, 32014/32020 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 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 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 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 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 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 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 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 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 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 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 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 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
Running SMT prover for 16 properties.
[2024-05-20 21:00:51] [INFO ] Flow matrix only has 32009 transitions (discarded 5 similar events)
// Phase 1: matrix 32009 rows 6897 cols
[2024-05-20 21:00:53] [INFO ] Computed 82 invariants in 1859 ms
[2024-05-20 21:00:55] [INFO ] [Real]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:00:55] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:01:18] [INFO ] After 21676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-05-20 21:01:19] [INFO ] State equation strengthened by 31720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:01:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:01:19] [INFO ] After 25374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 18 out of 6897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6897/6897 places, 32014/32014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6895 transition count 32012
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 6895 transition count 32012
Applied a total of 5 rules in 6049 ms. Remains 6895 /6897 variables (removed 2) and now considering 32012/32014 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6050 ms. Remains : 6895/6897 places, 32012/32014 transitions.
Computed a total of 322 stabilizing places and 560 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' '!((F(p0)||G(p1)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 14 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8322 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-20 21:01:33] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-20 21:01:38] [INFO ] Computed 82 invariants in 4449 ms
[2024-05-20 21:01:40] [INFO ] Implicit Places using invariants in 6219 ms returned []
Implicit Place search using SMT only with invariants took 6222 ms to find 0 implicit places.
[2024-05-20 21:01:40] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-20 21:01:40] [INFO ] Invariant cache hit.
[2024-05-20 21:02:00] [INFO ] Dead Transitions using invariants and state equation in 20322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34874 ms. Remains : 6885/13763 places, 32002/38880 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 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s4073 1), p1:(GEQ s3652 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 387 steps with 0 reset in 34 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-00 finished in 35218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(p0 U p1))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 13763 transition count 38402
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 13285 transition count 38401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 13284 transition count 38401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 958 place count 13284 transition count 38400
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 960 place count 13283 transition count 38400
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 21 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 3 with 12638 rules applied. Total rules applied 13598 place count 6964 transition count 32081
Applied a total of 13598 rules in 8633 ms. Remains 6964 /13763 variables (removed 6799) and now considering 32081/38880 (removed 6799) transitions.
[2024-05-20 21:02:09] [INFO ] Flow matrix only has 25919 transitions (discarded 6162 similar events)
// Phase 1: matrix 25919 rows 6964 cols
[2024-05-20 21:02:13] [INFO ] Computed 82 invariants in 4069 ms
[2024-05-20 21:02:15] [INFO ] Implicit Places using invariants in 5762 ms returned []
Implicit Place search using SMT only with invariants took 5764 ms to find 0 implicit places.
[2024-05-20 21:02:15] [INFO ] Flow matrix only has 25919 transitions (discarded 6162 similar events)
[2024-05-20 21:02:15] [INFO ] Invariant cache hit.
[2024-05-20 21:02:35] [INFO ] Dead Transitions using invariants and state equation in 20153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6964/13763 places, 32081/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34563 ms. Remains : 6964/13763 places, 32081/38880 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s61 1) (GEQ s476 1)), p1:(AND (GEQ s0 1) (GEQ s480 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 397 steps with 0 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-01 finished in 34751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3573 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:02:47] [INFO ] Computed 82 invariants in 8738 ms
[2024-05-20 21:02:49] [INFO ] Implicit Places using invariants in 9986 ms returned []
Implicit Place search using SMT only with invariants took 9988 ms to find 0 implicit places.
[2024-05-20 21:02:49] [INFO ] Invariant cache hit.
[2024-05-20 21:02:50] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14684 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s1930 1), p1:(AND (LT s11334 1) (GEQ s8377 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 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-02 finished in 14895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 16 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8084 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-20 21:02:58] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-20 21:03:03] [INFO ] Computed 82 invariants in 4424 ms
[2024-05-20 21:03:04] [INFO ] Implicit Places using invariants in 6089 ms returned []
Implicit Place search using SMT only with invariants took 6092 ms to find 0 implicit places.
[2024-05-20 21:03:04] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-20 21:03:04] [INFO ] Invariant cache hit.
[2024-05-20 21:03:24] [INFO ] Dead Transitions using invariants and state equation in 20221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34400 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s4973 1) (LT s3834 1)), p0:(LT s3834 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 249 reset in 2756 ms.
Product exploration explored 100000 steps with 250 reset in 2685 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:03:31] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-20 21:03:31] [INFO ] Invariant cache hit.
[2024-05-20 21:03:31] [INFO ] [Real]Absence check using 80 positive place invariants in 101 ms returned sat
[2024-05-20 21:03:31] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 108 ms returned sat
[2024-05-20 21:03:43] [INFO ] After 11501ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:03:43] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2024-05-20 21:03:45] [INFO ] After 2061ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:03:45] [INFO ] After 14661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:03:46] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:03:46] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:04:00] [INFO ] After 13897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:04:02] [INFO ] After 2097ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:04:03] [INFO ] After 2947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 586 ms.
[2024-05-20 21:04:04] [INFO ] After 18341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 5532 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5534 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73412 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73412 steps, saw 63943 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2024-05-20 21:04:14] [INFO ] Computed 82 invariants in 1995 ms
[2024-05-20 21:04:15] [INFO ] [Real]Absence check using 80 positive place invariants in 67 ms returned sat
[2024-05-20 21:04:15] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:04:32] [INFO ] After 16299ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:04:32] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:04:40] [INFO ] After 7649ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-20 21:04:40] [INFO ] After 7649ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 21:04:40] [INFO ] After 25126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2085 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2086 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2070 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:04:44] [INFO ] Invariant cache hit.
[2024-05-20 21:04:50] [INFO ] Implicit Places using invariants in 6349 ms returned []
Implicit Place search using SMT only with invariants took 6351 ms to find 0 implicit places.
[2024-05-20 21:04:50] [INFO ] Invariant cache hit.
[2024-05-20 21:05:09] [INFO ] Dead Transitions using invariants and state equation in 19043 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27471 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Graph (trivial) has 31514 edges and 6884 vertex of which 6559 / 6884 are part of one of the 2 SCC in 17 ms
Free SCC test removed 6557 places
Drop transitions removed 25197 transitions
Ensure Unique test removed 6472 transitions
Reduce isomorphic transitions removed 31669 transitions.
Graph (complete) has 814 edges and 327 vertex of which 86 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.0 ms
Discarding 241 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Drop transitions removed 161 transitions
Reduce isomorphic transitions removed 161 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 162 rules applied. Total rules applied 164 place count 86 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 165 place count 85 transition count 91
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 243 place count 7 transition count 13
Iterating global reduction 2 with 78 rules applied. Total rules applied 321 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 5 transition count 8
Applied a total of 327 rules in 128 ms. Remains 5 /6884 variables (removed 6879) and now considering 8/32001 (removed 31993) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 21:05:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 21:05:09] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:05:09] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 21:05:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2301 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-20 21:05:12] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-20 21:05:16] [INFO ] Computed 82 invariants in 4399 ms
[2024-05-20 21:05:18] [INFO ] Implicit Places using invariants in 6074 ms returned []
Implicit Place search using SMT only with invariants took 6075 ms to find 0 implicit places.
[2024-05-20 21:05:18] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-20 21:05:18] [INFO ] Invariant cache hit.
[2024-05-20 21:05:38] [INFO ] Dead Transitions using invariants and state equation in 19579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27956 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 54581 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54581 steps, saw 46188 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 21:05:41] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-20 21:05:41] [INFO ] Invariant cache hit.
[2024-05-20 21:05:42] [INFO ] [Real]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 21:05:42] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 21:05:54] [INFO ] After 11903ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 21:05:54] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2024-05-20 21:05:57] [INFO ] After 2223ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:05:57] [INFO ] After 15260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:05:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:05:57] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:06:11] [INFO ] After 13481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 21:06:14] [INFO ] After 2698ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 21:06:16] [INFO ] After 4411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1219 ms.
[2024-05-20 21:06:17] [INFO ] After 20142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 7294 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7295 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2024-05-20 21:06:27] [INFO ] Computed 82 invariants in 2056 ms
[2024-05-20 21:06:27] [INFO ] [Real]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:06:27] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 105 ms returned sat
[2024-05-20 21:06:43] [INFO ] After 15746ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:06:43] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:06:51] [INFO ] After 7699ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:06:51] [INFO ] After 24584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:06:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:06:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:07:08] [INFO ] After 16109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:07:12] [INFO ] After 4192ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:07:13] [INFO ] After 5319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 799 ms.
[2024-05-20 21:07:14] [INFO ] After 23093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2148 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2149 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73184 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73184 steps, saw 63918 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:07:20] [INFO ] Invariant cache hit.
[2024-05-20 21:07:20] [INFO ] [Real]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 21:07:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:07:36] [INFO ] After 15232ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:07:36] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:07:40] [INFO ] After 4138ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:07:40] [INFO ] After 20511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:07:41] [INFO ] [Nat]Absence check using 80 positive place invariants in 59 ms returned sat
[2024-05-20 21:07:41] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:07:59] [INFO ] After 17728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:08:03] [INFO ] After 4083ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:08:04] [INFO ] After 5196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 808 ms.
[2024-05-20 21:08:05] [INFO ] After 24572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2198 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2198 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2191 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:08:09] [INFO ] Invariant cache hit.
[2024-05-20 21:08:16] [INFO ] Implicit Places using invariants in 6403 ms returned []
Implicit Place search using SMT only with invariants took 6404 ms to find 0 implicit places.
[2024-05-20 21:08:16] [INFO ] Invariant cache hit.
[2024-05-20 21:08:36] [INFO ] Dead Transitions using invariants and state equation in 20490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29089 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 248 reset in 2604 ms.
Product exploration explored 100000 steps with 250 reset in 2703 ms.
Built C files in :
/tmp/ltsmin3123185376786054166
[2024-05-20 21:08:42] [INFO ] Too many transitions (32002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:08:42] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3123185376786054166
Running compilation step : cd /tmp/ltsmin3123185376786054166;'/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/ltsmin3123185376786054166;'/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/ltsmin3123185376786054166;'/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 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1730 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-20 21:08:47] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2024-05-20 21:08:51] [INFO ] Computed 82 invariants in 4353 ms
[2024-05-20 21:08:53] [INFO ] Implicit Places using invariants in 6014 ms returned []
Implicit Place search using SMT only with invariants took 6015 ms to find 0 implicit places.
[2024-05-20 21:08:53] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2024-05-20 21:08:53] [INFO ] Invariant cache hit.
[2024-05-20 21:09:13] [INFO ] Dead Transitions using invariants and state equation in 20168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27914 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Built C files in :
/tmp/ltsmin14032691008577108786
[2024-05-20 21:09:13] [INFO ] Too many transitions (32002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:09:13] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14032691008577108786
Running compilation step : cd /tmp/ltsmin14032691008577108786;'/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/ltsmin14032691008577108786;'/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/ltsmin14032691008577108786;'/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-20 21:09:18] [INFO ] Flatten gal took : 545 ms
[2024-05-20 21:09:18] [INFO ] Flatten gal took : 532 ms
[2024-05-20 21:09:18] [INFO ] Time to serialize gal into /tmp/LTL17544507321490254633.gal : 153 ms
[2024-05-20 21:09:18] [INFO ] Time to serialize properties into /tmp/LTL16991843273551477063.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/LTL17544507321490254633.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9906010378207145425.hoa' '-atoms' '/tmp/LTL16991843273551477063.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/LTL16991843273551477063.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9906010378207145425.hoa
Detected timeout of ITS tools.
[2024-05-20 21:09:34] [INFO ] Flatten gal took : 490 ms
[2024-05-20 21:09:35] [INFO ] Flatten gal took : 525 ms
[2024-05-20 21:09:35] [INFO ] Time to serialize gal into /tmp/LTL6685850742548061982.gal : 99 ms
[2024-05-20 21:09:35] [INFO ] Time to serialize properties into /tmp/LTL5713873046982110550.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/LTL6685850742548061982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5713873046982110550.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node41GiveAnswer71<1)")U((G("(Node41GiveAnswer71<1)"))||("((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))"))))))
Formula 0 simplified : FG(!"(Node41GiveAnswer71<1)" M !"((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))")
Detected timeout of ITS tools.
[2024-05-20 21:09:50] [INFO ] Flatten gal took : 487 ms
[2024-05-20 21:09:50] [INFO ] Applying decomposition
[2024-05-20 21:09:51] [INFO ] Flatten gal took : 516 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/graph8989768289242822309.txt' '-o' '/tmp/graph8989768289242822309.bin' '-w' '/tmp/graph8989768289242822309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8989768289242822309.bin' '-l' '-1' '-v' '-w' '/tmp/graph8989768289242822309.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:09:53] [INFO ] Decomposing Gal with order
[2024-05-20 21:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:09:58] [INFO ] Removed a total of 25414 redundant transitions.
[2024-05-20 21:09:58] [INFO ] Flatten gal took : 4295 ms
[2024-05-20 21:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18801 labels/synchronizations in 6042 ms.
[2024-05-20 21:10:05] [INFO ] Time to serialize gal into /tmp/LTL7675057339376025123.gal : 141 ms
[2024-05-20 21:10:05] [INFO ] Time to serialize properties into /tmp/LTL2573346370716710066.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/LTL7675057339376025123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2573346370716710066.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(u72.Node41GiveAnswer71<1)")U((G("(u72.Node41GiveAnswer71<1)"))||("((u9.Node56GiveAnswer8<1)&&(u72.Node41GiveAnswer71<1))")))...158
Formula 0 simplified : FG(!"(u72.Node41GiveAnswer71<1)" M !"((u9.Node56GiveAnswer8<1)&&(u72.Node41GiveAnswer71<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11512393411057339384
[2024-05-20 21:10:20] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11512393411057339384
Running compilation step : cd /tmp/ltsmin11512393411057339384;'/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/ltsmin11512393411057339384;'/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/ltsmin11512393411057339384;'/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 CANInsertWithFailure-PT-080-LTLFireability-03 finished in 453158 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(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(G(p2)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3656 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:10:36] [INFO ] Computed 82 invariants in 9493 ms
[2024-05-20 21:10:38] [INFO ] Implicit Places using invariants in 10664 ms returned []
Implicit Place search using SMT only with invariants took 10666 ms to find 0 implicit places.
[2024-05-20 21:10:38] [INFO ] Invariant cache hit.
[2024-05-20 21:10:39] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15506 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 255 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 2} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=0 dest: 2}, { cond=p2, acceptance={2} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0, 2} source=1 dest: 0}, { cond=p0, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={2} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0, 2} source=3 dest: 0}, { cond=(NOT p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 2}, { cond=p2, acceptance={2} source=3 dest: 3}, { cond=p2, acceptance={1, 2} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 2} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={2} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p2 p1 p0), acceptance={1, 2} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s446 1) (GEQ s847 1)), p1:(AND (GEQ s329 1) (GEQ s11439 1)), p0:(AND (GEQ s936 1) (GEQ s959 1))], nbAcceptance=3, 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]]
Product exploration explored 100000 steps with 33289 reset in 7734 ms.
Product exploration explored 100000 steps with 33399 reset in 7853 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 302 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-20 21:10:56] [INFO ] Invariant cache hit.
[2024-05-20 21:10:59] [INFO ] [Real]Absence check using 80 positive place invariants in 130 ms returned sat
[2024-05-20 21:11:00] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 270 ms returned sat
[2024-05-20 21:11:21] [INFO ] After 20413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2024-05-20 21:11:21] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:11:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:11:21] [INFO ] After 25136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 13763 transition count 38325
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 13208 transition count 38325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 13208 transition count 38323
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 15 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13750 place count 6888 transition count 32005
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13754 place count 6888 transition count 32001
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6482 times.
Drop transitions removed 6482 transitions
Iterating global reduction 3 with 6482 rules applied. Total rules applied 20240 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 3 with 160 rules applied. Total rules applied 20400 place count 6884 transition count 32001
Applied a total of 20400 rules in 14226 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14226 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:11:36] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
// Phase 1: matrix 32000 rows 6884 cols
[2024-05-20 21:11:38] [INFO ] Computed 82 invariants in 2041 ms
[2024-05-20 21:11:39] [INFO ] [Real]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 21:11:39] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 21:11:58] [INFO ] After 18631ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:11:59] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:12:03] [INFO ] After 4575ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:12:03] [INFO ] After 4576ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 21:12:03] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:12:04] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:12:04] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 94 ms returned sat
[2024-05-20 21:12:26] [INFO ] After 20689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:12:28] [INFO ] After 2682ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 21:12:28] [INFO ] After 2685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 21:12:28] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2155 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2156 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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
Interrupted probabilistic random walk after 68219 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68219 steps, saw 62837 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:12:34] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:12:34] [INFO ] Invariant cache hit.
[2024-05-20 21:12:35] [INFO ] [Real]Absence check using 80 positive place invariants in 59 ms returned sat
[2024-05-20 21:12:35] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 96 ms returned sat
[2024-05-20 21:12:54] [INFO ] After 18798ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:12:55] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:12:59] [INFO ] After 4375ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:12:59] [INFO ] After 4377ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 21:12:59] [INFO ] After 25039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:13:00] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:13:00] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:13:20] [INFO ] After 19180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:13:24] [INFO ] After 4141ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 21:13:24] [INFO ] After 4142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 21:13:24] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2155 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2156 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2132 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:13:28] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:13:28] [INFO ] Invariant cache hit.
[2024-05-20 21:13:34] [INFO ] Implicit Places using invariants in 5980 ms returned []
Implicit Place search using SMT only with invariants took 5981 ms to find 0 implicit places.
[2024-05-20 21:13:34] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:13:34] [INFO ] Invariant cache hit.
[2024-05-20 21:13:55] [INFO ] Dead Transitions using invariants and state equation in 20474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28593 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND p2 (NOT p0))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F p2), (F (AND (NOT p2) p0)), (F p1), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 26 factoid took 944 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 236 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3455 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:14:09] [INFO ] Computed 82 invariants in 8666 ms
[2024-05-20 21:14:10] [INFO ] Implicit Places using invariants in 9787 ms returned []
Implicit Place search using SMT only with invariants took 9789 ms to find 0 implicit places.
[2024-05-20 21:14:10] [INFO ] Invariant cache hit.
[2024-05-20 21:14:11] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14358 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 296 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-20 21:14:12] [INFO ] Invariant cache hit.
[2024-05-20 21:14:15] [INFO ] [Real]Absence check using 80 positive place invariants in 130 ms returned sat
[2024-05-20 21:14:16] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 269 ms returned sat
[2024-05-20 21:14:37] [INFO ] After 20591ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2024-05-20 21:14:37] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:14:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:14:37] [INFO ] After 25131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 13763 transition count 38325
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 13208 transition count 38325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 13208 transition count 38323
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 14 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13750 place count 6888 transition count 32005
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13754 place count 6888 transition count 32001
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6482 times.
Drop transitions removed 6482 transitions
Iterating global reduction 3 with 6482 rules applied. Total rules applied 20240 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 3 with 160 rules applied. Total rules applied 20400 place count 6884 transition count 32001
Applied a total of 20400 rules in 14215 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14215 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:14:52] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
// Phase 1: matrix 32000 rows 6884 cols
[2024-05-20 21:14:54] [INFO ] Computed 82 invariants in 2296 ms
[2024-05-20 21:14:56] [INFO ] [Real]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:14:56] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:15:16] [INFO ] After 20047ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:15:16] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:15:19] [INFO ] After 3166ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:15:19] [INFO ] After 3173ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 21:15:19] [INFO ] After 25043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:15:21] [INFO ] [Nat]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:15:21] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 102 ms returned sat
[2024-05-20 21:15:44] [INFO ] After 22803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:15:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:15:45] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3 real:2
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2177 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2177 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 544 ms. (steps per millisecond=18 ) 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 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 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 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 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 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 65467 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65467 steps, saw 62392 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:15:50] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:15:50] [INFO ] Invariant cache hit.
[2024-05-20 21:15:52] [INFO ] [Real]Absence check using 80 positive place invariants in 66 ms returned sat
[2024-05-20 21:15:52] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:16:13] [INFO ] After 20980ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:16:13] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:16:15] [INFO ] After 2060ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:16:15] [INFO ] After 2061ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 21:16:15] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:16:17] [INFO ] [Nat]Absence check using 80 positive place invariants in 66 ms returned sat
[2024-05-20 21:16:17] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 106 ms returned sat
[2024-05-20 21:16:38] [INFO ] After 20969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:16:41] [INFO ] After 2315ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 21:16:41] [INFO ] After 2317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 21:16:41] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2189 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2191 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2153 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:16:45] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:16:45] [INFO ] Invariant cache hit.
[2024-05-20 21:16:51] [INFO ] Implicit Places using invariants in 5920 ms returned []
Implicit Place search using SMT only with invariants took 5921 ms to find 0 implicit places.
[2024-05-20 21:16:51] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:16:51] [INFO ] Invariant cache hit.
[2024-05-20 21:16:51] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8717 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F p0), (F (AND p2 (NOT p0))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F p2), (F (AND (NOT p2) p0)), (F p1), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 26 factoid took 931 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 224 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 237 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Product exploration explored 100000 steps with 33220 reset in 7804 ms.
Product exploration explored 100000 steps with 33388 reset in 7842 ms.
Built C files in :
/tmp/ltsmin1999348270535864565
[2024-05-20 21:17:09] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1999348270535864565
Running compilation step : cd /tmp/ltsmin1999348270535864565;'/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/ltsmin1999348270535864565;'/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/ltsmin1999348270535864565;'/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 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3504 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:17:25] [INFO ] Computed 82 invariants in 8774 ms
[2024-05-20 21:17:26] [INFO ] Implicit Places using invariants in 9918 ms returned []
Implicit Place search using SMT only with invariants took 9920 ms to find 0 implicit places.
[2024-05-20 21:17:26] [INFO ] Invariant cache hit.
[2024-05-20 21:17:27] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14576 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Built C files in :
/tmp/ltsmin11990656651406472882
[2024-05-20 21:17:27] [INFO ] Built C files in 245ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11990656651406472882
Running compilation step : cd /tmp/ltsmin11990656651406472882;'/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/ltsmin11990656651406472882;'/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/ltsmin11990656651406472882;'/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-20 21:17:31] [INFO ] Flatten gal took : 691 ms
[2024-05-20 21:17:32] [INFO ] Flatten gal took : 715 ms
[2024-05-20 21:17:32] [INFO ] Time to serialize gal into /tmp/LTL10242908691636254254.gal : 114 ms
[2024-05-20 21:17:32] [INFO ] Time to serialize properties into /tmp/LTL9417525836417962430.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/LTL10242908691636254254.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3865810821581865938.hoa' '-atoms' '/tmp/LTL9417525836417962430.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/LTL9417525836417962430.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3865810821581865938.hoa
Detected timeout of ITS tools.
[2024-05-20 21:17:48] [INFO ] Flatten gal took : 667 ms
[2024-05-20 21:17:49] [INFO ] Flatten gal took : 720 ms
[2024-05-20 21:17:49] [INFO ] Time to serialize gal into /tmp/LTL1959797853877020293.gal : 101 ms
[2024-05-20 21:17:49] [INFO ] Time to serialize properties into /tmp/LTL14141215163089532588.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/LTL1959797853877020293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14141215163089532588.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(((X(!("((Node66Request>=1)&&(Node68IsInserted>=1))")))U((X(G(!("((Node66Request>=1)&&(Node68IsInserted>=1))"))))||((!("((Node23Is...778
Formula 0 simplified : G(F!"((Node31Request>=1)&&(Node60IsInserted>=1))" U (X"((Node66Request>=1)&&(Node68IsInserted>=1))" R (XF"((Node66Request>=1)&&(Node...281
Detected timeout of ITS tools.
[2024-05-20 21:18:05] [INFO ] Flatten gal took : 746 ms
[2024-05-20 21:18:05] [INFO ] Applying decomposition
[2024-05-20 21:18:06] [INFO ] Flatten gal took : 671 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/graph3238794110864147512.txt' '-o' '/tmp/graph3238794110864147512.bin' '-w' '/tmp/graph3238794110864147512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3238794110864147512.bin' '-l' '-1' '-v' '-w' '/tmp/graph3238794110864147512.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:18:07] [INFO ] Decomposing Gal with order
[2024-05-20 21:18:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:18:12] [INFO ] Removed a total of 19241 redundant transitions.
[2024-05-20 21:18:12] [INFO ] Flatten gal took : 2527 ms
[2024-05-20 21:18:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 27110 labels/synchronizations in 3138 ms.
[2024-05-20 21:18:16] [INFO ] Time to serialize gal into /tmp/LTL14809901173707957606.gal : 145 ms
[2024-05-20 21:18:16] [INFO ] Time to serialize properties into /tmp/LTL3942390813082858549.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/LTL14809901173707957606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3942390813082858549.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(((X(!("((i68.u267.Node66Request>=1)&&(i25.u272.Node68IsInserted>=1))")))U((X(G(!("((i68.u267.Node66Request>=1)&&(i25.u272.Node68I...1018
Formula 0 simplified : G(F!"((i34.u126.Node31Request>=1)&&(i41.u240.Node60IsInserted>=1))" U (X"((i68.u267.Node66Request>=1)&&(i25.u272.Node68IsInserted>=1...373
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2266085062540129977
[2024-05-20 21:18:31] [INFO ] Built C files in 214ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2266085062540129977
Running compilation step : cd /tmp/ltsmin2266085062540129977;'/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/ltsmin2266085062540129977;'/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/ltsmin2266085062540129977;'/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 CANInsertWithFailure-PT-080-LTLFireability-04 finished in 491260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(G(p1)||(p1&&G(F(p2))))))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3648 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:18:38] [INFO ] Invariant cache hit.
[2024-05-20 21:18:39] [INFO ] Implicit Places using invariants in 1098 ms returned []
Implicit Place search using SMT only with invariants took 1103 ms to find 0 implicit places.
[2024-05-20 21:18:39] [INFO ] Invariant cache hit.
[2024-05-20 21:18:40] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5851 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s9946 1), p1:(LT s3386 1), p2:(GEQ s9698 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]]
Product exploration explored 100000 steps with 50 reset in 2212 ms.
Product exploration explored 100000 steps with 52 reset in 2689 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 109671 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109671 steps, saw 107486 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-20 21:18:49] [INFO ] Invariant cache hit.
[2024-05-20 21:18:52] [INFO ] [Real]Absence check using 80 positive place invariants in 124 ms returned sat
[2024-05-20 21:18:52] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 269 ms returned sat
[2024-05-20 21:18:52] [INFO ] After 3064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 21:18:55] [INFO ] [Nat]Absence check using 80 positive place invariants in 123 ms returned sat
[2024-05-20 21:18:55] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 260 ms returned sat
[2024-05-20 21:19:17] [INFO ] After 21337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:19:17] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:19:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:19:17] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 12 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13755 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 3 with 6481 rules applied. Total rules applied 20237 place count 6885 transition count 32002
Applied a total of 20237 rules in 11874 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11876 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 70891 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70891 steps, saw 63584 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 32002 rows 6885 cols
[2024-05-20 21:19:35] [INFO ] Computed 82 invariants in 2010 ms
[2024-05-20 21:19:36] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:19:36] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 105 ms returned sat
[2024-05-20 21:19:37] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 21:19:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:19:38] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:19:59] [INFO ] After 20553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 21:19:59] [INFO ] State equation strengthened by 31754 read => feed constraints.
[2024-05-20 21:20:02] [INFO ] After 2378ms SMT Verify possible using 31754 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 21:20:02] [INFO ] After 2378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 21:20:02] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2171 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2171 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2192 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-20 21:20:06] [INFO ] Invariant cache hit.
[2024-05-20 21:20:12] [INFO ] Implicit Places using invariants in 6125 ms returned []
Implicit Place search using SMT only with invariants took 6125 ms to find 0 implicit places.
[2024-05-20 21:20:12] [INFO ] Invariant cache hit.
[2024-05-20 21:20:33] [INFO ] Dead Transitions using invariants and state equation in 20565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28888 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 10 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 7643 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2024-05-20 21:20:41] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:20:45] [INFO ] Computed 82 invariants in 4046 ms
[2024-05-20 21:20:46] [INFO ] Implicit Places using invariants in 5647 ms returned []
Implicit Place search using SMT only with invariants took 5648 ms to find 0 implicit places.
[2024-05-20 21:20:46] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:20:46] [INFO ] Invariant cache hit.
[2024-05-20 21:21:06] [INFO ] Dead Transitions using invariants and state equation in 19673 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32970 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 139 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 21:21:07] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:21:07] [INFO ] Invariant cache hit.
[2024-05-20 21:21:08] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:21:08] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:21:21] [INFO ] After 12731ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 21:21:21] [INFO ] State equation strengthened by 19115 read => feed constraints.
[2024-05-20 21:21:23] [INFO ] After 2180ms SMT Verify possible using 19115 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:21:23] [INFO ] After 16233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:21:24] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:21:24] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:21:37] [INFO ] After 12831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 21:21:40] [INFO ] After 3191ms SMT Verify possible using 19115 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:21:43] [INFO ] After 5682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1717 ms.
[2024-05-20 21:21:45] [INFO ] After 21415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6885 transition count 32002
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6485 place count 6884 transition count 32001
Applied a total of 6485 rules in 7273 ms. Remains 6884 /6886 variables (removed 2) and now considering 32001/32003 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7275 ms. Remains : 6884/6886 places, 32001/32003 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 70828 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70828 steps, saw 63576 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2024-05-20 21:21:58] [INFO ] Computed 82 invariants in 2241 ms
[2024-05-20 21:21:59] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:21:59] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 96 ms returned sat
[2024-05-20 21:22:14] [INFO ] After 15572ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 21:22:15] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:22:23] [INFO ] After 7852ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:22:23] [INFO ] After 24818ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:22:23] [INFO ] [Nat]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:22:23] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:22:40] [INFO ] After 16097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 21:22:45] [INFO ] After 5589ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:22:48] [INFO ] After 7861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 21:22:48] [INFO ] After 25145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2178 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2178 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2143 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:22:52] [INFO ] Invariant cache hit.
[2024-05-20 21:22:58] [INFO ] Implicit Places using invariants in 6069 ms returned []
Implicit Place search using SMT only with invariants took 6071 ms to find 0 implicit places.
[2024-05-20 21:22:58] [INFO ] Invariant cache hit.
[2024-05-20 21:23:17] [INFO ] Dead Transitions using invariants and state equation in 18885 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27103 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 294 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 247 reset in 2539 ms.
Product exploration explored 100000 steps with 248 reset in 2626 ms.
Built C files in :
/tmp/ltsmin18340980840537159264
[2024-05-20 21:23:23] [INFO ] Too many transitions (32003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:23:23] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18340980840537159264
Running compilation step : cd /tmp/ltsmin18340980840537159264;'/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/ltsmin18340980840537159264;'/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/ltsmin18340980840537159264;'/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 6886 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Applied a total of 0 rules in 1668 ms. Remains 6886 /6886 variables (removed 0) and now considering 32003/32003 (removed 0) transitions.
[2024-05-20 21:23:28] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:23:32] [INFO ] Computed 82 invariants in 4094 ms
[2024-05-20 21:23:34] [INFO ] Implicit Places using invariants in 5743 ms returned []
Implicit Place search using SMT only with invariants took 5746 ms to find 0 implicit places.
[2024-05-20 21:23:34] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:23:34] [INFO ] Invariant cache hit.
[2024-05-20 21:23:54] [INFO ] Dead Transitions using invariants and state equation in 20369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27785 ms. Remains : 6886/6886 places, 32003/32003 transitions.
Built C files in :
/tmp/ltsmin9297986733572630167
[2024-05-20 21:23:54] [INFO ] Too many transitions (32003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:23:54] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9297986733572630167
Running compilation step : cd /tmp/ltsmin9297986733572630167;'/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/ltsmin9297986733572630167;'/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/ltsmin9297986733572630167;'/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-20 21:23:58] [INFO ] Flatten gal took : 499 ms
[2024-05-20 21:23:59] [INFO ] Flatten gal took : 528 ms
[2024-05-20 21:23:59] [INFO ] Time to serialize gal into /tmp/LTL16417156591354082099.gal : 93 ms
[2024-05-20 21:23:59] [INFO ] Time to serialize properties into /tmp/LTL16613475080270969776.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/LTL16417156591354082099.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3838491069917315914.hoa' '-atoms' '/tmp/LTL16613475080270969776.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/LTL16613475080270969776.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3838491069917315914.hoa
Detected timeout of ITS tools.
[2024-05-20 21:24:15] [INFO ] Flatten gal took : 503 ms
[2024-05-20 21:24:15] [INFO ] Flatten gal took : 612 ms
[2024-05-20 21:24:16] [INFO ] Time to serialize gal into /tmp/LTL1546164451516372939.gal : 132 ms
[2024-05-20 21:24:16] [INFO ] Time to serialize properties into /tmp/LTL13988993990856118879.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/LTL1546164451516372939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13988993990856118879.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node55GiveAnswer67<1)")&&((G("(Node14GiveAnswer26<1)"))||(("(Node14GiveAnswer26<1)")&&(G(F("(Node54GiveAnswer21>=1)"))))))))...156
Formula 0 simplified : XG(!"(Node55GiveAnswer67<1)" | (F!"(Node14GiveAnswer26<1)" & (!"(Node14GiveAnswer26<1)" | FG!"(Node54GiveAnswer21>=1)")))
Detected timeout of ITS tools.
[2024-05-20 21:24:31] [INFO ] Flatten gal took : 498 ms
[2024-05-20 21:24:31] [INFO ] Applying decomposition
[2024-05-20 21:24:32] [INFO ] Flatten gal took : 529 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/graph625603250721016477.txt' '-o' '/tmp/graph625603250721016477.bin' '-w' '/tmp/graph625603250721016477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph625603250721016477.bin' '-l' '-1' '-v' '-w' '/tmp/graph625603250721016477.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:24:33] [INFO ] Decomposing Gal with order
[2024-05-20 21:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:24:37] [INFO ] Removed a total of 25392 redundant transitions.
[2024-05-20 21:24:37] [INFO ] Flatten gal took : 3805 ms
[2024-05-20 21:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 18800 labels/synchronizations in 6074 ms.
[2024-05-20 21:24:44] [INFO ] Time to serialize gal into /tmp/LTL7319156050922969872.gal : 100 ms
[2024-05-20 21:24:44] [INFO ] Time to serialize properties into /tmp/LTL3395769531253947346.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/LTL7319156050922969872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3395769531253947346.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(u68.Node55GiveAnswer67<1)")&&((G("(u27.Node14GiveAnswer26<1)"))||(("(u27.Node14GiveAnswer26<1)")&&(G(F("(u22.Node54GiveAnswe...172
Formula 0 simplified : XG(!"(u68.Node55GiveAnswer67<1)" | (F!"(u27.Node14GiveAnswer26<1)" & (!"(u27.Node14GiveAnswer26<1)" | FG!"(u22.Node54GiveAnswer21>=1...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2314401634911467891
[2024-05-20 21:24:59] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2314401634911467891
Running compilation step : cd /tmp/ltsmin2314401634911467891;'/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/ltsmin2314401634911467891;'/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/ltsmin2314401634911467891;'/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 CANInsertWithFailure-PT-080-LTLFireability-05 finished in 387691 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 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 12 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 7898 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2024-05-20 21:25:10] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
// Phase 1: matrix 25839 rows 6884 cols
[2024-05-20 21:25:14] [INFO ] Computed 82 invariants in 4095 ms
[2024-05-20 21:25:16] [INFO ] Implicit Places using invariants in 5685 ms returned []
Implicit Place search using SMT only with invariants took 5686 ms to find 0 implicit places.
[2024-05-20 21:25:16] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:25:16] [INFO ] Invariant cache hit.
[2024-05-20 21:25:36] [INFO ] Dead Transitions using invariants and state equation in 20171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33759 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-06 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 (GEQ s1293 1) (AND (GEQ s35 1) (GEQ s3849 1))), p1:(OR (LT s35 1) (LT s3849 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 248 reset in 2624 ms.
Product exploration explored 100000 steps with 246 reset in 2767 ms.
Computed a total of 244 stabilizing places and 401 stable transitions
Computed a total of 244 stabilizing places and 401 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 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 27 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 21:25:42] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:25:42] [INFO ] Invariant cache hit.
[2024-05-20 21:25:43] [INFO ] [Real]Absence check using 80 positive place invariants in 59 ms returned sat
[2024-05-20 21:25:43] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 21:25:59] [INFO ] After 16213ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-20 21:25:59] [INFO ] State equation strengthened by 19118 read => feed constraints.
[2024-05-20 21:26:02] [INFO ] After 3151ms SMT Verify possible using 19118 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 21:26:02] [INFO ] After 20394ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 21:26:03] [INFO ] [Nat]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:26:03] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:26:21] [INFO ] After 17640ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-20 21:26:28] [INFO ] After 6555ms SMT Verify possible using 19118 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-20 21:26:28] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 16 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 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 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 6884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 1616 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:26:29] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:26:29] [INFO ] Invariant cache hit.
[2024-05-20 21:26:31] [INFO ] Implicit Places using invariants in 1579 ms returned []
Implicit Place search using SMT only with invariants took 1579 ms to find 0 implicit places.
[2024-05-20 21:26:31] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:26:31] [INFO ] Invariant cache hit.
[2024-05-20 21:26:50] [INFO ] Dead Transitions using invariants and state equation in 19124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22320 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Computed a total of 244 stabilizing places and 401 stable transitions
Computed a total of 244 stabilizing places and 401 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 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 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 21:26:51] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:26:51] [INFO ] Invariant cache hit.
[2024-05-20 21:26:52] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:26:52] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:27:09] [INFO ] After 17650ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-20 21:27:10] [INFO ] State equation strengthened by 19118 read => feed constraints.
[2024-05-20 21:27:12] [INFO ] After 2856ms SMT Verify possible using 19118 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 21:27:12] [INFO ] After 21535ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-20 21:27:13] [INFO ] [Nat]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 21:27:13] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 21:27:29] [INFO ] After 15323ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-20 21:27:36] [INFO ] After 7346ms SMT Verify possible using 19118 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-20 21:27:37] [INFO ] After 8234ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 604 ms.
[2024-05-20 21:27:38] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6884 transition count 31999
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6480 times.
Drop transitions removed 6480 transitions
Iterating global reduction 1 with 6480 rules applied. Total rules applied 6484 place count 6882 transition count 31999
Applied a total of 6484 rules in 5651 ms. Remains 6882 /6884 variables (removed 2) and now considering 31999/32001 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5652 ms. Remains : 6882/6884 places, 31999/32001 transitions.
Finished random walk after 5305 steps, including 11 resets, run visited all 1 properties in 161 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 199 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 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 246 reset in 2656 ms.
Product exploration explored 100000 steps with 247 reset in 2809 ms.
Built C files in :
/tmp/ltsmin2185357942230817986
[2024-05-20 21:27:49] [INFO ] Too many transitions (32001) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:27:49] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2185357942230817986
Running compilation step : cd /tmp/ltsmin2185357942230817986;'/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/ltsmin2185357942230817986;'/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/ltsmin2185357942230817986;'/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 6884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 1644 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:27:54] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:27:54] [INFO ] Invariant cache hit.
[2024-05-20 21:27:56] [INFO ] Implicit Places using invariants in 1587 ms returned []
Implicit Place search using SMT only with invariants took 1596 ms to find 0 implicit places.
[2024-05-20 21:27:56] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2024-05-20 21:27:56] [INFO ] Invariant cache hit.
[2024-05-20 21:28:16] [INFO ] Dead Transitions using invariants and state equation in 20049 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23290 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Built C files in :
/tmp/ltsmin5619927396375346870
[2024-05-20 21:28:16] [INFO ] Too many transitions (32001) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:28:16] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5619927396375346870
Running compilation step : cd /tmp/ltsmin5619927396375346870;'/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/ltsmin5619927396375346870;'/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/ltsmin5619927396375346870;'/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-20 21:28:20] [INFO ] Flatten gal took : 512 ms
[2024-05-20 21:28:20] [INFO ] Flatten gal took : 523 ms
[2024-05-20 21:28:20] [INFO ] Time to serialize gal into /tmp/LTL11904691737128988047.gal : 96 ms
[2024-05-20 21:28:20] [INFO ] Time to serialize properties into /tmp/LTL17826773111029522795.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/LTL11904691737128988047.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1835388847853689011.hoa' '-atoms' '/tmp/LTL17826773111029522795.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/LTL17826773111029522795.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1835388847853689011.hoa
Detected timeout of ITS tools.
[2024-05-20 21:28:36] [INFO ] Flatten gal took : 490 ms
[2024-05-20 21:28:37] [INFO ] Flatten gal took : 519 ms
[2024-05-20 21:28:37] [INFO ] Time to serialize gal into /tmp/LTL1638403889181139105.gal : 109 ms
[2024-05-20 21:28:37] [INFO ] Time to serialize properties into /tmp/LTL11160521730167094647.ltl : 4 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/LTL1638403889181139105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11160521730167094647.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("((Node10requestsent9>=1)||((Node5IsInserted>=1)&&(Node42requestsent5>=1)))"))||(G("((Node5IsInserted<1)||(Node42requestsent5<...164
Formula 0 simplified : G(F!"((Node10requestsent9>=1)||((Node5IsInserted>=1)&&(Node42requestsent5>=1)))" & F!"((Node5IsInserted<1)||(Node42requestsent5<1))"...156
Detected timeout of ITS tools.
[2024-05-20 21:28:53] [INFO ] Flatten gal took : 533 ms
[2024-05-20 21:28:53] [INFO ] Applying decomposition
[2024-05-20 21:28:53] [INFO ] Flatten gal took : 670 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/graph10762613574624593725.txt' '-o' '/tmp/graph10762613574624593725.bin' '-w' '/tmp/graph10762613574624593725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10762613574624593725.bin' '-l' '-1' '-v' '-w' '/tmp/graph10762613574624593725.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:28:55] [INFO ] Decomposing Gal with order
[2024-05-20 21:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:28:59] [INFO ] Removed a total of 25428 redundant transitions.
[2024-05-20 21:28:59] [INFO ] Flatten gal took : 3942 ms
[2024-05-20 21:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 18803 labels/synchronizations in 6012 ms.
[2024-05-20 21:29:06] [INFO ] Time to serialize gal into /tmp/LTL1983293863149714502.gal : 117 ms
[2024-05-20 21:29:06] [INFO ] Time to serialize properties into /tmp/LTL2128109372420176937.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/LTL1983293863149714502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2128109372420176937.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("((u11.Node10requestsent9>=1)||((u6.Node5IsInserted>=1)&&(u43.Node42requestsent5>=1)))"))||(G("((u6.Node5IsInserted<1)||(u43.N...182
Formula 0 simplified : G(F!"((u11.Node10requestsent9>=1)||((u6.Node5IsInserted>=1)&&(u43.Node42requestsent5>=1)))" & F!"((u6.Node5IsInserted<1)||(u43.Node4...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13016432500716100177
[2024-05-20 21:29:21] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13016432500716100177
Running compilation step : cd /tmp/ltsmin13016432500716100177;'/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/ltsmin13016432500716100177;'/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/ltsmin13016432500716100177;'/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 CANInsertWithFailure-PT-080-LTLFireability-06 finished in 261969 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 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3340 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:29:36] [INFO ] Computed 82 invariants in 8708 ms
[2024-05-20 21:29:37] [INFO ] Implicit Places using invariants in 9833 ms returned []
Implicit Place search using SMT only with invariants took 9834 ms to find 0 implicit places.
[2024-05-20 21:29:37] [INFO ] Invariant cache hit.
[2024-05-20 21:29:38] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14290 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s12626 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 2 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-08 finished in 14444 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&&X(p1)) U p2))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3498 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:29:42] [INFO ] Invariant cache hit.
[2024-05-20 21:29:43] [INFO ] Implicit Places using invariants in 1114 ms returned []
Implicit Place search using SMT only with invariants took 1116 ms to find 0 implicit places.
[2024-05-20 21:29:43] [INFO ] Invariant cache hit.
[2024-05-20 21:29:44] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5759 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s9816 1) (GEQ s12702 1)), p0:(GEQ s9816 1), p1:(GEQ s1682 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50 reset in 2179 ms.
Product exploration explored 100000 steps with 50 reset in 2134 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (OR p2 p0)), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (OR p2 p0))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 329 ms. (steps per millisecond=30 ) 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 :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 :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 :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 :0
Interrupted probabilistic random walk after 97923 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97923 steps, saw 96088 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 21:29:52] [INFO ] Invariant cache hit.
[2024-05-20 21:29:54] [INFO ] [Real]Absence check using 80 positive place invariants in 125 ms returned sat
[2024-05-20 21:29:54] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 264 ms returned sat
[2024-05-20 21:30:18] [INFO ] After 22978ms SMT Verify possible using state equation in real domain returned unsat :2 sat :0 real:1
[2024-05-20 21:30:18] [INFO ] State equation strengthened by 12720 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:30:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:30:18] [INFO ] After 25145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 14 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13755 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 3 with 6481 rules applied. Total rules applied 20237 place count 6885 transition count 32002
Applied a total of 20237 rules in 12842 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12843 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Finished random walk after 7712 steps, including 16 resets, run visited all 2 properties in 275 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (OR p2 p0)), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (OR p2 p0))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (G (OR p0 p2)), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 11 factoid took 168 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3467 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:30:35] [INFO ] Invariant cache hit.
[2024-05-20 21:30:36] [INFO ] Implicit Places using invariants in 1110 ms returned []
Implicit Place search using SMT only with invariants took 1114 ms to find 0 implicit places.
[2024-05-20 21:30:36] [INFO ] Invariant cache hit.
[2024-05-20 21:30:37] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5715 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), true, (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 270 ms. (steps per millisecond=37 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 107710 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107710 steps, saw 105589 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 21:30:41] [INFO ] Invariant cache hit.
[2024-05-20 21:30:42] [INFO ] [Real]Absence check using 80 positive place invariants in 120 ms returned sat
[2024-05-20 21:30:42] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 262 ms returned sat
[2024-05-20 21:31:06] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 13 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13755 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 3 with 6481 rules applied. Total rules applied 20237 place count 6885 transition count 32002
Applied a total of 20237 rules in 12355 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12356 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32002 rows 6885 cols
[2024-05-20 21:31:20] [INFO ] Computed 82 invariants in 2105 ms
[2024-05-20 21:31:21] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:31:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:31:37] [INFO ] After 15772ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:31:37] [INFO ] State equation strengthened by 31754 read => feed constraints.
[2024-05-20 21:31:45] [INFO ] After 8136ms SMT Verify possible using 31754 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-20 21:31:45] [INFO ] After 25047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6884 transition count 32001
Applied a total of 2 rules in 4358 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4358 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73229 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73229 steps, saw 63924 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2024-05-20 21:31:55] [INFO ] Computed 82 invariants in 2060 ms
[2024-05-20 21:31:56] [INFO ] [Real]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 21:31:56] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:32:11] [INFO ] After 14776ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:32:11] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:32:15] [INFO ] After 4212ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:32:15] [INFO ] After 20135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:32:16] [INFO ] [Nat]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 21:32:16] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:32:32] [INFO ] After 15529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:32:36] [INFO ] After 4204ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:32:37] [INFO ] After 5348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 837 ms.
[2024-05-20 21:32:38] [INFO ] After 22658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2221 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2221 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2239 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:32:42] [INFO ] Invariant cache hit.
[2024-05-20 21:32:48] [INFO ] Implicit Places using invariants in 5957 ms returned []
Implicit Place search using SMT only with invariants took 5958 ms to find 0 implicit places.
[2024-05-20 21:32:48] [INFO ] Invariant cache hit.
[2024-05-20 21:33:09] [INFO ] Dead Transitions using invariants and state equation in 20135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28334 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), true, (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50 reset in 2094 ms.
Product exploration explored 100000 steps with 51 reset in 2313 ms.
Built C files in :
/tmp/ltsmin16911626287305130107
[2024-05-20 21:33:14] [INFO ] Built C files in 224ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16911626287305130107
Running compilation step : cd /tmp/ltsmin16911626287305130107;'/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/ltsmin16911626287305130107;'/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/ltsmin16911626287305130107;'/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 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3816 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:33:30] [INFO ] Computed 82 invariants in 9199 ms
[2024-05-20 21:33:31] [INFO ] Implicit Places using invariants in 10300 ms returned []
Implicit Place search using SMT only with invariants took 10301 ms to find 0 implicit places.
[2024-05-20 21:33:31] [INFO ] Invariant cache hit.
[2024-05-20 21:33:32] [INFO ] Dead Transitions using invariants and state equation in 1252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15371 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Built C files in :
/tmp/ltsmin9065413529220435919
[2024-05-20 21:33:32] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9065413529220435919
Running compilation step : cd /tmp/ltsmin9065413529220435919;'/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/ltsmin9065413529220435919;'/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/ltsmin9065413529220435919;'/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-20 21:33:37] [INFO ] Flatten gal took : 662 ms
[2024-05-20 21:33:37] [INFO ] Flatten gal took : 742 ms
[2024-05-20 21:33:37] [INFO ] Time to serialize gal into /tmp/LTL10623906235673959590.gal : 99 ms
[2024-05-20 21:33:37] [INFO ] Time to serialize properties into /tmp/LTL13307670721976399806.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/LTL10623906235673959590.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6890035999067718288.hoa' '-atoms' '/tmp/LTL13307670721976399806.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/LTL13307670721976399806.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6890035999067718288.hoa
Detected timeout of ITS tools.
[2024-05-20 21:33:54] [INFO ] Flatten gal took : 669 ms
[2024-05-20 21:33:54] [INFO ] Flatten gal took : 792 ms
[2024-05-20 21:33:54] [INFO ] Time to serialize gal into /tmp/LTL2028027314566872372.gal : 98 ms
[2024-05-20 21:33:54] [INFO ] Time to serialize properties into /tmp/LTL12458471631993169458.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/LTL2028027314566872372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12458471631993169458.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((("(Node55GiveAnswer1>=1)")&&(X("(Node3GiveAnswer43>=1)")))U("((Node55GiveAnswer1<1)||(Node73GiveAnswer22>=1))")))))
Formula 0 simplified : GF((!"(Node55GiveAnswer1>=1)" | X!"(Node3GiveAnswer43>=1)") R !"((Node55GiveAnswer1<1)||(Node73GiveAnswer22>=1))")
Detected timeout of ITS tools.
[2024-05-20 21:34:10] [INFO ] Flatten gal took : 669 ms
[2024-05-20 21:34:10] [INFO ] Applying decomposition
[2024-05-20 21:34:11] [INFO ] Flatten gal took : 736 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/graph6120855794019031876.txt' '-o' '/tmp/graph6120855794019031876.bin' '-w' '/tmp/graph6120855794019031876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6120855794019031876.bin' '-l' '-1' '-v' '-w' '/tmp/graph6120855794019031876.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:34:12] [INFO ] Decomposing Gal with order
[2024-05-20 21:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:34:17] [INFO ] Removed a total of 19244 redundant transitions.
[2024-05-20 21:34:17] [INFO ] Flatten gal took : 2568 ms
[2024-05-20 21:34:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 25206 labels/synchronizations in 2927 ms.
[2024-05-20 21:34:20] [INFO ] Time to serialize gal into /tmp/LTL10075517925747750284.gal : 144 ms
[2024-05-20 21:34:20] [INFO ] Time to serialize properties into /tmp/LTL11510546180495086152.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/LTL10075517925747750284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11510546180495086152.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G((("(i1.u7.Node55GiveAnswer1>=1)")&&(X("(i44.u172.Node3GiveAnswer43>=1)")))U("((i1.u7.Node55GiveAnswer1<1)||(i22.u91.Node73GiveA...173
Formula 0 simplified : GF((!"(i1.u7.Node55GiveAnswer1>=1)" | X!"(i44.u172.Node3GiveAnswer43>=1)") R !"((i1.u7.Node55GiveAnswer1<1)||(i22.u91.Node73GiveAnsw...166
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1270946226453494676
[2024-05-20 21:34:36] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1270946226453494676
Running compilation step : cd /tmp/ltsmin1270946226453494676;'/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/ltsmin1270946226453494676;'/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/ltsmin1270946226453494676;'/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 CANInsertWithFailure-PT-080-LTLFireability-09 finished in 300193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 13 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8528 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-20 21:34:47] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-20 21:34:51] [INFO ] Computed 82 invariants in 4252 ms
[2024-05-20 21:34:53] [INFO ] Implicit Places using invariants in 5856 ms returned []
Implicit Place search using SMT only with invariants took 5856 ms to find 0 implicit places.
[2024-05-20 21:34:53] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-20 21:34:53] [INFO ] Invariant cache hit.
[2024-05-20 21:35:14] [INFO ] Dead Transitions using invariants and state equation in 21078 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/13763 places, 32002/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35470 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s389 1) (GEQ s475 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 428 steps with 0 reset in 17 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-10 finished in 35629 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)&&((p1||X((G(p2) U (p1&&G(p2))))) U G(p3)))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4249 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-20 21:35:27] [INFO ] Computed 82 invariants in 8702 ms
[2024-05-20 21:35:29] [INFO ] Implicit Places using invariants in 9948 ms returned []
Implicit Place search using SMT only with invariants took 9949 ms to find 0 implicit places.
[2024-05-20 21:35:29] [INFO ] Invariant cache hit.
[2024-05-20 21:35:30] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15317 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=(AND p1 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p3 p1 p2), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 6}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p3 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(GEQ s4302 1), p3:(GEQ s7533 1), p1:(GEQ s4426 1), p2:(LT s4971 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]]
Stuttering criterion allowed to conclude after 1991 steps with 0 reset in 65 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-11 finished in 15859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3711 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:35:34] [INFO ] Invariant cache hit.
[2024-05-20 21:35:35] [INFO ] Implicit Places using invariants in 1328 ms returned []
Implicit Place search using SMT only with invariants took 1329 ms to find 0 implicit places.
[2024-05-20 21:35:35] [INFO ] Invariant cache hit.
[2024-05-20 21:35:37] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6329 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s7860 1), p1:(GEQ s13246 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1953 steps with 0 reset in 53 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-12 finished in 6710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3763 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:35:41] [INFO ] Invariant cache hit.
[2024-05-20 21:35:42] [INFO ] Implicit Places using invariants in 1131 ms returned []
Implicit Place search using SMT only with invariants took 1132 ms to find 0 implicit places.
[2024-05-20 21:35:42] [INFO ] Invariant cache hit.
[2024-05-20 21:35:43] [INFO ] Dead Transitions using invariants and state equation in 1123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6020 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s8292 1), p1:(GEQ s8780 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1882 steps with 0 reset in 39 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-13 finished in 6273 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(X(X(F(p1))))&&G(p2))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3790 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:35:47] [INFO ] Invariant cache hit.
[2024-05-20 21:35:48] [INFO ] Implicit Places using invariants in 1122 ms returned []
Implicit Place search using SMT only with invariants took 1123 ms to find 0 implicit places.
[2024-05-20 21:35:48] [INFO ] Invariant cache hit.
[2024-05-20 21:35:49] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6034 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 4}, { cond=(NOT p2), acceptance={0} source=0 dest: 6}], [{ cond=p2, acceptance={} source=1 dest: 8}, { cond=(NOT p2), acceptance={} source=1 dest: 9}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 9}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 0}, { cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=1, aps=[p2:(AND (GEQ s712 1) (GEQ s1015 1)), p1:(GEQ s6369 1), p0:(AND (GEQ s287 1) (GEQ s320 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-14 finished in 6541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||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' '!(F(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))||(G(p2)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-080-LTLFireability-04
Stuttering acceptance computed with spot in 270 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 13763 transition count 38325
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 13208 transition count 38325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 13208 transition count 38323
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 14 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13750 place count 6888 transition count 32005
Applied a total of 13750 rules in 8836 ms. Remains 6888 /13763 variables (removed 6875) and now considering 32005/38880 (removed 6875) transitions.
[2024-05-20 21:35:59] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
// Phase 1: matrix 25843 rows 6888 cols
[2024-05-20 21:36:03] [INFO ] Computed 82 invariants in 4334 ms
[2024-05-20 21:36:05] [INFO ] Implicit Places using invariants in 6005 ms returned []
Implicit Place search using SMT only with invariants took 6005 ms to find 0 implicit places.
[2024-05-20 21:36:05] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
[2024-05-20 21:36:05] [INFO ] Invariant cache hit.
[2024-05-20 21:36:25] [INFO ] Dead Transitions using invariants and state equation in 20386 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6888/13763 places, 32005/38880 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 35232 ms. Remains : 6888/13763 places, 32005/38880 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 2} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=0 dest: 2}, { cond=p2, acceptance={2} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0, 2} source=1 dest: 0}, { cond=p0, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={2} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0, 2} source=3 dest: 0}, { cond=(NOT p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 2}, { cond=p2, acceptance={2} source=3 dest: 3}, { cond=p2, acceptance={1, 2} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 2} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={2} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p2 p1 p0), acceptance={1, 2} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s193 1) (GEQ s367 1)), p1:(AND (GEQ s143 1) (GEQ s5711 1)), p0:(AND (GEQ s405 1) (GEQ s417 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33545 reset in 6549 ms.
Product exploration explored 100000 steps with 33357 reset in 6414 ms.
Computed a total of 241 stabilizing places and 401 stable transitions
Computed a total of 241 stabilizing places and 401 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 305 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:36:40] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
[2024-05-20 21:36:40] [INFO ] Invariant cache hit.
[2024-05-20 21:36:41] [INFO ] [Real]Absence check using 80 positive place invariants in 68 ms returned sat
[2024-05-20 21:36:41] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 102 ms returned sat
[2024-05-20 21:36:56] [INFO ] After 14609ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:36:56] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2024-05-20 21:37:03] [INFO ] After 6700ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 21:37:03] [INFO ] After 23053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 21:37:04] [INFO ] [Nat]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 21:37:04] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:37:20] [INFO ] After 15703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:37:25] [INFO ] After 5241ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 21:37:28] [INFO ] After 7655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 21:37:28] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 6888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6888/6888 places, 32005/32005 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6888 transition count 32001
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6482 times.
Drop transitions removed 6482 transitions
Iterating global reduction 1 with 6482 rules applied. Total rules applied 6490 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 1 with 160 rules applied. Total rules applied 6650 place count 6884 transition count 32001
Applied a total of 6650 rules in 7684 ms. Remains 6884 /6888 variables (removed 4) and now considering 32001/32005 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7687 ms. Remains : 6884/6888 places, 32001/32005 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 70783 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70783 steps, saw 63231 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:37:39] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
// Phase 1: matrix 32000 rows 6884 cols
[2024-05-20 21:37:41] [INFO ] Computed 82 invariants in 2039 ms
[2024-05-20 21:37:42] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:37:42] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:38:00] [INFO ] After 17184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:38:00] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:38:06] [INFO ] After 6066ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:38:06] [INFO ] After 6066ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 21:38:06] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:38:07] [INFO ] [Nat]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 21:38:07] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:38:28] [INFO ] After 20413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:38:31] [INFO ] After 2925ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 21:38:31] [INFO ] After 2926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-20 21:38:31] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2123 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2129 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2172 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:38:35] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:38:35] [INFO ] Invariant cache hit.
[2024-05-20 21:38:42] [INFO ] Implicit Places using invariants in 6041 ms returned []
Implicit Place search using SMT only with invariants took 6042 ms to find 0 implicit places.
[2024-05-20 21:38:42] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
[2024-05-20 21:38:42] [INFO ] Invariant cache hit.
[2024-05-20 21:39:02] [INFO ] Dead Transitions using invariants and state equation in 20614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28833 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(F p0), (F (AND p2 (NOT p0))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F p2), (F (AND (NOT p2) p0)), (F p1), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 26 factoid took 904 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 260 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Support contains 6 out of 6888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6888/6888 places, 32005/32005 transitions.
Applied a total of 0 rules in 1567 ms. Remains 6888 /6888 variables (removed 0) and now considering 32005/32005 (removed 0) transitions.
[2024-05-20 21:39:05] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
// Phase 1: matrix 25843 rows 6888 cols
[2024-05-20 21:39:09] [INFO ] Computed 82 invariants in 4164 ms
[2024-05-20 21:39:11] [INFO ] Implicit Places using invariants in 5745 ms returned []
Implicit Place search using SMT only with invariants took 5746 ms to find 0 implicit places.
[2024-05-20 21:39:11] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
[2024-05-20 21:39:11] [INFO ] Invariant cache hit.
[2024-05-20 21:39:31] [INFO ] Dead Transitions using invariants and state equation in 20355 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27674 ms. Remains : 6888/6888 places, 32005/32005 transitions.
Computed a total of 241 stabilizing places and 401 stable transitions
Computed a total of 241 stabilizing places and 401 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 303 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-20 21:39:33] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
[2024-05-20 21:39:33] [INFO ] Invariant cache hit.
[2024-05-20 21:39:34] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:39:34] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:39:49] [INFO ] After 14086ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:7
[2024-05-20 21:39:49] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2024-05-20 21:39:55] [INFO ] After 6284ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 21:39:55] [INFO ] After 22413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 21:39:56] [INFO ] [Nat]Absence check using 80 positive place invariants in 59 ms returned sat
[2024-05-20 21:39:57] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:40:15] [INFO ] After 17874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-20 21:40:20] [INFO ] After 4911ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-20 21:40:20] [INFO ] After 4911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 21:40:20] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 6888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6888/6888 places, 32005/32005 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6888 transition count 32001
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6482 times.
Drop transitions removed 6482 transitions
Iterating global reduction 1 with 6482 rules applied. Total rules applied 6490 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 1 with 160 rules applied. Total rules applied 6650 place count 6884 transition count 32001
Applied a total of 6650 rules in 7828 ms. Remains 6884 /6888 variables (removed 4) and now considering 32001/32005 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7829 ms. Remains : 6884/6888 places, 32001/32005 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 21:40:29] [INFO ] Flow matrix only has 32000 transitions (discarded 1 similar events)
// Phase 1: matrix 32000 rows 6884 cols
[2024-05-20 21:40:31] [INFO ] Computed 82 invariants in 1994 ms
[2024-05-20 21:40:32] [INFO ] [Real]Absence check using 80 positive place invariants in 66 ms returned sat
[2024-05-20 21:40:32] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:40:50] [INFO ] After 17424ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2024-05-20 21:40:50] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:40:56] [INFO ] After 5790ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:40:56] [INFO ] After 5791ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 21:40:56] [INFO ] After 25054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2024-05-20 21:40:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:40:57] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:41:16] [INFO ] After 18686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 21:41:21] [INFO ] After 4668ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 21:41:21] [INFO ] After 4669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-20 21:41:21] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2125 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2125 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F p0), (F (AND p2 (NOT p0))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F p2), (F (AND (NOT p2) p0)), (F p1), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 26 factoid took 969 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 233 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Stuttering acceptance computed with spot in 237 ms :[p0, p0, false, (AND p0 (NOT p2)), (AND p0 (NOT p2)), false]
Product exploration explored 100000 steps with 33339 reset in 5721 ms.
Product exploration explored 100000 steps with 33449 reset in 5786 ms.
Built C files in :
/tmp/ltsmin15368440498445285515
[2024-05-20 21:41:37] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15368440498445285515
Running compilation step : cd /tmp/ltsmin15368440498445285515;'/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/ltsmin15368440498445285515;'/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/ltsmin15368440498445285515;'/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 6888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6888/6888 places, 32005/32005 transitions.
Applied a total of 0 rules in 1643 ms. Remains 6888 /6888 variables (removed 0) and now considering 32005/32005 (removed 0) transitions.
[2024-05-20 21:41:41] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
// Phase 1: matrix 25843 rows 6888 cols
[2024-05-20 21:41:45] [INFO ] Computed 82 invariants in 4066 ms
[2024-05-20 21:41:47] [INFO ] Implicit Places using invariants in 5637 ms returned []
Implicit Place search using SMT only with invariants took 5638 ms to find 0 implicit places.
[2024-05-20 21:41:47] [INFO ] Flow matrix only has 25843 transitions (discarded 6162 similar events)
[2024-05-20 21:41:47] [INFO ] Invariant cache hit.
[2024-05-20 21:42:06] [INFO ] Dead Transitions using invariants and state equation in 18787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26070 ms. Remains : 6888/6888 places, 32005/32005 transitions.
Built C files in :
/tmp/ltsmin11463750221103125556
[2024-05-20 21:42:06] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11463750221103125556
Running compilation step : cd /tmp/ltsmin11463750221103125556;'/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/ltsmin11463750221103125556;'/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/ltsmin11463750221103125556;'/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-20 21:42:10] [INFO ] Flatten gal took : 488 ms
[2024-05-20 21:42:10] [INFO ] Flatten gal took : 526 ms
[2024-05-20 21:42:10] [INFO ] Time to serialize gal into /tmp/LTL10099518740921051031.gal : 92 ms
[2024-05-20 21:42:10] [INFO ] Time to serialize properties into /tmp/LTL1000410821250094607.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/LTL10099518740921051031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15316191722273026118.hoa' '-atoms' '/tmp/LTL1000410821250094607.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/LTL1000410821250094607.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15316191722273026118.hoa
Detected timeout of ITS tools.
[2024-05-20 21:42:26] [INFO ] Flatten gal took : 478 ms
[2024-05-20 21:42:27] [INFO ] Flatten gal took : 579 ms
[2024-05-20 21:42:27] [INFO ] Time to serialize gal into /tmp/LTL6911627459970209875.gal : 84 ms
[2024-05-20 21:42:27] [INFO ] Time to serialize properties into /tmp/LTL5983432158391013347.ltl : 4 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/LTL6911627459970209875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5983432158391013347.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(((X(!("((Node66Request>=1)&&(Node68IsInserted>=1))")))U((X(G(!("((Node66Request>=1)&&(Node68IsInserted>=1))"))))||((!("((Node23Is...778
Formula 0 simplified : G(F!"((Node31Request>=1)&&(Node60IsInserted>=1))" U (X"((Node66Request>=1)&&(Node68IsInserted>=1))" R (XF"((Node66Request>=1)&&(Node...281
Detected timeout of ITS tools.
[2024-05-20 21:42:42] [INFO ] Flatten gal took : 493 ms
[2024-05-20 21:42:42] [INFO ] Applying decomposition
[2024-05-20 21:42:43] [INFO ] Flatten gal took : 525 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/graph17072317625373972655.txt' '-o' '/tmp/graph17072317625373972655.bin' '-w' '/tmp/graph17072317625373972655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17072317625373972655.bin' '-l' '-1' '-v' '-w' '/tmp/graph17072317625373972655.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:42:44] [INFO ] Decomposing Gal with order
[2024-05-20 21:42:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:42:48] [INFO ] Removed a total of 25399 redundant transitions.
[2024-05-20 21:42:49] [INFO ] Flatten gal took : 4183 ms
[2024-05-20 21:42:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 19276 labels/synchronizations in 6364 ms.
[2024-05-20 21:42:56] [INFO ] Time to serialize gal into /tmp/LTL9855461026505106956.gal : 110 ms
[2024-05-20 21:42:56] [INFO ] Time to serialize properties into /tmp/LTL5010212722655368059.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/LTL9855461026505106956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5010212722655368059.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(((X(!("((i67.u69.Node66Request>=1)&&(u71.Node68IsInserted>=1))")))U((X(G(!("((i67.u69.Node66Request>=1)&&(u71.Node68IsInserted>=1...922
Formula 0 simplified : G(F!"((i32.u33.Node31Request>=1)&&(u62.Node60IsInserted>=1))" U (X"((i67.u69.Node66Request>=1)&&(u71.Node68IsInserted>=1))" R (XF"((...337
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin464399945836347706
[2024-05-20 21:43:11] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin464399945836347706
Running compilation step : cd /tmp/ltsmin464399945836347706;'/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/ltsmin464399945836347706;'/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/ltsmin464399945836347706;'/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 CANInsertWithFailure-PT-080-LTLFireability-04 finished in 444267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(G(p1)||(p1&&G(F(p2))))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-080-LTLFireability-05
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 15 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 7672 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2024-05-20 21:43:22] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:43:26] [INFO ] Computed 82 invariants in 3999 ms
[2024-05-20 21:43:28] [INFO ] Implicit Places using invariants in 5630 ms returned []
Implicit Place search using SMT only with invariants took 5631 ms to find 0 implicit places.
[2024-05-20 21:43:28] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:43:28] [INFO ] Invariant cache hit.
[2024-05-20 21:43:48] [INFO ] Dead Transitions using invariants and state equation in 20309 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33616 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s4952 1), p1:(LT s1629 1), p2:(GEQ s4826 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 248 reset in 2581 ms.
Product exploration explored 100000 steps with 247 reset in 2688 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 54255 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54255 steps, saw 46149 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-20 21:43:57] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:43:57] [INFO ] Invariant cache hit.
[2024-05-20 21:43:59] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:43:59] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:43:59] [INFO ] After 1471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 21:44:00] [INFO ] [Nat]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:44:00] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 106 ms returned sat
[2024-05-20 21:44:18] [INFO ] After 17122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 21:44:18] [INFO ] State equation strengthened by 19115 read => feed constraints.
[2024-05-20 21:44:24] [INFO ] After 5791ms SMT Verify possible using 19115 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 21:44:24] [INFO ] After 5896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 21:44:24] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 6886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6885 transition count 32002
Applied a total of 6483 rules in 5640 ms. Remains 6885 /6886 variables (removed 1) and now considering 32002/32003 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5641 ms. Remains : 6885/6886 places, 32002/32003 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 32002 rows 6885 cols
[2024-05-20 21:44:32] [INFO ] Computed 82 invariants in 1987 ms
[2024-05-20 21:44:33] [INFO ] [Real]Absence check using 80 positive place invariants in 58 ms returned sat
[2024-05-20 21:44:33] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 21:44:49] [INFO ] After 17269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 21:44:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:44:50] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 21:45:08] [INFO ] After 17631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 21:45:08] [INFO ] State equation strengthened by 31754 read => feed constraints.
[2024-05-20 21:45:14] [INFO ] After 5839ms SMT Verify possible using 31754 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:45:14] [INFO ] After 5896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-20 21:45:14] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6884 transition count 32001
Applied a total of 2 rules in 4249 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4249 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 70352 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70352 steps, saw 63495 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2024-05-20 21:45:24] [INFO ] Computed 82 invariants in 1987 ms
[2024-05-20 21:45:25] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:45:25] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:45:42] [INFO ] After 16446ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 21:45:42] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:45:49] [INFO ] After 7182ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:45:49] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:45:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:45:50] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:46:09] [INFO ] After 18897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 21:46:14] [INFO ] After 5033ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 21:46:14] [INFO ] After 5033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 21:46:14] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2172 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2172 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2133 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2024-05-20 21:46:19] [INFO ] Invariant cache hit.
[2024-05-20 21:46:25] [INFO ] Implicit Places using invariants in 5939 ms returned []
Implicit Place search using SMT only with invariants took 5940 ms to find 0 implicit places.
[2024-05-20 21:46:25] [INFO ] Invariant cache hit.
[2024-05-20 21:46:45] [INFO ] Dead Transitions using invariants and state equation in 20528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28604 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 6886 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Applied a total of 0 rules in 1655 ms. Remains 6886 /6886 variables (removed 0) and now considering 32003/32003 (removed 0) transitions.
[2024-05-20 21:46:47] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:46:51] [INFO ] Computed 82 invariants in 4135 ms
[2024-05-20 21:46:53] [INFO ] Implicit Places using invariants in 5740 ms returned []
Implicit Place search using SMT only with invariants took 5740 ms to find 0 implicit places.
[2024-05-20 21:46:53] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:46:53] [INFO ] Invariant cache hit.
[2024-05-20 21:47:13] [INFO ] Dead Transitions using invariants and state equation in 20379 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27780 ms. Remains : 6886/6886 places, 32003/32003 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 143 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 54501 steps, run timeout after 3002 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54501 steps, saw 46180 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-20 21:47:17] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:47:17] [INFO ] Invariant cache hit.
[2024-05-20 21:47:19] [INFO ] [Real]Absence check using 80 positive place invariants in 66 ms returned sat
[2024-05-20 21:47:19] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 102 ms returned sat
[2024-05-20 21:47:19] [INFO ] After 1494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 21:47:20] [INFO ] [Nat]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:47:20] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:47:36] [INFO ] After 15552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 21:47:37] [INFO ] State equation strengthened by 19115 read => feed constraints.
[2024-05-20 21:47:42] [INFO ] After 5943ms SMT Verify possible using 19115 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 21:47:44] [INFO ] After 7482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 21:47:44] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 6886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6885 transition count 32002
Applied a total of 6483 rules in 5675 ms. Remains 6885 /6886 variables (removed 1) and now considering 32002/32003 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5675 ms. Remains : 6885/6886 places, 32002/32003 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 70593 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70593 steps, saw 63532 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 32002 rows 6885 cols
[2024-05-20 21:47:55] [INFO ] Computed 82 invariants in 2064 ms
[2024-05-20 21:47:57] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:47:57] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 103 ms returned sat
[2024-05-20 21:47:57] [INFO ] After 1490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 21:47:58] [INFO ] [Nat]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:47:58] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 102 ms returned sat
[2024-05-20 21:48:19] [INFO ] After 20226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 21:48:19] [INFO ] State equation strengthened by 31754 read => feed constraints.
[2024-05-20 21:48:22] [INFO ] After 2674ms SMT Verify possible using 31754 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 21:48:22] [INFO ] After 2675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 21:48:22] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2129 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2130 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2129 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-20 21:48:26] [INFO ] Invariant cache hit.
[2024-05-20 21:48:32] [INFO ] Implicit Places using invariants in 6135 ms returned []
Implicit Place search using SMT only with invariants took 6136 ms to find 0 implicit places.
[2024-05-20 21:48:32] [INFO ] Invariant cache hit.
[2024-05-20 21:48:51] [INFO ] Dead Transitions using invariants and state equation in 19040 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27308 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Graph (trivial) has 31511 edges and 6885 vertex of which 6559 / 6885 are part of one of the 2 SCC in 5 ms
Free SCC test removed 6557 places
Drop transitions removed 25195 transitions
Ensure Unique test removed 6472 transitions
Reduce isomorphic transitions removed 31667 transitions.
Graph (complete) has 817 edges and 328 vertex of which 87 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.1 ms
Discarding 241 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Drop transitions removed 161 transitions
Reduce isomorphic transitions removed 161 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 162 rules applied. Total rules applied 164 place count 87 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 165 place count 86 transition count 94
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 243 place count 8 transition count 16
Iterating global reduction 2 with 78 rules applied. Total rules applied 321 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 6 transition count 11
Applied a total of 327 rules in 87 ms. Remains 6 /6885 variables (removed 6879) and now considering 11/32002 (removed 31991) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 11 rows 6 cols
[2024-05-20 21:48:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 21:48:52] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 21:48:52] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 21:48:52] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 21:48:52] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 118 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 248 reset in 2533 ms.
Product exploration explored 100000 steps with 246 reset in 2560 ms.
Built C files in :
/tmp/ltsmin17062223172695988010
[2024-05-20 21:48:57] [INFO ] Too many transitions (32003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:48:57] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17062223172695988010
Running compilation step : cd /tmp/ltsmin17062223172695988010;'/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/ltsmin17062223172695988010;'/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/ltsmin17062223172695988010;'/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 6886 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Applied a total of 0 rules in 1694 ms. Remains 6886 /6886 variables (removed 0) and now considering 32003/32003 (removed 0) transitions.
[2024-05-20 21:49:02] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:49:06] [INFO ] Computed 82 invariants in 4094 ms
[2024-05-20 21:49:08] [INFO ] Implicit Places using invariants in 5867 ms returned []
Implicit Place search using SMT only with invariants took 5868 ms to find 0 implicit places.
[2024-05-20 21:49:08] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:49:08] [INFO ] Invariant cache hit.
[2024-05-20 21:49:29] [INFO ] Dead Transitions using invariants and state equation in 20570 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28135 ms. Remains : 6886/6886 places, 32003/32003 transitions.
Built C files in :
/tmp/ltsmin8317626064348844913
[2024-05-20 21:49:29] [INFO ] Too many transitions (32003) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:49:29] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8317626064348844913
Running compilation step : cd /tmp/ltsmin8317626064348844913;'/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/ltsmin8317626064348844913;'/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/ltsmin8317626064348844913;'/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-20 21:49:33] [INFO ] Flatten gal took : 563 ms
[2024-05-20 21:49:33] [INFO ] Flatten gal took : 495 ms
[2024-05-20 21:49:33] [INFO ] Time to serialize gal into /tmp/LTL12201766518337490032.gal : 96 ms
[2024-05-20 21:49:33] [INFO ] Time to serialize properties into /tmp/LTL8890219271729758267.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/LTL12201766518337490032.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10419009598063155889.hoa' '-atoms' '/tmp/LTL8890219271729758267.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/LTL8890219271729758267.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10419009598063155889.hoa
Detected timeout of ITS tools.
[2024-05-20 21:49:49] [INFO ] Flatten gal took : 500 ms
[2024-05-20 21:49:50] [INFO ] Flatten gal took : 539 ms
[2024-05-20 21:49:50] [INFO ] Time to serialize gal into /tmp/LTL12305123511874069478.gal : 98 ms
[2024-05-20 21:49:50] [INFO ] Time to serialize properties into /tmp/LTL3388273180276947442.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/LTL12305123511874069478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3388273180276947442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node55GiveAnswer67<1)")&&((G("(Node14GiveAnswer26<1)"))||(("(Node14GiveAnswer26<1)")&&(G(F("(Node54GiveAnswer21>=1)"))))))))...156
Formula 0 simplified : XG(!"(Node55GiveAnswer67<1)" | (F!"(Node14GiveAnswer26<1)" & (!"(Node14GiveAnswer26<1)" | FG!"(Node54GiveAnswer21>=1)")))
Detected timeout of ITS tools.
[2024-05-20 21:50:06] [INFO ] Flatten gal took : 498 ms
[2024-05-20 21:50:06] [INFO ] Applying decomposition
[2024-05-20 21:50:06] [INFO ] Flatten gal took : 523 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/graph15109954049020153756.txt' '-o' '/tmp/graph15109954049020153756.bin' '-w' '/tmp/graph15109954049020153756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15109954049020153756.bin' '-l' '-1' '-v' '-w' '/tmp/graph15109954049020153756.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:50:07] [INFO ] Decomposing Gal with order
[2024-05-20 21:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:50:11] [INFO ] Removed a total of 25379 redundant transitions.
[2024-05-20 21:50:12] [INFO ] Flatten gal took : 3787 ms
[2024-05-20 21:50:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 18800 labels/synchronizations in 6110 ms.
[2024-05-20 21:50:18] [INFO ] Time to serialize gal into /tmp/LTL13979773004714659519.gal : 121 ms
[2024-05-20 21:50:18] [INFO ] Time to serialize properties into /tmp/LTL1879627349881734317.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/LTL13979773004714659519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1879627349881734317.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(F(("(u68.Node55GiveAnswer67<1)")&&((G("(u27.Node14GiveAnswer26<1)"))||(("(u27.Node14GiveAnswer26<1)")&&(G(F("(u22.Node54GiveAnswe...172
Formula 0 simplified : XG(!"(u68.Node55GiveAnswer67<1)" | (F!"(u27.Node14GiveAnswer26<1)" & (!"(u27.Node14GiveAnswer26<1)" | FG!"(u22.Node54GiveAnswer21>=1...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13405460024668582181
[2024-05-20 21:50:34] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13405460024668582181
Running compilation step : cd /tmp/ltsmin13405460024668582181;'/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/ltsmin13405460024668582181;'/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/ltsmin13405460024668582181;'/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 CANInsertWithFailure-PT-080-LTLFireability-05 finished in 442565 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' '!(F(G(((p0&&X(p1)) U p2))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-080-LTLFireability-09
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 13 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 7973 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2024-05-20 21:50:45] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:50:49] [INFO ] Computed 82 invariants in 4256 ms
[2024-05-20 21:50:51] [INFO ] Implicit Places using invariants in 5885 ms returned []
Implicit Place search using SMT only with invariants took 5886 ms to find 0 implicit places.
[2024-05-20 21:50:51] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:50:51] [INFO ] Invariant cache hit.
[2024-05-20 21:51:10] [INFO ] Dead Transitions using invariants and state equation in 19552 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33416 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s4886 1) (GEQ s6348 1)), p0:(GEQ s4886 1), p1:(GEQ s766 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 248 reset in 2676 ms.
Product exploration explored 100000 steps with 248 reset in 2807 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (OR p2 p0)), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (OR p2 p0))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 443 ms. (steps per millisecond=22 ) 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 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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
Interrupted probabilistic random walk after 53461 steps, run timeout after 3002 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53461 steps, saw 46034 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 21:51:20] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:51:20] [INFO ] Invariant cache hit.
[2024-05-20 21:51:21] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:51:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:51:33] [INFO ] After 12662ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2024-05-20 21:51:34] [INFO ] State equation strengthened by 19115 read => feed constraints.
[2024-05-20 21:51:40] [INFO ] After 6163ms SMT Verify possible using 19115 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-20 21:51:40] [INFO ] After 19951ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-20 21:51:40] [INFO ] [Nat]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 21:51:41] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 21:51:56] [INFO ] After 14785ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-20 21:51:58] [INFO ] After 2887ms SMT Verify possible using 19115 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-20 21:52:00] [INFO ] After 4663ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 1267 ms.
[2024-05-20 21:52:01] [INFO ] After 21755ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 6886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6885 transition count 32002
Applied a total of 6483 rules in 6193 ms. Remains 6885 /6886 variables (removed 1) and now considering 32002/32003 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6196 ms. Remains : 6885/6886 places, 32002/32003 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32002 rows 6885 cols
[2024-05-20 21:52:10] [INFO ] Computed 82 invariants in 1975 ms
[2024-05-20 21:52:11] [INFO ] [Real]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 21:52:11] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 108 ms returned sat
[2024-05-20 21:52:28] [INFO ] After 16768ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:52:28] [INFO ] State equation strengthened by 31754 read => feed constraints.
[2024-05-20 21:52:33] [INFO ] After 5294ms SMT Verify possible using 31754 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:52:33] [INFO ] After 23273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:52:34] [INFO ] [Nat]Absence check using 80 positive place invariants in 71 ms returned sat
[2024-05-20 21:52:34] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 109 ms returned sat
[2024-05-20 21:52:54] [INFO ] After 19309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:52:58] [INFO ] After 4609ms SMT Verify possible using 31754 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:52:58] [INFO ] After 4755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-20 21:52:58] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2275 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2275 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (OR p2 p0)), (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (OR p2 p0))), (X (X (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (G (OR p0 p2)), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2)))]
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 6886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Applied a total of 0 rules in 1611 ms. Remains 6886 /6886 variables (removed 0) and now considering 32003/32003 (removed 0) transitions.
[2024-05-20 21:53:03] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2024-05-20 21:53:07] [INFO ] Computed 82 invariants in 4362 ms
[2024-05-20 21:53:09] [INFO ] Implicit Places using invariants in 6000 ms returned []
Implicit Place search using SMT only with invariants took 6003 ms to find 0 implicit places.
[2024-05-20 21:53:09] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:53:09] [INFO ] Invariant cache hit.
[2024-05-20 21:53:28] [INFO ] Dead Transitions using invariants and state equation in 19636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27251 ms. Remains : 6886/6886 places, 32003/32003 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), true, (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 54484 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54484 steps, saw 46179 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 21:53:32] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:53:32] [INFO ] Invariant cache hit.
[2024-05-20 21:53:33] [INFO ] [Real]Absence check using 80 positive place invariants in 69 ms returned sat
[2024-05-20 21:53:33] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 108 ms returned sat
[2024-05-20 21:53:48] [INFO ] After 14542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-20 21:53:48] [INFO ] State equation strengthened by 19115 read => feed constraints.
[2024-05-20 21:53:54] [INFO ] After 6358ms SMT Verify possible using 19115 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:53:54] [INFO ] After 22218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:53:55] [INFO ] [Nat]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:53:55] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 21:54:09] [INFO ] After 13614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 21:54:12] [INFO ] After 2869ms SMT Verify possible using 19115 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 21:54:14] [INFO ] After 4645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1257 ms.
[2024-05-20 21:54:15] [INFO ] After 20654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 6886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6885 transition count 32002
Applied a total of 6483 rules in 5934 ms. Remains 6885 /6886 variables (removed 1) and now considering 32002/32003 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5935 ms. Remains : 6885/6886 places, 32002/32003 transitions.
Finished random walk after 8498 steps, including 18 resets, run visited all 2 properties in 283 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), true, (X (X (NOT p1))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 6 factoid took 153 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 247 reset in 2814 ms.
Product exploration explored 100000 steps with 246 reset in 2751 ms.
Built C files in :
/tmp/ltsmin15001563628149561241
[2024-05-20 21:54:27] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15001563628149561241
Running compilation step : cd /tmp/ltsmin15001563628149561241;'/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/ltsmin15001563628149561241;'/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/ltsmin15001563628149561241;'/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 6886 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6886/6886 places, 32003/32003 transitions.
Applied a total of 0 rules in 1855 ms. Remains 6886 /6886 variables (removed 0) and now considering 32003/32003 (removed 0) transitions.
[2024-05-20 21:54:32] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:54:32] [INFO ] Invariant cache hit.
[2024-05-20 21:54:34] [INFO ] Implicit Places using invariants in 1619 ms returned []
Implicit Place search using SMT only with invariants took 1620 ms to find 0 implicit places.
[2024-05-20 21:54:34] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2024-05-20 21:54:34] [INFO ] Invariant cache hit.
[2024-05-20 21:54:53] [INFO ] Dead Transitions using invariants and state equation in 19141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22620 ms. Remains : 6886/6886 places, 32003/32003 transitions.
Built C files in :
/tmp/ltsmin13563745013233489406
[2024-05-20 21:54:53] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13563745013233489406
Running compilation step : cd /tmp/ltsmin13563745013233489406;'/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/ltsmin13563745013233489406;'/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/ltsmin13563745013233489406;'/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-20 21:54:57] [INFO ] Flatten gal took : 492 ms
[2024-05-20 21:54:58] [INFO ] Flatten gal took : 519 ms
[2024-05-20 21:54:58] [INFO ] Time to serialize gal into /tmp/LTL68278456082174898.gal : 227 ms
[2024-05-20 21:54:58] [INFO ] Time to serialize properties into /tmp/LTL6528750117738337067.prop : 8 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/LTL68278456082174898.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18396694796863840116.hoa' '-atoms' '/tmp/LTL6528750117738337067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6528750117738337067.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18396694796863840116.hoa
Detected timeout of ITS tools.
[2024-05-20 21:55:14] [INFO ] Flatten gal took : 512 ms
[2024-05-20 21:55:15] [INFO ] Flatten gal took : 535 ms
[2024-05-20 21:55:15] [INFO ] Time to serialize gal into /tmp/LTL17675040372498058295.gal : 96 ms
[2024-05-20 21:55:15] [INFO ] Time to serialize properties into /tmp/LTL5954818149613628966.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/LTL17675040372498058295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5954818149613628966.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((("(Node55GiveAnswer1>=1)")&&(X("(Node3GiveAnswer43>=1)")))U("((Node55GiveAnswer1<1)||(Node73GiveAnswer22>=1))")))))
Formula 0 simplified : GF((!"(Node55GiveAnswer1>=1)" | X!"(Node3GiveAnswer43>=1)") R !"((Node55GiveAnswer1<1)||(Node73GiveAnswer22>=1))")
Detected timeout of ITS tools.
[2024-05-20 21:55:30] [INFO ] Flatten gal took : 497 ms
[2024-05-20 21:55:30] [INFO ] Applying decomposition
[2024-05-20 21:55:31] [INFO ] Flatten gal took : 531 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/graph9632544581738547799.txt' '-o' '/tmp/graph9632544581738547799.bin' '-w' '/tmp/graph9632544581738547799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9632544581738547799.bin' '-l' '-1' '-v' '-w' '/tmp/graph9632544581738547799.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:55:32] [INFO ] Decomposing Gal with order
[2024-05-20 21:55:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:55:36] [INFO ] Removed a total of 25416 redundant transitions.
[2024-05-20 21:55:37] [INFO ] Flatten gal took : 3857 ms
[2024-05-20 21:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 18800 labels/synchronizations in 5971 ms.
[2024-05-20 21:55:43] [INFO ] Time to serialize gal into /tmp/LTL14632411068508876847.gal : 106 ms
[2024-05-20 21:55:43] [INFO ] Time to serialize properties into /tmp/LTL8675785519237802332.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/LTL14632411068508876847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8675785519237802332.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((("(u2.Node55GiveAnswer1>=1)")&&(X("(u44.Node3GiveAnswer43>=1)")))U("((u2.Node55GiveAnswer1<1)||(u23.Node73GiveAnswer22>=1))"))...158
Formula 0 simplified : GF((!"(u2.Node55GiveAnswer1>=1)" | X!"(u44.Node3GiveAnswer43>=1)") R !"((u2.Node55GiveAnswer1<1)||(u23.Node73GiveAnswer22>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4611980027620493467
[2024-05-20 21:55:58] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4611980027620493467
Running compilation step : cd /tmp/ltsmin4611980027620493467;'/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/ltsmin4611980027620493467;'/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/ltsmin4611980027620493467;'/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 CANInsertWithFailure-PT-080-LTLFireability-09 finished in 324427 ms.
[2024-05-20 21:56:02] [INFO ] Flatten gal took : 668 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5210092098283869857
[2024-05-20 21:56:02] [INFO ] Too many transitions (38880) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:56:03] [INFO ] Built C files in 220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5210092098283869857
Running compilation step : cd /tmp/ltsmin5210092098283869857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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-20 21:56:03] [INFO ] Applying decomposition
[2024-05-20 21:56:03] [INFO ] Flatten gal took : 698 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/graph8327890111943669826.txt' '-o' '/tmp/graph8327890111943669826.bin' '-w' '/tmp/graph8327890111943669826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8327890111943669826.bin' '-l' '-1' '-v' '-w' '/tmp/graph8327890111943669826.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:56:05] [INFO ] Decomposing Gal with order
[2024-05-20 21:56:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:56:09] [INFO ] Removed a total of 19234 redundant transitions.
[2024-05-20 21:56:10] [INFO ] Flatten gal took : 2561 ms
[2024-05-20 21:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 25365 labels/synchronizations in 2947 ms.
[2024-05-20 21:56:13] [INFO ] Time to serialize gal into /tmp/LTLFireability4774805448705298935.gal : 167 ms
[2024-05-20 21:56:13] [INFO ] Time to serialize properties into /tmp/LTLFireability15851293199931233371.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/LTLFireability4774805448705298935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15851293199931233371.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 5 LTL properties
Checking formula 0 : !((G(F(("(i71.u286.Node41GiveAnswer71<1)")U(("((i8.u35.Node56GiveAnswer8<1)&&(i71.u286.Node41GiveAnswer71<1))")||(G("(i71.u286.Node41G...177
Formula 0 simplified : FG(!"(i71.u286.Node41GiveAnswer71<1)" M !"((i8.u35.Node56GiveAnswer8<1)&&(i71.u286.Node41GiveAnswer71<1))")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5210092098283869857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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 144 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5210092098283869857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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 144 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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5390556 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15980952 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="CANInsertWithFailure-PT-080"
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 CANInsertWithFailure-PT-080, 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 r087-tall-171620521500098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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