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-171620521500097.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500097
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716238429049

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 20:53:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:53:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:53:51] [INFO ] Load time of PNML (sax parser for PT used): 913 ms
[2024-05-20 20:53:51] [INFO ] Transformed 13764 places.
[2024-05-20 20:53:51] [INFO ] Transformed 38880 transitions.
[2024-05-20 20:53:51] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 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 4759 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:54:06] [INFO ] Computed 82 invariants in 9698 ms
[2024-05-20 20:54:07] [INFO ] Implicit Places using invariants in 11063 ms returned []
Implicit Place search using SMT only with invariants took 11094 ms to find 0 implicit places.
[2024-05-20 20:54:07] [INFO ] Invariant cache hit.
[2024-05-20 20:54:09] [INFO ] Dead Transitions using invariants and state equation in 1198 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 17063 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 33 out of 13763 places after structural reductions.
[2024-05-20 20:54:10] [INFO ] Flatten gal took : 1163 ms
[2024-05-20 20:54:11] [INFO ] Flatten gal took : 946 ms
[2024-05-20 20:54:13] [INFO ] Input system was already deterministic with 38880 transitions.
Support contains 30 out of 13763 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) 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 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 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 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 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 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 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 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 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-20 20:54:14] [INFO ] Invariant cache hit.
[2024-05-20 20:54:18] [INFO ] [Real]Absence check using 80 positive place invariants in 155 ms returned sat
[2024-05-20 20:54:19] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 269 ms returned sat
[2024-05-20 20:54:19] [INFO ] After 5245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-20 20:54:23] [INFO ] [Nat]Absence check using 80 positive place invariants in 131 ms returned sat
[2024-05-20 20:54:23] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 275 ms returned sat
[2024-05-20 20:54:44] [INFO ] After 18472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-20 20:54:45] [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.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:54:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:54:45] [INFO ] After 25200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 13763 transition count 38323
Reduce places removed 557 places and 0 transitions.
Iterating post reduction 1 with 557 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 6308 Post agglomeration using F-continuation condition.Transition count delta: 6308
Deduced a syphon composed of 6308 places in 34 ms
Reduce places removed 6308 places and 0 transitions.
Iterating global reduction 2 with 12616 rules applied. Total rules applied 13730 place count 6898 transition count 32015
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13733 place count 6898 transition count 32012
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13736 place count 6895 transition count 32012
Partial Free-agglomeration rule applied 6468 times.
Drop transitions removed 6468 transitions
Iterating global reduction 3 with 6468 rules applied. Total rules applied 20204 place count 6895 transition count 32012
Applied a total of 20204 rules in 14923 ms. Remains 6895 /13763 variables (removed 6868) and now considering 32012/38880 (removed 6868) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14932 ms. Remains : 6895/13763 places, 32012/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) 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 14) 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 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
[2024-05-20 20:55:01] [INFO ] Flow matrix only has 31999 transitions (discarded 13 similar events)
// Phase 1: matrix 31999 rows 6895 cols
[2024-05-20 20:55:03] [INFO ] Computed 82 invariants in 1977 ms
[2024-05-20 20:55:04] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 20:55:05] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 20:55:05] [INFO ] After 2530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-20 20:55:07] [INFO ] [Nat]Absence check using 80 positive place invariants in 67 ms returned sat
[2024-05-20 20:55:07] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 20:55:30] [INFO ] After 22146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-20 20:55:31] [INFO ] State equation strengthened by 31710 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:55:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:55:31] [INFO ] After 25338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 6895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6895/6895 places, 32012/32012 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6895 transition count 32011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6894 transition count 32011
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 6 place count 6892 transition count 32009
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 6892 transition count 32009
Applied a total of 8 rules in 7570 ms. Remains 6892 /6895 variables (removed 3) and now considering 32009/32012 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7570 ms. Remains : 6892/6895 places, 32009/32012 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-20 20:55:39] [INFO ] Flow matrix only has 31998 transitions (discarded 11 similar events)
// Phase 1: matrix 31998 rows 6892 cols
[2024-05-20 20:55:41] [INFO ] Computed 82 invariants in 2177 ms
[2024-05-20 20:55:43] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 20:55:43] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 101 ms returned sat
[2024-05-20 20:55:43] [INFO ] After 2181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-20 20:55:45] [INFO ] [Nat]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 20:55:45] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 103 ms returned sat
[2024-05-20 20:56:08] [INFO ] After 22522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-20 20:56:09] [INFO ] State equation strengthened by 31718 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:56:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:56:09] [INFO ] After 25374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 18 out of 6892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 32009/32009 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6892 transition count 32009
Applied a total of 3 rules in 4362 ms. Remains 6892 /6892 variables (removed 0) and now considering 32009/32009 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4363 ms. Remains : 6892/6892 places, 32009/32009 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' '!(X(G(p0)))'
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 3538 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 20:56:26] [INFO ] Computed 82 invariants in 8966 ms
[2024-05-20 20:56:27] [INFO ] Implicit Places using invariants in 10251 ms returned []
Implicit Place search using SMT only with invariants took 10257 ms to find 0 implicit places.
[2024-05-20 20:56:27] [INFO ] Invariant cache hit.
[2024-05-20 20:56:29] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15059 ms. Remains : 13763/13763 places, 38880/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 204 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 3 s6730) (LEQ 1 s7542) (LEQ s11908 s12156))], 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 7 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-00 finished in 15489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
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 3582 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 20:56:32] [INFO ] Invariant cache hit.
[2024-05-20 20:56:34] [INFO ] Implicit Places using invariants in 1287 ms returned []
Implicit Place search using SMT only with invariants took 1289 ms to find 0 implicit places.
[2024-05-20 20:56:34] [INFO ] Invariant cache hit.
[2024-05-20 20:56:35] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6111 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s8885 s10227)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6475 ms.
Product exploration explored 100000 steps with 33333 reset in 6094 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-01 finished in 19042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 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 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 19 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 8762 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2024-05-20 20:56:57] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-20 20:57:01] [INFO ] Computed 82 invariants in 4180 ms
[2024-05-20 20:57:03] [INFO ] Implicit Places using invariants in 5918 ms returned []
Implicit Place search using SMT only with invariants took 5921 ms to find 0 implicit places.
[2024-05-20 20:57:03] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-20 20:57:03] [INFO ] Invariant cache hit.
[2024-05-20 20:57:23] [INFO ] Dead Transitions using invariants and state equation in 20243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34934 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s5308)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 248 reset in 2782 ms.
Product exploration explored 100000 steps with 247 reset in 2777 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 262 ms. (steps per millisecond=38 ) 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 56895 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56895 steps, saw 46516 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:57:32] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-20 20:57:32] [INFO ] Invariant cache hit.
[2024-05-20 20:57:33] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 20:57:33] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 107 ms returned sat
[2024-05-20 20:57:46] [INFO ] After 12732ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:57:46] [INFO ] State equation strengthened by 19118 read => feed constraints.
[2024-05-20 20:57:48] [INFO ] After 2365ms SMT Verify possible using 19118 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:57:48] [INFO ] After 16244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:57:49] [INFO ] [Nat]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 20:57:49] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 20:58:02] [INFO ] After 12996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:58:04] [INFO ] After 2059ms SMT Verify possible using 19118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:58:05] [INFO ] After 2904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 599 ms.
[2024-05-20 20:58:06] [INFO ] After 17458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 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 6482 place count 6882 transition count 31999
Applied a total of 6482 rules in 5574 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5574 ms. Remains : 6882/6883 places, 31999/32000 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 73261 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73261 steps, saw 63927 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:58:15] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
// Phase 1: matrix 31998 rows 6882 cols
[2024-05-20 20:58:17] [INFO ] Computed 82 invariants in 1967 ms
[2024-05-20 20:58:18] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 20:58:18] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2024-05-20 20:58:33] [INFO ] After 14822ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:58:33] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 20:58:37] [INFO ] After 4081ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:58:37] [INFO ] After 20188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:58:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 20:58:38] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 98 ms returned sat
[2024-05-20 20:58:54] [INFO ] After 16061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:58:58] [INFO ] After 4225ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:58:59] [INFO ] After 5409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 882 ms.
[2024-05-20 20:59:00] [INFO ] After 23240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2033 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2033 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2143 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-20 20:59:04] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-20 20:59:04] [INFO ] Invariant cache hit.
[2024-05-20 20:59:10] [INFO ] Implicit Places using invariants in 5958 ms returned []
Implicit Place search using SMT only with invariants took 5959 ms to find 0 implicit places.
[2024-05-20 20:59:10] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-20 20:59:10] [INFO ] Invariant cache hit.
[2024-05-20 20:59:29] [INFO ] Dead Transitions using invariants and state equation in 18961 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27075 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1727 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2024-05-20 20:59:31] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-20 20:59:35] [INFO ] Computed 82 invariants in 4018 ms
[2024-05-20 20:59:37] [INFO ] Implicit Places using invariants in 5744 ms returned []
Implicit Place search using SMT only with invariants took 5745 ms to find 0 implicit places.
[2024-05-20 20:59:37] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-20 20:59:37] [INFO ] Invariant cache hit.
[2024-05-20 20:59:57] [INFO ] Dead Transitions using invariants and state equation in 19965 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27455 ms. Remains : 6883/6883 places, 32000/32000 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 56869 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56869 steps, saw 46510 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:00:01] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-20 21:00:01] [INFO ] Invariant cache hit.
[2024-05-20 21:00:01] [INFO ] [Real]Absence check using 80 positive place invariants in 60 ms returned sat
[2024-05-20 21:00:01] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 100 ms returned sat
[2024-05-20 21:00:14] [INFO ] After 12874ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:00:15] [INFO ] State equation strengthened by 19118 read => feed constraints.
[2024-05-20 21:00:17] [INFO ] After 2106ms SMT Verify possible using 19118 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:00:17] [INFO ] After 16019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:00:17] [INFO ] [Nat]Absence check using 80 positive place invariants in 59 ms returned sat
[2024-05-20 21:00:17] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 96 ms returned sat
[2024-05-20 21:00:29] [INFO ] After 11491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:00:31] [INFO ] After 2098ms SMT Verify possible using 19118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:00:32] [INFO ] After 2919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 585 ms.
[2024-05-20 21:00:33] [INFO ] After 15861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 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 6482 place count 6882 transition count 31999
Applied a total of 6482 rules in 5662 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5662 ms. Remains : 6882/6883 places, 31999/32000 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 1) 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 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:00:42] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
// Phase 1: matrix 31998 rows 6882 cols
[2024-05-20 21:00:44] [INFO ] Computed 82 invariants in 1948 ms
[2024-05-20 21:00:44] [INFO ] [Real]Absence check using 80 positive place invariants in 61 ms returned sat
[2024-05-20 21:00:44] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:00:58] [INFO ] After 14065ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:00:59] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2024-05-20 21:01:03] [INFO ] After 4096ms SMT Verify possible using 31758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:01:03] [INFO ] After 19295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:01:04] [INFO ] [Nat]Absence check using 80 positive place invariants in 59 ms returned sat
[2024-05-20 21:01:04] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 97 ms returned sat
[2024-05-20 21:01:19] [INFO ] After 14755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:01:23] [INFO ] After 3989ms SMT Verify possible using 31758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:01:24] [INFO ] After 5083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 788 ms.
[2024-05-20 21:01:24] [INFO ] After 21559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2003 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2003 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2087 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-20 21:01:28] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-20 21:01:29] [INFO ] Invariant cache hit.
[2024-05-20 21:01:35] [INFO ] Implicit Places using invariants in 6054 ms returned []
Implicit Place search using SMT only with invariants took 6081 ms to find 0 implicit places.
[2024-05-20 21:01:35] [INFO ] Flow matrix only has 31998 transitions (discarded 1 similar events)
[2024-05-20 21:01:35] [INFO ] Invariant cache hit.
[2024-05-20 21:01:54] [INFO ] Dead Transitions using invariants and state equation in 19413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27587 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 247 reset in 3489 ms.
Product exploration explored 100000 steps with 248 reset in 3680 ms.
Built C files in :
/tmp/ltsmin6750677457343907658
[2024-05-20 21:02:02] [INFO ] Too many transitions (32000) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:02:02] [INFO ] Built C files in 321ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6750677457343907658
Running compilation step : cd /tmp/ltsmin6750677457343907658;'/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/ltsmin6750677457343907658;'/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/ltsmin6750677457343907658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1752 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2024-05-20 21:02:07] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-20 21:02:11] [INFO ] Computed 82 invariants in 4274 ms
[2024-05-20 21:02:13] [INFO ] Implicit Places using invariants in 5932 ms returned []
Implicit Place search using SMT only with invariants took 5933 ms to find 0 implicit places.
[2024-05-20 21:02:13] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-20 21:02:13] [INFO ] Invariant cache hit.
[2024-05-20 21:02:32] [INFO ] Dead Transitions using invariants and state equation in 19860 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27547 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Built C files in :
/tmp/ltsmin16270598205091880181
[2024-05-20 21:02:33] [INFO ] Too many transitions (32000) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:02:33] [INFO ] Built C files in 222ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16270598205091880181
Running compilation step : cd /tmp/ltsmin16270598205091880181;'/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/ltsmin16270598205091880181;'/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/ltsmin16270598205091880181;'/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:02:37] [INFO ] Flatten gal took : 513 ms
[2024-05-20 21:02:38] [INFO ] Flatten gal took : 589 ms
[2024-05-20 21:02:38] [INFO ] Time to serialize gal into /tmp/LTL15389124363768298469.gal : 124 ms
[2024-05-20 21:02:38] [INFO ] Time to serialize properties into /tmp/LTL17504825420930573553.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15389124363768298469.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13097883899433727780.hoa' '-atoms' '/tmp/LTL17504825420930573553.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17504825420930573553.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13097883899433727780.hoa
Detected timeout of ITS tools.
[2024-05-20 21:02:54] [INFO ] Flatten gal took : 526 ms
[2024-05-20 21:02:54] [INFO ] Flatten gal took : 494 ms
[2024-05-20 21:02:55] [INFO ] Time to serialize gal into /tmp/LTL3085547728630864023.gal : 97 ms
[2024-05-20 21:02:55] [INFO ] Time to serialize properties into /tmp/LTL2837171208911208895.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/LTL3085547728630864023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2837171208911208895.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("(Node60requestsent25<2)"))))
Formula 0 simplified : FG!"(Node60requestsent25<2)"
Detected timeout of ITS tools.
[2024-05-20 21:03:10] [INFO ] Flatten gal took : 548 ms
[2024-05-20 21:03:10] [INFO ] Applying decomposition
[2024-05-20 21:03:11] [INFO ] Flatten gal took : 580 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/graph1837704478576521462.txt' '-o' '/tmp/graph1837704478576521462.bin' '-w' '/tmp/graph1837704478576521462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1837704478576521462.bin' '-l' '-1' '-v' '-w' '/tmp/graph1837704478576521462.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:03:12] [INFO ] Decomposing Gal with order
[2024-05-20 21:03:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:03:17] [INFO ] Removed a total of 25416 redundant transitions.
[2024-05-20 21:03:18] [INFO ] Flatten gal took : 4538 ms
[2024-05-20 21:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 18803 labels/synchronizations in 6138 ms.
[2024-05-20 21:03:24] [INFO ] Time to serialize gal into /tmp/LTL5315494713734800792.gal : 153 ms
[2024-05-20 21:03:24] [INFO ] Time to serialize properties into /tmp/LTL18320641766987462372.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/LTL5315494713734800792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18320641766987462372.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 : !((G(F("(u61.Node60requestsent25<2)"))))
Formula 0 simplified : FG!"(u61.Node60requestsent25<2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4644672827169668461
[2024-05-20 21:03:40] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4644672827169668461
Running compilation step : cd /tmp/ltsmin4644672827169668461;'/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/ltsmin4644672827169668461;'/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/ltsmin4644672827169668461;'/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-LTLCardinality-02 finished in 414846 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(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 3624 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:03:57] [INFO ] Computed 82 invariants in 10607 ms
[2024-05-20 21:03:58] [INFO ] Implicit Places using invariants in 11931 ms returned []
Implicit Place search using SMT only with invariants took 11933 ms to find 0 implicit places.
[2024-05-20 21:03:58] [INFO ] Invariant cache hit.
[2024-05-20 21:04:00] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16827 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s4981)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2057 steps with 0 reset in 59 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-03 finished in 17079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 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 3530 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:04:03] [INFO ] Invariant cache hit.
[2024-05-20 21:04:05] [INFO ] Implicit Places using invariants in 1271 ms returned []
Implicit Place search using SMT only with invariants took 1272 ms to find 0 implicit places.
[2024-05-20 21:04:05] [INFO ] Invariant cache hit.
[2024-05-20 21:04:06] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6095 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 3 s3111) (LEQ 2 s11290))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2113 steps with 0 reset in 63 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-04 finished in 6343 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 U 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 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 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 16 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 8744 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2024-05-20 21:04:15] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
// Phase 1: matrix 25840 rows 6884 cols
[2024-05-20 21:04:19] [INFO ] Computed 82 invariants in 4166 ms
[2024-05-20 21:04:20] [INFO ] Implicit Places using invariants in 4899 ms returned []
Implicit Place search using SMT only with invariants took 4900 ms to find 0 implicit places.
[2024-05-20 21:04:20] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2024-05-20 21:04:20] [INFO ] Invariant cache hit.
[2024-05-20 21:04:40] [INFO ] Dead Transitions using invariants and state equation in 20577 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 34226 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s2078), p0:(LEQ s929 s4280)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 396 steps with 0 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-05 finished in 34413 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||(F(p1)&&G(p2))))))'
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 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 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 13 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 8514 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2024-05-20 21:04:49] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-20 21:04:53] [INFO ] Computed 82 invariants in 4089 ms
[2024-05-20 21:04:54] [INFO ] Implicit Places using invariants in 4805 ms returned []
Implicit Place search using SMT only with invariants took 4811 ms to find 0 implicit places.
[2024-05-20 21:04:54] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-20 21:04:54] [INFO ] Invariant cache hit.
[2024-05-20 21:05:14] [INFO ] Dead Transitions using invariants and state equation in 19754 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 33080 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s1579), p2:(GT 3 s1708), p1:(GT s479 s513)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 248 reset in 3523 ms.
Product exploration explored 100000 steps with 251 reset in 3432 ms.
Computed a total of 245 stabilizing places and 402 stable transitions
Computed a total of 245 stabilizing places and 402 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 447 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 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 52257 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52257 steps, saw 45849 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 21:05:25] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-20 21:05:25] [INFO ] Invariant cache hit.
[2024-05-20 21:05:26] [INFO ] [Real]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:05:26] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 106 ms returned sat
[2024-05-20 21:05:42] [INFO ] After 16107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-20 21:05:43] [INFO ] State equation strengthened by 19118 read => feed constraints.
[2024-05-20 21:05:47] [INFO ] After 4332ms SMT Verify possible using 19118 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 21:05:47] [INFO ] After 22036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 21:05:48] [INFO ] [Nat]Absence check using 80 positive place invariants in 62 ms returned sat
[2024-05-20 21:05:48] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 102 ms returned sat
[2024-05-20 21:06:03] [INFO ] After 14120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 21:06:06] [INFO ] After 3972ms SMT Verify possible using 19118 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 21:06:11] [INFO ] After 8010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1441 ms.
[2024-05-20 21:06:12] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 4 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 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6885 transition count 32000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6478 times.
Drop transitions removed 6478 transitions
Iterating global reduction 1 with 6478 rules applied. Total rules applied 6482 place count 6883 transition count 32000
Applied a total of 6482 rules in 5978 ms. Remains 6883 /6885 variables (removed 2) and now considering 32000/32002 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5981 ms. Remains : 6883/6885 places, 32000/32002 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:06:19] [INFO ] Flow matrix only has 31997 transitions (discarded 3 similar events)
// Phase 1: matrix 31997 rows 6883 cols
[2024-05-20 21:06:21] [INFO ] Computed 82 invariants in 1999 ms
[2024-05-20 21:06:21] [INFO ] [Real]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:06:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 104 ms returned sat
[2024-05-20 21:06:40] [INFO ] After 18492ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:06:40] [INFO ] State equation strengthened by 31754 read => feed constraints.
[2024-05-20 21:06:46] [INFO ] After 5283ms SMT Verify possible using 31754 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-20 21:06:46] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 6882 transition count 31999
Applied a total of 3 rules in 4282 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4282 ms. Remains : 6882/6883 places, 31999/32000 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 72864 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72864 steps, saw 63881 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:06:53] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
// Phase 1: matrix 31997 rows 6882 cols
[2024-05-20 21:06:55] [INFO ] Computed 82 invariants in 2085 ms
[2024-05-20 21:06:56] [INFO ] [Real]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:06:56] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 105 ms returned sat
[2024-05-20 21:07:14] [INFO ] After 17438ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:07:14] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:07:20] [INFO ] After 6410ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0
[2024-05-20 21:07:20] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2191 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2192 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2133 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-20 21:07:25] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-20 21:07:25] [INFO ] Invariant cache hit.
[2024-05-20 21:07:31] [INFO ] Implicit Places using invariants in 6016 ms returned []
Implicit Place search using SMT only with invariants took 6017 ms to find 0 implicit places.
[2024-05-20 21:07:31] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-20 21:07:31] [INFO ] Invariant cache hit.
[2024-05-20 21:07:51] [INFO ] Dead Transitions using invariants and state equation in 20101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28257 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 229 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 4 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 1751 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-20 21:07:53] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-20 21:07:58] [INFO ] Computed 82 invariants in 4189 ms
[2024-05-20 21:07:59] [INFO ] Implicit Places using invariants in 5994 ms returned []
Implicit Place search using SMT only with invariants took 5995 ms to find 0 implicit places.
[2024-05-20 21:07:59] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-20 21:07:59] [INFO ] Invariant cache hit.
[2024-05-20 21:08:19] [INFO ] Dead Transitions using invariants and state equation in 19898 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27652 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Computed a total of 245 stabilizing places and 402 stable transitions
Computed a total of 245 stabilizing places and 402 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 4) seen :3
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
Running SMT prover for 1 properties.
[2024-05-20 21:08:20] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-20 21:08:20] [INFO ] Invariant cache hit.
[2024-05-20 21:08:21] [INFO ] [Real]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:08:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 104 ms returned sat
[2024-05-20 21:08:37] [INFO ] After 15658ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:08:37] [INFO ] State equation strengthened by 19118 read => feed constraints.
[2024-05-20 21:08:39] [INFO ] After 2431ms SMT Verify possible using 19118 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:08:39] [INFO ] After 19254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:08:40] [INFO ] [Nat]Absence check using 80 positive place invariants in 63 ms returned sat
[2024-05-20 21:08:40] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 104 ms returned sat
[2024-05-20 21:08:55] [INFO ] After 14899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:08:58] [INFO ] After 2242ms SMT Verify possible using 19118 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 21:08:59] [INFO ] After 3191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 678 ms.
[2024-05-20 21:08:59] [INFO ] After 19695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 6885 transition count 32000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6883 transition count 32000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6479 times.
Drop transitions removed 6479 transitions
Iterating global reduction 3 with 6479 rules applied. Total rules applied 6485 place count 6882 transition count 31999
Applied a total of 6485 rules in 5758 ms. Remains 6882 /6885 variables (removed 3) and now considering 31999/32002 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5758 ms. Remains : 6882/6885 places, 31999/32002 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72377 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72377 steps, saw 63809 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:09:08] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
// Phase 1: matrix 31997 rows 6882 cols
[2024-05-20 21:09:11] [INFO ] Computed 82 invariants in 2120 ms
[2024-05-20 21:09:11] [INFO ] [Real]Absence check using 80 positive place invariants in 64 ms returned sat
[2024-05-20 21:09:11] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 106 ms returned sat
[2024-05-20 21:09:29] [INFO ] After 17602ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:09:29] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2024-05-20 21:09:35] [INFO ] After 6008ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:09:35] [INFO ] After 24816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:09:36] [INFO ] [Nat]Absence check using 80 positive place invariants in 65 ms returned sat
[2024-05-20 21:09:36] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 104 ms returned sat
[2024-05-20 21:09:52] [INFO ] After 16141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 21:10:00] [INFO ] After 7938ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2024-05-20 21:10:00] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2167 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2167 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2044 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2024-05-20 21:10:05] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-20 21:10:05] [INFO ] Invariant cache hit.
[2024-05-20 21:10:11] [INFO ] Implicit Places using invariants in 6470 ms returned []
Implicit Place search using SMT only with invariants took 6475 ms to find 0 implicit places.
[2024-05-20 21:10:11] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2024-05-20 21:10:11] [INFO ] Invariant cache hit.
[2024-05-20 21:10:32] [INFO ] Dead Transitions using invariants and state equation in 20853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29379 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 248 reset in 2745 ms.
Product exploration explored 100000 steps with 249 reset in 2757 ms.
Built C files in :
/tmp/ltsmin13867907237164308500
[2024-05-20 21:10:38] [INFO ] Too many transitions (32002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:10:38] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13867907237164308500
Running compilation step : cd /tmp/ltsmin13867907237164308500;'/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/ltsmin13867907237164308500;'/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/ltsmin13867907237164308500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 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 1851 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2024-05-20 21:10:43] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2024-05-20 21:10:47] [INFO ] Computed 82 invariants in 4104 ms
[2024-05-20 21:10:49] [INFO ] Implicit Places using invariants in 5708 ms returned []
Implicit Place search using SMT only with invariants took 5710 ms to find 0 implicit places.
[2024-05-20 21:10:49] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2024-05-20 21:10:49] [INFO ] Invariant cache hit.
[2024-05-20 21:11:08] [INFO ] Dead Transitions using invariants and state equation in 19428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27000 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Built C files in :
/tmp/ltsmin12159295906809300459
[2024-05-20 21:11:08] [INFO ] Too many transitions (32002) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:11:09] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12159295906809300459
Running compilation step : cd /tmp/ltsmin12159295906809300459;'/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/ltsmin12159295906809300459;'/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/ltsmin12159295906809300459;'/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:11:13] [INFO ] Flatten gal took : 503 ms
[2024-05-20 21:11:13] [INFO ] Flatten gal took : 532 ms
[2024-05-20 21:11:13] [INFO ] Time to serialize gal into /tmp/LTL2247873334734752212.gal : 115 ms
[2024-05-20 21:11:13] [INFO ] Time to serialize properties into /tmp/LTL12319657194004139611.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/LTL2247873334734752212.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12943811506425015253.hoa' '-atoms' '/tmp/LTL12319657194004139611.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/LTL12319657194004139611.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12943811506425015253.hoa
Detected timeout of ITS tools.
[2024-05-20 21:11:29] [INFO ] Flatten gal took : 499 ms
[2024-05-20 21:11:30] [INFO ] Flatten gal took : 592 ms
[2024-05-20 21:11:30] [INFO ] Time to serialize gal into /tmp/LTL13013452238642545729.gal : 97 ms
[2024-05-20 21:11:30] [INFO ] Time to serialize properties into /tmp/LTL10944016272667658681.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/LTL13013452238642545729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10944016272667658681.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node13requestsent55<1)")||((F("(Node79ResZone>Node0requestsent29)"))&&(G("(Node15requestsent24<3)")))))))
Formula 0 simplified : FG(!"(Node13requestsent55<1)" & (G!"(Node79ResZone>Node0requestsent29)" | F!"(Node15requestsent24<3)"))
Detected timeout of ITS tools.
[2024-05-20 21:11:46] [INFO ] Flatten gal took : 501 ms
[2024-05-20 21:11:46] [INFO ] Applying decomposition
[2024-05-20 21:11:46] [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/graph10711159605072460964.txt' '-o' '/tmp/graph10711159605072460964.bin' '-w' '/tmp/graph10711159605072460964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10711159605072460964.bin' '-l' '-1' '-v' '-w' '/tmp/graph10711159605072460964.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:11:48] [INFO ] Decomposing Gal with order
[2024-05-20 21:11:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:11:52] [INFO ] Removed a total of 25411 redundant transitions.
[2024-05-20 21:11:53] [INFO ] Flatten gal took : 4157 ms
[2024-05-20 21:12:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 18800 labels/synchronizations in 6241 ms.
[2024-05-20 21:12:02] [INFO ] Time to serialize gal into /tmp/LTL6070720135210897111.gal : 150 ms
[2024-05-20 21:12:02] [INFO ] Time to serialize properties into /tmp/LTL1152047729342225934.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/LTL6070720135210897111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1152047729342225934.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(("(gi0.gu14.Node13requestsent55<1)")||((F("(gu81.Node79ResZone>gu81.Node0requestsent29)"))&&(G("(gi0.gu16.Node15requestsent24<3...164
Formula 0 simplified : FG(!"(gi0.gu14.Node13requestsent55<1)" & (G!"(gu81.Node79ResZone>gu81.Node0requestsent29)" | F!"(gi0.gu16.Node15requestsent24<3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2698754775002962692
[2024-05-20 21:12:17] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2698754775002962692
Running compilation step : cd /tmp/ltsmin2698754775002962692;'/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/ltsmin2698754775002962692;'/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/ltsmin2698754775002962692;'/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-LTLCardinality-06 finished in 459388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1 U p2))))'
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 3779 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:12:33] [INFO ] Computed 82 invariants in 9059 ms
[2024-05-20 21:12:34] [INFO ] Implicit Places using invariants in 10148 ms returned []
Implicit Place search using SMT only with invariants took 10149 ms to find 0 implicit places.
[2024-05-20 21:12:34] [INFO ] Invariant cache hit.
[2024-05-20 21:12:35] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15065 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s10610 s5365), p1:(LEQ s6240 s10806), p0:(LEQ s6878 s245)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8249 ms.
Product exploration explored 100000 steps with 50000 reset in 8445 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 p1 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-07 finished in 32196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 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 3390 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:12:56] [INFO ] Invariant cache hit.
[2024-05-20 21:12:57] [INFO ] Implicit Places using invariants in 1256 ms returned []
Implicit Place search using SMT only with invariants took 1256 ms to find 0 implicit places.
[2024-05-20 21:12:57] [INFO ] Invariant cache hit.
[2024-05-20 21:12:58] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5812 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s12006)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-08 finished in 6006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((p1 U X(G(!p0))) U (p0&&(p1 U X(G(!p0)))))))))'
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 3569 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:13:02] [INFO ] Invariant cache hit.
[2024-05-20 21:13:03] [INFO ] Implicit Places using invariants in 1169 ms returned []
Implicit Place search using SMT only with invariants took 1170 ms to find 0 implicit places.
[2024-05-20 21:13:03] [INFO ] Invariant cache hit.
[2024-05-20 21:13:04] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6002 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), true, p0, p0, true]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s8088), p1:(LEQ s5689 s4501)], 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]]
Stuttering criterion allowed to conclude after 1990 steps with 0 reset in 42 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-10 finished in 6364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 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 3453 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2024-05-20 21:13:08] [INFO ] Invariant cache hit.
[2024-05-20 21:13:09] [INFO ] Implicit Places using invariants in 1280 ms returned []
Implicit Place search using SMT only with invariants took 1281 ms to find 0 implicit places.
[2024-05-20 21:13:09] [INFO ] Invariant cache hit.
[2024-05-20 21:13:11] [INFO ] Dead Transitions using invariants and state equation in 1263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6002 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-13 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:(LEQ s6990 s7553)], 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 549 steps with 0 reset in 13 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-13 finished in 6189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 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 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 13 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 8039 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2024-05-20 21:13:19] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2024-05-20 21:13:23] [INFO ] Computed 82 invariants in 4016 ms
[2024-05-20 21:13:25] [INFO ] Implicit Places using invariants in 5799 ms returned []
Implicit Place search using SMT only with invariants took 5801 ms to find 0 implicit places.
[2024-05-20 21:13:25] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2024-05-20 21:13:25] [INFO ] Invariant cache hit.
[2024-05-20 21:13:45] [INFO ] Dead Transitions using invariants and state equation in 20899 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34744 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s2005)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 391 steps with 0 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-15 finished in 34854 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)))'
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||(F(p1)&&G(p2))))))'
[2024-05-20 21:13:47] [INFO ] Flatten gal took : 931 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4024377284485447206
[2024-05-20 21:13:47] [INFO ] Too many transitions (38880) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:13:47] [INFO ] Built C files in 239ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4024377284485447206
Running compilation step : cd /tmp/ltsmin4024377284485447206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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:13:48] [INFO ] Applying decomposition
[2024-05-20 21:13:48] [INFO ] Flatten gal took : 896 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/graph2428732761937521907.txt' '-o' '/tmp/graph2428732761937521907.bin' '-w' '/tmp/graph2428732761937521907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2428732761937521907.bin' '-l' '-1' '-v' '-w' '/tmp/graph2428732761937521907.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:13:51] [INFO ] Decomposing Gal with order
[2024-05-20 21:13:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:13:56] [INFO ] Removed a total of 19239 redundant transitions.
[2024-05-20 21:13:56] [INFO ] Flatten gal took : 3428 ms
[2024-05-20 21:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 12478 labels/synchronizations in 3040 ms.
[2024-05-20 21:14:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality5252595693238584543.gal : 130 ms
[2024-05-20 21:14:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality6238205140991212004.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/LTLCardinality5252595693238584543.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6238205140991212004.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...297
Read 2 LTL properties
Checking formula 0 : !((G(F("(gi0.gi80.gu241.Node60requestsent25<2)"))))
Formula 0 simplified : FG!"(gi0.gi80.gu241.Node60requestsent25<2)"
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/ltsmin4024377284485447206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4024377284485447206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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 360 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)
ITS-tools command line returned an error code 137
[2024-05-20 21:33:33] [INFO ] Flatten gal took : 1983 ms
[2024-05-20 21:33:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality12116796339245035397.gal : 282 ms
[2024-05-20 21:33:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11523092058083655865.ltl : 5 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/LTLCardinality12116796339245035397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11523092058083655865.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...299
Read 2 LTL properties
Checking formula 0 : !((G(F("(Node60requestsent25<2)"))))
Formula 0 simplified : FG!"(Node60requestsent25<2)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 155396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12508648 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521500097"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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