Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690800764.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 39M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678381909345

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 17:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 17:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:11:52] [INFO ] Load time of PNML (sax parser for PT used): 926 ms
[2023-03-09 17:11:52] [INFO ] Transformed 13764 places.
[2023-03-09 17:11:52] [INFO ] Transformed 38880 transitions.
[2023-03-09 17:11:52] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 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 4568 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:12:07] [INFO ] Computed 82 place invariants in 9184 ms
[2023-03-09 17:12:09] [INFO ] Implicit Places using invariants in 11068 ms returned []
Implicit Place search using SMT only with invariants took 11099 ms to find 0 implicit places.
[2023-03-09 17:12:09] [INFO ] Invariant cache hit.
[2023-03-09 17:12:10] [INFO ] Dead Transitions using invariants and state equation in 1309 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 16997 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 45 out of 13763 places after structural reductions.
[2023-03-09 17:12:12] [INFO ] Flatten gal took : 1314 ms
[2023-03-09 17:12:13] [INFO ] Flatten gal took : 880 ms
[2023-03-09 17:12:15] [INFO ] Input system was already deterministic with 38880 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 986 ms. (steps per millisecond=10 ) properties (out of 32) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Running SMT prover for 29 properties.
[2023-03-09 17:12:16] [INFO ] Invariant cache hit.
[2023-03-09 17:12:24] [INFO ] [Real]Absence check using 80 positive place invariants in 220 ms returned sat
[2023-03-09 17:12:24] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 330 ms returned sat
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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 17:12:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:12:41] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 13763 transition count 38334
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 13217 transition count 38334
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1092 place count 13217 transition count 38331
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1098 place count 13214 transition count 38331
Performed 6302 Post agglomeration using F-continuation condition.Transition count delta: 6302
Deduced a syphon composed of 6302 places in 42 ms
Reduce places removed 6302 places and 0 transitions.
Iterating global reduction 2 with 12604 rules applied. Total rules applied 13702 place count 6912 transition count 32029
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 13714 place count 6912 transition count 32017
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 13726 place count 6900 transition count 32017
Partial Free-agglomeration rule applied 6472 times.
Drop transitions removed 6472 transitions
Iterating global reduction 3 with 6472 rules applied. Total rules applied 20198 place count 6900 transition count 32017
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 3 with 239 rules applied. Total rules applied 20437 place count 6900 transition count 32017
Applied a total of 20437 rules in 18539 ms. Remains 6900 /13763 variables (removed 6863) and now considering 32017/38880 (removed 6863) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18542 ms. Remains : 6900/13763 places, 32017/38880 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 843 ms. (steps per millisecond=11 ) properties (out of 29) seen :13
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 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 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 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 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 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 18 ms. (steps per millisecond=55 ) 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 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-09 17:13:01] [INFO ] Flow matrix only has 32005 transitions (discarded 12 similar events)
// Phase 1: matrix 32005 rows 6900 cols
[2023-03-09 17:13:03] [INFO ] Computed 82 place invariants in 1789 ms
[2023-03-09 17:13:05] [INFO ] [Real]Absence check using 80 positive place invariants in 82 ms returned sat
[2023-03-09 17:13:05] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2023-03-09 17:13:28] [INFO ] After 21087ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2023-03-09 17:13:28] [INFO ] State equation strengthened by 31706 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 17:13:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:13:28] [INFO ] After 25754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 23 out of 6900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6900/6900 places, 32017/32017 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6893 transition count 32010
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 6893 transition count 32010
Applied a total of 20 rules in 8014 ms. Remains 6893 /6900 variables (removed 7) and now considering 32010/32017 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8016 ms. Remains : 6893/6900 places, 32010/32017 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 16) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 17:13:37] [INFO ] Flow matrix only has 32004 transitions (discarded 6 similar events)
// Phase 1: matrix 32004 rows 6893 cols
[2023-03-09 17:13:40] [INFO ] Computed 82 place invariants in 2077 ms
[2023-03-09 17:13:42] [INFO ] [Real]Absence check using 80 positive place invariants in 116 ms returned sat
[2023-03-09 17:13:42] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 143 ms returned sat
[2023-03-09 17:14:02] [INFO ] After 19199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2023-03-09 17:14:03] [INFO ] State equation strengthened by 31728 read => feed constraints.
[2023-03-09 17:14:05] [INFO ] After 1630ms SMT Verify possible using 31728 Read/Feed constraints in real domain returned unsat :0 sat :8
[2023-03-09 17:14:05] [INFO ] After 1633ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 17:14:05] [INFO ] After 25069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 11 out of 6893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6893/6893 places, 32010/32010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6891 transition count 32008
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 6891 transition count 32008
Applied a total of 9 rules in 7314 ms. Remains 6891 /6893 variables (removed 2) and now considering 32008/32010 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7314 ms. Remains : 6891/6893 places, 32008/32010 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(G(p1)))))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3665 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:14:24] [INFO ] Computed 82 place invariants in 7559 ms
[2023-03-09 17:14:25] [INFO ] Implicit Places using invariants in 8937 ms returned []
Implicit Place search using SMT only with invariants took 8946 ms to find 0 implicit places.
[2023-03-09 17:14:25] [INFO ] Invariant cache hit.
[2023-03-09 17:14:26] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13728 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1029 1) (GEQ s5533 1)), p1:(LT s3244 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 51 reset in 2591 ms.
Entered a terminal (fully accepting) state of product in 31411 steps with 16 reset in 843 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-01 finished in 17630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3592 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:14:34] [INFO ] Invariant cache hit.
[2023-03-09 17:14:35] [INFO ] Implicit Places using invariants in 1291 ms returned []
Implicit Place search using SMT only with invariants took 1292 ms to find 0 implicit places.
[2023-03-09 17:14:35] [INFO ] Invariant cache hit.
[2023-03-09 17:14:36] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5976 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s329 1)), p1:(GEQ s8689 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-02 finished in 6374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 31 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 9285 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2023-03-09 17:14:46] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2023-03-09 17:14:50] [INFO ] Computed 82 place invariants in 4285 ms
[2023-03-09 17:14:51] [INFO ] Implicit Places using invariants in 4885 ms returned []
Implicit Place search using SMT only with invariants took 4889 ms to find 0 implicit places.
[2023-03-09 17:14:51] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-09 17:14:51] [INFO ] Invariant cache hit.
[2023-03-09 17:14:51] [INFO ] Dead Transitions using invariants and state equation in 798 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 14977 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s4973 1) (LT s3834 1)), p0:(LT s3834 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 250 reset in 3249 ms.
Product exploration explored 100000 steps with 248 reset in 3214 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 25 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:14:59] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-09 17:14:59] [INFO ] Invariant cache hit.
[2023-03-09 17:15:00] [INFO ] [Real]Absence check using 80 positive place invariants in 112 ms returned sat
[2023-03-09 17:15:00] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 134 ms returned sat
[2023-03-09 17:15:12] [INFO ] After 11364ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 17:15:12] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2023-03-09 17:15:14] [INFO ] After 2488ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:15:14] [INFO ] After 15290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:15:15] [INFO ] [Nat]Absence check using 80 positive place invariants in 103 ms returned sat
[2023-03-09 17:15:15] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 170 ms returned sat
[2023-03-09 17:15:27] [INFO ] After 11913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:15:30] [INFO ] After 2305ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:15:31] [INFO ] After 3243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 786 ms.
[2023-03-09 17:15:31] [INFO ] After 17128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 6843 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6844 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75968 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75968 steps, saw 64306 distinct states, run finished after 3006 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2023-03-09 17:15:44] [INFO ] Computed 82 place invariants in 2440 ms
[2023-03-09 17:15:45] [INFO ] [Real]Absence check using 80 positive place invariants in 77 ms returned sat
[2023-03-09 17:15:45] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 99 ms returned sat
[2023-03-09 17:16:00] [INFO ] After 14595ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 17:16:00] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2023-03-09 17:16:09] [INFO ] After 8262ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:16:09] [INFO ] After 24314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:16:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 121 ms returned sat
[2023-03-09 17:16:10] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 141 ms returned sat
[2023-03-09 17:16:27] [INFO ] After 16794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:16:31] [INFO ] After 4515ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:16:32] [INFO ] After 5787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1079 ms.
[2023-03-09 17:16:33] [INFO ] After 24882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2829 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2829 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2469 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2023-03-09 17:16:39] [INFO ] Invariant cache hit.
[2023-03-09 17:16:40] [INFO ] Implicit Places using invariants in 815 ms returned []
Implicit Place search using SMT only with invariants took 816 ms to find 0 implicit places.
[2023-03-09 17:16:40] [INFO ] Invariant cache hit.
[2023-03-09 17:16:57] [INFO ] Dead Transitions using invariants and state equation in 17016 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20309 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2256 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2023-03-09 17:16:59] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2023-03-09 17:17:04] [INFO ] Computed 82 place invariants in 4316 ms
[2023-03-09 17:17:05] [INFO ] Implicit Places using invariants in 5995 ms returned []
Implicit Place search using SMT only with invariants took 5998 ms to find 0 implicit places.
[2023-03-09 17:17:05] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-09 17:17:05] [INFO ] Invariant cache hit.
[2023-03-09 17:17:22] [INFO ] Dead Transitions using invariants and state equation in 17162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25421 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 56957 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56957 steps, saw 46521 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 17:17:26] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-09 17:17:26] [INFO ] Invariant cache hit.
[2023-03-09 17:17:28] [INFO ] [Real]Absence check using 80 positive place invariants in 109 ms returned sat
[2023-03-09 17:17:28] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 129 ms returned sat
[2023-03-09 17:17:41] [INFO ] After 12899ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 17:17:41] [INFO ] State equation strengthened by 19116 read => feed constraints.
[2023-03-09 17:17:43] [INFO ] After 2275ms SMT Verify possible using 19116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:17:43] [INFO ] After 16701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 17:17:44] [INFO ] [Nat]Absence check using 80 positive place invariants in 112 ms returned sat
[2023-03-09 17:17:44] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 135 ms returned sat
[2023-03-09 17:17:58] [INFO ] After 12917ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 17:18:01] [INFO ] After 2968ms SMT Verify possible using 19116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 17:18:03] [INFO ] After 5088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1594 ms.
[2023-03-09 17:18:04] [INFO ] After 21067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 32001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6481 times.
Drop transitions removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6884 transition count 32001
Applied a total of 6483 rules in 6727 ms. Remains 6884 /6885 variables (removed 1) and now considering 32001/32002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6728 ms. Remains : 6884/6885 places, 32001/32002 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72730 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72730 steps, saw 63861 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 32001 rows 6884 cols
[2023-03-09 17:18:16] [INFO ] Computed 82 place invariants in 1820 ms
[2023-03-09 17:18:17] [INFO ] [Real]Absence check using 80 positive place invariants in 105 ms returned sat
[2023-03-09 17:18:17] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 117 ms returned sat
[2023-03-09 17:18:36] [INFO ] After 18284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 17:18:36] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2023-03-09 17:18:41] [INFO ] After 5084ms SMT Verify possible using 31756 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-09 17:18:41] [INFO ] After 5086ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 17:18:41] [INFO ] After 25042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-09 17:18:42] [INFO ] [Nat]Absence check using 80 positive place invariants in 110 ms returned sat
[2023-03-09 17:18:43] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2023-03-09 17:19:04] [INFO ] After 20683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 17:19:06] [INFO ] After 2883ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:19:06] [INFO ] After 2887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 17:19:06] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 2 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2620 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2620 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 2401 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2023-03-09 17:19:11] [INFO ] Invariant cache hit.
[2023-03-09 17:19:17] [INFO ] Implicit Places using invariants in 5538 ms returned []
Implicit Place search using SMT only with invariants took 5540 ms to find 0 implicit places.
[2023-03-09 17:19:17] [INFO ] Invariant cache hit.
[2023-03-09 17:19:18] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8705 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 248 reset in 3160 ms.
Product exploration explored 100000 steps with 247 reset in 3056 ms.
Built C files in :
/tmp/ltsmin1410422601542604337
[2023-03-09 17:19:25] [INFO ] Too many transitions (32002) to apply POR reductions. Disabling POR matrices.
[2023-03-09 17:19:25] [INFO ] Built C files in 359ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1410422601542604337
Running compilation step : cd /tmp/ltsmin1410422601542604337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1410422601542604337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1410422601542604337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 6885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 2500 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
[2023-03-09 17:19:30] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
// Phase 1: matrix 25842 rows 6885 cols
[2023-03-09 17:19:35] [INFO ] Computed 82 place invariants in 4051 ms
[2023-03-09 17:19:36] [INFO ] Implicit Places using invariants in 5810 ms returned []
Implicit Place search using SMT only with invariants took 5810 ms to find 0 implicit places.
[2023-03-09 17:19:36] [INFO ] Flow matrix only has 25842 transitions (discarded 6160 similar events)
[2023-03-09 17:19:36] [INFO ] Invariant cache hit.
[2023-03-09 17:19:53] [INFO ] Dead Transitions using invariants and state equation in 17069 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25391 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Built C files in :
/tmp/ltsmin14266989321580979770
[2023-03-09 17:19:53] [INFO ] Too many transitions (32002) to apply POR reductions. Disabling POR matrices.
[2023-03-09 17:19:54] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14266989321580979770
Running compilation step : cd /tmp/ltsmin14266989321580979770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14266989321580979770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14266989321580979770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 17:19:58] [INFO ] Flatten gal took : 700 ms
[2023-03-09 17:19:59] [INFO ] Flatten gal took : 703 ms
[2023-03-09 17:19:59] [INFO ] Time to serialize gal into /tmp/LTL5442435490500046738.gal : 182 ms
[2023-03-09 17:19:59] [INFO ] Time to serialize properties into /tmp/LTL3548115443526492661.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5442435490500046738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10311699609602280752.hoa' '-atoms' '/tmp/LTL3548115443526492661.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3548115443526492661.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10311699609602280752.hoa
Detected timeout of ITS tools.
[2023-03-09 17:20:15] [INFO ] Flatten gal took : 488 ms
[2023-03-09 17:20:16] [INFO ] Flatten gal took : 580 ms
[2023-03-09 17:20:16] [INFO ] Time to serialize gal into /tmp/LTL7309138530281489990.gal : 104 ms
[2023-03-09 17:20:16] [INFO ] Time to serialize properties into /tmp/LTL14864986458165623282.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7309138530281489990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14864986458165623282.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node41GiveAnswer71<1)")U((G("(Node41GiveAnswer71<1)"))||("((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))"))))))
Formula 0 simplified : FG(!"(Node41GiveAnswer71<1)" M !"((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))")
Detected timeout of ITS tools.
[2023-03-09 17:20:32] [INFO ] Flatten gal took : 697 ms
[2023-03-09 17:20:32] [INFO ] Applying decomposition
[2023-03-09 17:20:33] [INFO ] Flatten gal took : 600 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4210301465360733552.txt' '-o' '/tmp/graph4210301465360733552.bin' '-w' '/tmp/graph4210301465360733552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4210301465360733552.bin' '-l' '-1' '-v' '-w' '/tmp/graph4210301465360733552.weights' '-q' '0' '-e' '0.001'
[2023-03-09 17:20:34] [INFO ] Decomposing Gal with order
[2023-03-09 17:20:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 17:20:39] [INFO ] Removed a total of 25411 redundant transitions.
[2023-03-09 17:20:40] [INFO ] Flatten gal took : 4178 ms
[2023-03-09 17:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 18801 labels/synchronizations in 5495 ms.
[2023-03-09 17:20:46] [INFO ] Time to serialize gal into /tmp/LTL14542025398719940581.gal : 150 ms
[2023-03-09 17:20:46] [INFO ] Time to serialize properties into /tmp/LTL4753417852880206907.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14542025398719940581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4753417852880206907.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(u72.Node41GiveAnswer71<1)")U((G("(u72.Node41GiveAnswer71<1)"))||("((u9.Node56GiveAnswer8<1)&&(u72.Node41GiveAnswer71<1))")))...158
Formula 0 simplified : FG(!"(u72.Node41GiveAnswer71<1)" M !"((u9.Node56GiveAnswer8<1)&&(u72.Node41GiveAnswer71<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17405068171226587707
[2023-03-09 17:21:01] [INFO ] Built C files in 283ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17405068171226587707
Running compilation step : cd /tmp/ltsmin17405068171226587707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17405068171226587707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17405068171226587707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-03 finished in 387722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 25 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 9484 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2023-03-09 17:21:14] [INFO ] Flow matrix only has 25841 transitions (discarded 6161 similar events)
// Phase 1: matrix 25841 rows 6885 cols
[2023-03-09 17:21:17] [INFO ] Computed 82 place invariants in 3574 ms
[2023-03-09 17:21:19] [INFO ] Implicit Places using invariants in 5473 ms returned []
Implicit Place search using SMT only with invariants took 5475 ms to find 0 implicit places.
[2023-03-09 17:21:19] [INFO ] Flow matrix only has 25841 transitions (discarded 6161 similar events)
[2023-03-09 17:21:19] [INFO ] Invariant cache hit.
[2023-03-09 17:21:36] [INFO ] Dead Transitions using invariants and state equation in 17235 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 32203 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-04 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:(OR (GEQ s2592 1) (AND (GEQ s299 1) (GEQ s5494 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 375 steps with 0 reset in 19 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-04 finished in 32377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 22 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13752 place count 6887 transition count 32004
Applied a total of 13752 rules in 9455 ms. Remains 6887 /13763 variables (removed 6876) and now considering 32004/38880 (removed 6876) transitions.
[2023-03-09 17:21:46] [INFO ] Flow matrix only has 25844 transitions (discarded 6160 similar events)
// Phase 1: matrix 25844 rows 6887 cols
[2023-03-09 17:21:50] [INFO ] Computed 82 place invariants in 4111 ms
[2023-03-09 17:21:51] [INFO ] Implicit Places using invariants in 4892 ms returned []
Implicit Place search using SMT only with invariants took 4893 ms to find 0 implicit places.
[2023-03-09 17:21:51] [INFO ] Flow matrix only has 25844 transitions (discarded 6160 similar events)
[2023-03-09 17:21:51] [INFO ] Invariant cache hit.
[2023-03-09 17:21:52] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6887/13763 places, 32004/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15181 ms. Remains : 6887/13763 places, 32004/38880 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6163 1), p1:(AND (GEQ s167 1) (GEQ s235 1) (GEQ s5090 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 396 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-05 finished in 15396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F((!p2 U (p3||G(!p2))))&&p1))&&p0)))'
Support contains 7 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 4107 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:22:04] [INFO ] Computed 82 place invariants in 8061 ms
[2023-03-09 17:22:05] [INFO ] Implicit Places using invariants in 9439 ms returned []
Implicit Place search using SMT only with invariants took 9442 ms to find 0 implicit places.
[2023-03-09 17:22:06] [INFO ] Invariant cache hit.
[2023-03-09 17:22:07] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14728 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (OR (NOT p1) (AND p2 (NOT p3))), (AND (NOT p3) p2)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1057 1) (GEQ s11699 1)), p1:(AND (GEQ s245 1) (GEQ s8109 1)), p3:(AND (LT s2266 1) (NOT (AND (GEQ s721 1) (GEQ s12917 1)))), p2:(AND (GEQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-06 finished in 15120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))&&(F(X(p2))||F(p0))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3932 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:22:11] [INFO ] Invariant cache hit.
[2023-03-09 17:22:12] [INFO ] Implicit Places using invariants in 1364 ms returned []
Implicit Place search using SMT only with invariants took 1368 ms to find 0 implicit places.
[2023-03-09 17:22:12] [INFO ] Invariant cache hit.
[2023-03-09 17:22:14] [INFO ] Dead Transitions using invariants and state equation in 1534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6839 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s259 1) (GEQ s5583 1)), p1:(AND (GEQ s208 1) (GEQ s777 1)), p2:(GEQ s5060 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1725 steps with 0 reset in 65 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-07 finished in 7211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 21 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Applied a total of 13756 rules in 9411 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
[2023-03-09 17:22:24] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
// Phase 1: matrix 25840 rows 6885 cols
[2023-03-09 17:22:28] [INFO ] Computed 82 place invariants in 3916 ms
[2023-03-09 17:22:29] [INFO ] Implicit Places using invariants in 5757 ms returned []
Implicit Place search using SMT only with invariants took 5757 ms to find 0 implicit places.
[2023-03-09 17:22:29] [INFO ] Flow matrix only has 25840 transitions (discarded 6162 similar events)
[2023-03-09 17:22:29] [INFO ] Invariant cache hit.
[2023-03-09 17:22:47] [INFO ] Dead Transitions using invariants and state equation in 17739 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 32913 ms. Remains : 6885/13763 places, 32002/38880 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s186 1) (LT s3795 1)), p1:(OR (LT s90 1) (LT s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 247 reset in 3004 ms.
Stack based approach found an accepted trace after 91450 steps with 226 reset with depth 382 and stack size 382 in 3257 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-08 finished in 39357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 23 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 9136 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2023-03-09 17:23:03] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
// Phase 1: matrix 25839 rows 6884 cols
[2023-03-09 17:23:07] [INFO ] Computed 82 place invariants in 3956 ms
[2023-03-09 17:23:08] [INFO ] Implicit Places using invariants in 4804 ms returned []
Implicit Place search using SMT only with invariants took 4808 ms to find 0 implicit places.
[2023-03-09 17:23:08] [INFO ] Flow matrix only has 25839 transitions (discarded 6162 similar events)
[2023-03-09 17:23:08] [INFO ] Invariant cache hit.
[2023-03-09 17:23:25] [INFO ] Dead Transitions using invariants and state equation in 17704 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 31653 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s59 1) (GEQ s5133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 393 steps with 0 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-09 finished in 31783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 4013 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:23:38] [INFO ] Computed 82 place invariants in 8751 ms
[2023-03-09 17:23:39] [INFO ] Implicit Places using invariants in 9978 ms returned []
Implicit Place search using SMT only with invariants took 9979 ms to find 0 implicit places.
[2023-03-09 17:23:39] [INFO ] Invariant cache hit.
[2023-03-09 17:23:41] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15379 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s13214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-10 finished in 15638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(X(G(p1))||G(p2))))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4056 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:23:45] [INFO ] Invariant cache hit.
[2023-03-09 17:23:46] [INFO ] Implicit Places using invariants in 1099 ms returned []
Implicit Place search using SMT only with invariants took 1100 ms to find 0 implicit places.
[2023-03-09 17:23:46] [INFO ] Invariant cache hit.
[2023-03-09 17:23:48] [INFO ] Dead Transitions using invariants and state equation in 1566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6724 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(LT s8254 1), p1:(OR (LT s637 1) (LT s5951 1)), p0:(OR (LT s147 1) (LT s6199 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 52083 steps with 26 reset in 1570 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-11 finished in 8728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3633 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:23:53] [INFO ] Invariant cache hit.
[2023-03-09 17:23:55] [INFO ] Implicit Places using invariants in 1325 ms returned []
Implicit Place search using SMT only with invariants took 1326 ms to find 0 implicit places.
[2023-03-09 17:23:55] [INFO ] Invariant cache hit.
[2023-03-09 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6340 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s6061 1), p0:(GEQ s7041 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2153 steps with 0 reset in 70 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-12 finished in 6694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))&&X(p2)))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3795 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:24:00] [INFO ] Invariant cache hit.
[2023-03-09 17:24:02] [INFO ] Implicit Places using invariants in 1325 ms returned []
Implicit Place search using SMT only with invariants took 1327 ms to find 0 implicit places.
[2023-03-09 17:24:02] [INFO ] Invariant cache hit.
[2023-03-09 17:24:03] [INFO ] Dead Transitions using invariants and state equation in 1243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6369 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2152 1), p2:(AND (GEQ s2152 1) (GEQ s12688 1)), p1:(LT s5160 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 9 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-13 finished in 6747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&G((F(p3)||p2))))))'
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 3926 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:24:07] [INFO ] Invariant cache hit.
[2023-03-09 17:24:08] [INFO ] Implicit Places using invariants in 1185 ms returned []
Implicit Place search using SMT only with invariants took 1190 ms to find 0 implicit places.
[2023-03-09 17:24:08] [INFO ] Invariant cache hit.
[2023-03-09 17:24:10] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6568 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3160 1), p1:(GEQ s13104 1), p2:(OR (LT s530 1) (LT s1029 1)), p3:(OR (LT s530 1) (LT s1029 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-15 finished in 6949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
[2023-03-09 17:24:11] [INFO ] Flatten gal took : 966 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1083943373344037304
[2023-03-09 17:24:12] [INFO ] Too many transitions (38880) to apply POR reductions. Disabling POR matrices.
[2023-03-09 17:24:12] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1083943373344037304
Running compilation step : cd /tmp/ltsmin1083943373344037304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 17:24:13] [INFO ] Applying decomposition
[2023-03-09 17:24:14] [INFO ] Flatten gal took : 1184 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17586285849818932164.txt' '-o' '/tmp/graph17586285849818932164.bin' '-w' '/tmp/graph17586285849818932164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17586285849818932164.bin' '-l' '-1' '-v' '-w' '/tmp/graph17586285849818932164.weights' '-q' '0' '-e' '0.001'
[2023-03-09 17:24:16] [INFO ] Decomposing Gal with order
[2023-03-09 17:24:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 17:24:21] [INFO ] Removed a total of 19240 redundant transitions.
[2023-03-09 17:24:21] [INFO ] Flatten gal took : 2542 ms
[2023-03-09 17:24:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 25212 labels/synchronizations in 3020 ms.
[2023-03-09 17:24:25] [INFO ] Time to serialize gal into /tmp/LTLFireability126984577696934495.gal : 179 ms
[2023-03-09 17:24:25] [INFO ] Time to serialize properties into /tmp/LTLFireability14542000545953075769.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability126984577696934495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14542000545953075769.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i70.u287.Node41GiveAnswer71<1)")U(("((i7.u34.Node56GiveAnswer8<1)&&(i70.u287.Node41GiveAnswer71<1))")||(G("(i70.u287.Node41G...177
Formula 0 simplified : FG(!"(i70.u287.Node41GiveAnswer71<1)" M !"((i7.u34.Node56GiveAnswer8<1)&&(i70.u287.Node41GiveAnswer71<1))")
ITS-tools command line returned an error code 137
[2023-03-09 17:32:34] [INFO ] Flatten gal took : 1749 ms
[2023-03-09 17:32:35] [INFO ] Time to serialize gal into /tmp/LTLFireability4146270260809440504.gal : 172 ms
[2023-03-09 17:32:35] [INFO ] Time to serialize properties into /tmp/LTLFireability5832095243497761284.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4146270260809440504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5832095243497761284.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node41GiveAnswer71<1)")U(("((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))")||(G("(Node41GiveAnswer71<1)")))))))
Formula 0 simplified : FG(!"(Node41GiveAnswer71<1)" M !"((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1083943373344037304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1083943373344037304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 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
[2023-03-09 17:53:50] [INFO ] Flatten gal took : 1217 ms
[2023-03-09 17:53:53] [INFO ] Input system was already deterministic with 38880 transitions.
[2023-03-09 17:53:53] [INFO ] Transformed 13763 places.
[2023-03-09 17:53:53] [INFO ] Transformed 38880 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 17:54:28] [INFO ] Time to serialize gal into /tmp/LTLFireability13769061533366211892.gal : 110 ms
[2023-03-09 17:54:28] [INFO ] Time to serialize properties into /tmp/LTLFireability1395839121193647861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13769061533366211892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1395839121193647861.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(Node41GiveAnswer71<1)")U(("((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))")||(G("(Node41GiveAnswer71<1)")))))))
Formula 0 simplified : FG(!"(Node41GiveAnswer71<1)" M !"((Node56GiveAnswer8<1)&&(Node41GiveAnswer71<1))")
ITS-tools command line returned an error code 137
Total runtime 3574000 ms.

BK_STOP 1678385487776

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690800764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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