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-167813690700684.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 CANConstruction-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 12M 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 CANConstruction-PT-090-LTLFireability-00
FORMULA_NAME CANConstruction-PT-090-LTLFireability-01
FORMULA_NAME CANConstruction-PT-090-LTLFireability-02
FORMULA_NAME CANConstruction-PT-090-LTLFireability-03
FORMULA_NAME CANConstruction-PT-090-LTLFireability-04
FORMULA_NAME CANConstruction-PT-090-LTLFireability-05
FORMULA_NAME CANConstruction-PT-090-LTLFireability-06
FORMULA_NAME CANConstruction-PT-090-LTLFireability-07
FORMULA_NAME CANConstruction-PT-090-LTLFireability-08
FORMULA_NAME CANConstruction-PT-090-LTLFireability-09
FORMULA_NAME CANConstruction-PT-090-LTLFireability-10
FORMULA_NAME CANConstruction-PT-090-LTLFireability-11
FORMULA_NAME CANConstruction-PT-090-LTLFireability-12
FORMULA_NAME CANConstruction-PT-090-LTLFireability-13
FORMULA_NAME CANConstruction-PT-090-LTLFireability-14
FORMULA_NAME CANConstruction-PT-090-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678372176460

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=CANConstruction-PT-090
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 14:29:39] [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 14:29:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:29:39] [INFO ] Load time of PNML (sax parser for PT used): 590 ms
[2023-03-09 14:29:39] [INFO ] Transformed 17282 places.
[2023-03-09 14:29:39] [INFO ] Transformed 33120 transitions.
[2023-03-09 14:29:40] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 864 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-090-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7902 places :
Symmetric choice reduction at 0 with 7902 rule applications. Total rules 7902 place count 9380 transition count 17316
Iterating global reduction 0 with 7902 rules applied. Total rules applied 15804 place count 9380 transition count 17316
Applied a total of 15804 rules in 6827 ms. Remains 9380 /17282 variables (removed 7902) and now considering 17316/33120 (removed 15804) transitions.
// Phase 1: matrix 17316 rows 9380 cols
[2023-03-09 14:29:47] [INFO ] Computed 181 place invariants in 293 ms
[2023-03-09 14:29:48] [INFO ] Implicit Places using invariants in 1204 ms returned []
Implicit Place search using SMT only with invariants took 1230 ms to find 0 implicit places.
[2023-03-09 14:29:48] [INFO ] Invariant cache hit.
[2023-03-09 14:29:49] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9380/17282 places, 17316/33120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8881 ms. Remains : 9380/17282 places, 17316/33120 transitions.
Support contains 45 out of 9380 places after structural reductions.
[2023-03-09 14:29:50] [INFO ] Flatten gal took : 750 ms
[2023-03-09 14:29:51] [INFO ] Flatten gal took : 649 ms
[2023-03-09 14:29:52] [INFO ] Input system was already deterministic with 17316 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 920 ms. (steps per millisecond=10 ) properties (out of 30) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-09 14:29:53] [INFO ] Invariant cache hit.
[2023-03-09 14:29:57] [INFO ] [Real]Absence check using 91 positive place invariants in 255 ms returned sat
[2023-03-09 14:29:57] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 138 ms returned sat
[2023-03-09 14:29:57] [INFO ] After 4399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-09 14:30:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 294 ms returned sat
[2023-03-09 14:30:01] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 185 ms returned sat
[2023-03-09 14:30:22] [INFO ] After 18153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-09 14:30:23] [INFO ] State equation strengthened by 16110 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:350)
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 14:30:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:30:23] [INFO ] After 25345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 594 ms.
Support contains 25 out of 9380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 9380 transition count 16692
Reduce places removed 624 places and 0 transitions.
Iterating post reduction 1 with 624 rules applied. Total rules applied 1248 place count 8756 transition count 16692
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1253 place count 8751 transition count 16682
Iterating global reduction 2 with 5 rules applied. Total rules applied 1258 place count 8751 transition count 16682
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 7 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1438 place count 8661 transition count 16592
Free-agglomeration rule applied 156 times.
Iterating global reduction 2 with 156 rules applied. Total rules applied 1594 place count 8661 transition count 16436
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 1750 place count 8505 transition count 16436
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1756 place count 8505 transition count 16430
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1762 place count 8499 transition count 16430
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1786 place count 8499 transition count 16430
Applied a total of 1786 rules in 17741 ms. Remains 8499 /9380 variables (removed 881) and now considering 16430/17316 (removed 886) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17744 ms. Remains : 8499/9380 places, 16430/17316 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 1075 ms. (steps per millisecond=9 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) 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 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 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 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
// Phase 1: matrix 16430 rows 8499 cols
[2023-03-09 14:30:43] [INFO ] Computed 181 place invariants in 182 ms
[2023-03-09 14:30:46] [INFO ] [Real]Absence check using 91 positive place invariants in 466 ms returned sat
[2023-03-09 14:30:46] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 160 ms returned sat
[2023-03-09 14:30:57] [INFO ] After 10389ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-09 14:30:57] [INFO ] State equation strengthened by 16212 read => feed constraints.
[2023-03-09 14:30:59] [INFO ] After 1954ms SMT Verify possible using 16212 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 14:30:59] [INFO ] After 16236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 14:31:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 197 ms returned sat
[2023-03-09 14:31:01] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 99 ms returned sat
[2023-03-09 14:31:19] [INFO ] After 16440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 14:31:24] [INFO ] After 5012ms SMT Verify possible using 16212 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 14:31:24] [INFO ] After 5012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 14:31:24] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 3 properties in 212 ms.
Support contains 8 out of 8499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8499/8499 places, 16430/16430 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8498 transition count 16428
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8498 transition count 16428
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 8493 transition count 16423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 8492 transition count 16423
Applied a total of 14 rules in 9379 ms. Remains 8492 /8499 variables (removed 7) and now considering 16423/16430 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9381 ms. Remains : 8492/8499 places, 16423/16430 transitions.
Computed a total of 361 stabilizing places and 450 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' '!(F(G(p0)))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9380 transition count 16688
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8752 transition count 16688
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1274 place count 8734 transition count 16652
Iterating global reduction 2 with 18 rules applied. Total rules applied 1292 place count 8734 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1472 place count 8644 transition count 16562
Applied a total of 1472 rules in 8350 ms. Remains 8644 /9380 variables (removed 736) and now considering 16562/17316 (removed 754) transitions.
// Phase 1: matrix 16562 rows 8644 cols
[2023-03-09 14:31:43] [INFO ] Computed 181 place invariants in 222 ms
[2023-03-09 14:31:44] [INFO ] Implicit Places using invariants in 1096 ms returned []
Implicit Place search using SMT only with invariants took 1116 ms to find 0 implicit places.
[2023-03-09 14:31:44] [INFO ] Invariant cache hit.
[2023-03-09 14:31:45] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9380 places, 16562/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10591 ms. Remains : 8644/9380 places, 16562/17316 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-00 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 s455 1) (GEQ s8096 1) (OR (LT s388 1) (LT s1498 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 858 steps with 0 reset in 56 ms.
FORMULA CANConstruction-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-00 finished in 11009 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&&F((G(F(!p1))||(!p2&&F(!p1)))))))'
Support contains 5 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 9365 transition count 17286
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 9365 transition count 17286
Applied a total of 30 rules in 5436 ms. Remains 9365 /9380 variables (removed 15) and now considering 17286/17316 (removed 30) transitions.
// Phase 1: matrix 17286 rows 9365 cols
[2023-03-09 14:31:51] [INFO ] Computed 181 place invariants in 421 ms
[2023-03-09 14:31:52] [INFO ] Implicit Places using invariants in 1493 ms returned []
Implicit Place search using SMT only with invariants took 1515 ms to find 0 implicit places.
[2023-03-09 14:31:52] [INFO ] Invariant cache hit.
[2023-03-09 14:31:54] [INFO ] Dead Transitions using invariants and state equation in 1926 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9365/9380 places, 17286/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8889 ms. Remains : 9365/9380 places, 17286/17316 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3058 1), p2:(AND (GEQ s5933 1) (NOT (AND (GEQ s230 1) (GEQ s5999 1)))), p1:(AND (GEQ s4191 1) (GEQ s5933 1) (GEQ s230 1) (GEQ s5999 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 4 ms.
FORMULA CANConstruction-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-02 finished in 9366 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)||(p1&&F(p2))) U p2)||F(p3)||G(p1)))'
Support contains 5 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9380 transition count 16688
Reduce places removed 628 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 629 rules applied. Total rules applied 1257 place count 8752 transition count 16687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1258 place count 8751 transition count 16687
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 8751 transition count 16686
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 8750 transition count 16686
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1275 place count 8735 transition count 16656
Iterating global reduction 3 with 15 rules applied. Total rules applied 1290 place count 8735 transition count 16656
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 7 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1468 place count 8646 transition count 16567
Applied a total of 1468 rules in 7912 ms. Remains 8646 /9380 variables (removed 734) and now considering 16567/17316 (removed 749) transitions.
// Phase 1: matrix 16567 rows 8646 cols
[2023-03-09 14:32:03] [INFO ] Computed 181 place invariants in 150 ms
[2023-03-09 14:32:04] [INFO ] Implicit Places using invariants in 1264 ms returned []
Implicit Place search using SMT only with invariants took 1284 ms to find 0 implicit places.
[2023-03-09 14:32:04] [INFO ] Invariant cache hit.
[2023-03-09 14:32:05] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/9380 places, 16567/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10125 ms. Remains : 8646/9380 places, 16567/17316 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s468 1) (GEQ s469 1)), p1:(GEQ s2341 1), p3:(GEQ s4695 1), p0:(GEQ s3463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 784 steps with 0 reset in 38 ms.
FORMULA CANConstruction-PT-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-03 finished in 10457 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(F(p0)))'
Support contains 1 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 9363 transition count 17282
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 9363 transition count 17282
Applied a total of 34 rules in 5769 ms. Remains 9363 /9380 variables (removed 17) and now considering 17282/17316 (removed 34) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-09 14:32:11] [INFO ] Computed 181 place invariants in 214 ms
[2023-03-09 14:32:12] [INFO ] Implicit Places using invariants in 1339 ms returned []
Implicit Place search using SMT only with invariants took 1341 ms to find 0 implicit places.
[2023-03-09 14:32:12] [INFO ] Invariant cache hit.
[2023-03-09 14:32:14] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9380 places, 17282/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8244 ms. Remains : 9363/9380 places, 17282/17316 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1600 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1462 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-05 finished in 8466 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||G(p1)))))'
Support contains 3 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9380 transition count 16688
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8752 transition count 16688
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8752 transition count 16687
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8751 transition count 16687
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1275 place count 8734 transition count 16653
Iterating global reduction 2 with 17 rules applied. Total rules applied 1292 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1470 place count 8645 transition count 16564
Applied a total of 1470 rules in 7867 ms. Remains 8645 /9380 variables (removed 735) and now considering 16564/17316 (removed 752) transitions.
// Phase 1: matrix 16564 rows 8645 cols
[2023-03-09 14:32:22] [INFO ] Computed 181 place invariants in 124 ms
[2023-03-09 14:32:23] [INFO ] Implicit Places using invariants in 1136 ms returned []
Implicit Place search using SMT only with invariants took 1138 ms to find 0 implicit places.
[2023-03-09 14:32:23] [INFO ] Invariant cache hit.
[2023-03-09 14:32:24] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9380 places, 16564/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10031 ms. Remains : 8645/9380 places, 16564/17316 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3548 1), p0:(AND (GEQ s82 1) (GEQ s492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 712 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-06 finished in 10234 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((p1&&G(p2)))&&p0))&&F((!p3 U (p4||G(!p3))))))'
Support contains 6 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9364 transition count 17284
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9364 transition count 17284
Applied a total of 32 rules in 5330 ms. Remains 9364 /9380 variables (removed 16) and now considering 17284/17316 (removed 32) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-09 14:32:29] [INFO ] Computed 181 place invariants in 132 ms
[2023-03-09 14:32:30] [INFO ] Implicit Places using invariants in 1134 ms returned []
Implicit Place search using SMT only with invariants took 1136 ms to find 0 implicit places.
[2023-03-09 14:32:30] [INFO ] Invariant cache hit.
[2023-03-09 14:32:32] [INFO ] Dead Transitions using invariants and state equation in 1094 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9380 places, 17284/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7565 ms. Remains : 9364/9380 places, 17284/17316 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (AND p3 (NOT p4))), (OR (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p4) p3), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p4:(AND (LT s2571 1) (NOT (AND (GEQ s81 1) (GEQ s902 1)))), p0:(AND (GEQ s81 1) (GEQ s902 1)), p3:(AND (GEQ s81 1) (GEQ s902 1)), p1:(OR (LT s1210 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-090-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-07 finished in 8052 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(F(p0)) U p1)))'
Support contains 5 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 9363 transition count 17282
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 9363 transition count 17282
Applied a total of 34 rules in 5365 ms. Remains 9363 /9380 variables (removed 17) and now considering 17282/17316 (removed 34) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-09 14:32:38] [INFO ] Computed 181 place invariants in 190 ms
[2023-03-09 14:32:39] [INFO ] Implicit Places using invariants in 1940 ms returned []
Implicit Place search using SMT only with invariants took 1942 ms to find 0 implicit places.
[2023-03-09 14:32:39] [INFO ] Invariant cache hit.
[2023-03-09 14:32:41] [INFO ] Dead Transitions using invariants and state equation in 1649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9380 places, 17282/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8968 ms. Remains : 9363/9380 places, 17282/17316 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s6942 1) (AND (GEQ s174 1) (GEQ s1117 1))), p0:(AND (GEQ s538 1) (GEQ s655 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 1633 steps with 0 reset in 50 ms.
FORMULA CANConstruction-PT-090-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-08 finished in 9329 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((X(!(p0 U p1))&&!p0))))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 9362 transition count 17280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 9362 transition count 17280
Applied a total of 36 rules in 5287 ms. Remains 9362 /9380 variables (removed 18) and now considering 17280/17316 (removed 36) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2023-03-09 14:32:47] [INFO ] Computed 181 place invariants in 94 ms
[2023-03-09 14:32:48] [INFO ] Implicit Places using invariants in 1693 ms returned []
Implicit Place search using SMT only with invariants took 1702 ms to find 0 implicit places.
[2023-03-09 14:32:48] [INFO ] Invariant cache hit.
[2023-03-09 14:32:49] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9362/9380 places, 17280/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8016 ms. Remains : 9362/9380 places, 17280/17316 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (OR p1 p0), p1, (OR p1 p0), (OR p1 p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s76 1) (GEQ s4472 1)), p1:(AND (GEQ s711 1) (GEQ s1042 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3947 ms.
Product exploration explored 100000 steps with 25000 reset in 3803 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, p1, p1, p1, p1]
Finished random walk after 8770 steps, including 5 resets, run visited all 2 properties in 249 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 268 ms :[true, p1, p1, p1, p1]
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Applied a total of 0 rules in 2684 ms. Remains 9362 /9362 variables (removed 0) and now considering 17280/17280 (removed 0) transitions.
[2023-03-09 14:33:02] [INFO ] Invariant cache hit.
[2023-03-09 14:33:03] [INFO ] Implicit Places using invariants in 1563 ms returned []
Implicit Place search using SMT only with invariants took 1577 ms to find 0 implicit places.
[2023-03-09 14:33:03] [INFO ] Invariant cache hit.
[2023-03-09 14:33:04] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5355 ms. Remains : 9362/9362 places, 17280/17280 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:33:05] [INFO ] Invariant cache hit.
[2023-03-09 14:33:07] [INFO ] [Real]Absence check using 91 positive place invariants in 266 ms returned sat
[2023-03-09 14:33:07] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 134 ms returned sat
[2023-03-09 14:33:18] [INFO ] After 12878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:33:20] [INFO ] [Nat]Absence check using 91 positive place invariants in 233 ms returned sat
[2023-03-09 14:33:20] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 104 ms returned sat
[2023-03-09 14:33:35] [INFO ] After 14755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:33:35] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-09 14:33:38] [INFO ] After 3232ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:33:40] [INFO ] After 4825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 886 ms.
[2023-03-09 14:33:41] [INFO ] After 22490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 9362 transition count 16653
Reduce places removed 627 places and 0 transitions.
Iterating post reduction 1 with 627 rules applied. Total rules applied 1254 place count 8735 transition count 16653
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1254 place count 8735 transition count 16652
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1256 place count 8734 transition count 16652
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1434 place count 8645 transition count 16563
Free-agglomeration rule applied 180 times.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1614 place count 8645 transition count 16383
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 1794 place count 8465 transition count 16383
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1796 place count 8465 transition count 16381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1798 place count 8463 transition count 16381
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1799 place count 8463 transition count 16381
Applied a total of 1799 rules in 12701 ms. Remains 8463 /9362 variables (removed 899) and now considering 16381/17280 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12702 ms. Remains : 8463/9362 places, 16381/17280 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Finished Best-First random walk after 4233 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=384 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 248 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 266 ms :[true, p1, p1, p1, p1]
Product exploration explored 100000 steps with 25000 reset in 4255 ms.
Product exploration explored 100000 steps with 25000 reset in 4334 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 249 ms :[true, p1, p1, p1, p1]
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 9362 transition count 17280
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 447 place count 9362 transition count 17280
Deduced a syphon composed of 540 places in 7 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 540 place count 9362 transition count 17280
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9182 transition count 17100
Deduced a syphon composed of 360 places in 6 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9182 transition count 17100
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 537 places in 5 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 1077 place count 9182 transition count 17100
Discarding 354 places :
Symmetric choice reduction at 1 with 354 rule applications. Total rules 1431 place count 8828 transition count 16746
Deduced a syphon composed of 183 places in 3 ms
Iterating global reduction 1 with 354 rules applied. Total rules applied 1785 place count 8828 transition count 16746
Deduced a syphon composed of 183 places in 4 ms
Applied a total of 1785 rules in 13553 ms. Remains 8828 /9362 variables (removed 534) and now considering 16746/17280 (removed 534) transitions.
// Phase 1: matrix 16746 rows 8828 cols
[2023-03-09 14:34:18] [INFO ] Computed 181 place invariants in 178 ms
[2023-03-09 14:34:19] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8828/9362 places, 16746/17280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14725 ms. Remains : 8828/9362 places, 16746/17280 transitions.
Built C files in :
/tmp/ltsmin2380148572135420922
[2023-03-09 14:34:19] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2380148572135420922
Running compilation step : cd /tmp/ltsmin2380148572135420922;'/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/ltsmin2380148572135420922;'/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/ltsmin2380148572135420922;'/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 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Applied a total of 0 rules in 3429 ms. Remains 9362 /9362 variables (removed 0) and now considering 17280/17280 (removed 0) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2023-03-09 14:34:26] [INFO ] Computed 181 place invariants in 141 ms
[2023-03-09 14:34:27] [INFO ] Implicit Places using invariants in 1573 ms returned []
Implicit Place search using SMT only with invariants took 1581 ms to find 0 implicit places.
[2023-03-09 14:34:27] [INFO ] Invariant cache hit.
[2023-03-09 14:34:29] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6649 ms. Remains : 9362/9362 places, 17280/17280 transitions.
Built C files in :
/tmp/ltsmin2789094054417876845
[2023-03-09 14:34:29] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2789094054417876845
Running compilation step : cd /tmp/ltsmin2789094054417876845;'/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/ltsmin2789094054417876845;'/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/ltsmin2789094054417876845;'/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 14:34:33] [INFO ] Flatten gal took : 548 ms
[2023-03-09 14:34:34] [INFO ] Flatten gal took : 573 ms
[2023-03-09 14:34:34] [INFO ] Time to serialize gal into /tmp/LTL15372161976363074776.gal : 218 ms
[2023-03-09 14:34:34] [INFO ] Time to serialize properties into /tmp/LTL14419075774463800363.prop : 3 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/LTL15372161976363074776.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8957559281163006466.hoa' '-atoms' '/tmp/LTL14419075774463800363.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...319
Loading property file /tmp/LTL14419075774463800363.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8957559281163006466.hoa
Detected timeout of ITS tools.
[2023-03-09 14:34:50] [INFO ] Flatten gal took : 541 ms
[2023-03-09 14:34:50] [INFO ] Flatten gal took : 486 ms
[2023-03-09 14:34:51] [INFO ] Time to serialize gal into /tmp/LTL15616117976621012916.gal : 84 ms
[2023-03-09 14:34:51] [INFO ] Time to serialize properties into /tmp/LTL18234905688437963598.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15616117976621012916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18234905688437963598.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X(!(("((Node5IsInserted>=1)&&(Node35requestsent5>=1))")U("((Node50Request>=1)&&(Node74IsInserted>=1))"))))&&("((Node5IsInserte...190
Formula 0 simplified : XX(!"((Node5IsInserted<1)||(Node35requestsent5<1))" | X("((Node5IsInserted>=1)&&(Node35requestsent5>=1))" U "((Node50Request>=1)&&(N...178
Detected timeout of ITS tools.
[2023-03-09 14:35:06] [INFO ] Flatten gal took : 838 ms
[2023-03-09 14:35:06] [INFO ] Applying decomposition
[2023-03-09 14:35:07] [INFO ] Flatten gal took : 641 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/graph15971130103768918749.txt' '-o' '/tmp/graph15971130103768918749.bin' '-w' '/tmp/graph15971130103768918749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15971130103768918749.bin' '-l' '-1' '-v' '-w' '/tmp/graph15971130103768918749.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:35:09] [INFO ] Decomposing Gal with order
[2023-03-09 14:35:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:35:13] [INFO ] Removed a total of 16341 redundant transitions.
[2023-03-09 14:35:14] [INFO ] Flatten gal took : 2825 ms
[2023-03-09 14:35:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 31946 labels/synchronizations in 2760 ms.
[2023-03-09 14:35:17] [INFO ] Time to serialize gal into /tmp/LTL6912583972436539590.gal : 133 ms
[2023-03-09 14:35:17] [INFO ] Time to serialize properties into /tmp/LTL18148191102483882333.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/LTL6912583972436539590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18148191102483882333.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 : !((X(X((X(!(("((i15.u20.Node5IsInserted>=1)&&(i35.u143.Node35requestsent5>=1))")U("((i50.u203.Node50Request>=1)&&(i75.u295.Node74IsIns...242
Formula 0 simplified : XX(!"((i15.u20.Node5IsInserted<1)||(i35.u143.Node35requestsent5<1))" | X("((i15.u20.Node5IsInserted>=1)&&(i35.u143.Node35requestsent...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5791162151539415698
[2023-03-09 14:35:33] [INFO ] Built C files in 387ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5791162151539415698
Running compilation step : cd /tmp/ltsmin5791162151539415698;'/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/ltsmin5791162151539415698;'/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/ltsmin5791162151539415698;'/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 CANConstruction-PT-090-LTLFireability-09 finished in 174252 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))'
Support contains 1 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9380 transition count 16686
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8750 transition count 16686
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1277 place count 8733 transition count 16652
Iterating global reduction 2 with 17 rules applied. Total rules applied 1294 place count 8733 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 7 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1474 place count 8643 transition count 16562
Applied a total of 1474 rules in 10279 ms. Remains 8643 /9380 variables (removed 737) and now considering 16562/17316 (removed 754) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2023-03-09 14:35:46] [INFO ] Computed 181 place invariants in 165 ms
[2023-03-09 14:35:56] [INFO ] Implicit Places using invariants in 10115 ms returned []
Implicit Place search using SMT only with invariants took 10117 ms to find 0 implicit places.
[2023-03-09 14:35:56] [INFO ] Invariant cache hit.
[2023-03-09 14:35:57] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9380 places, 16562/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21405 ms. Remains : 8643/9380 places, 16562/17316 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s8218 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 702 steps with 0 reset in 34 ms.
FORMULA CANConstruction-PT-090-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-10 finished in 21585 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||G(p1)))))'
Support contains 2 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9380 transition count 16686
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8750 transition count 16686
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1276 place count 8734 transition count 16654
Iterating global reduction 2 with 16 rules applied. Total rules applied 1292 place count 8734 transition count 16654
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 7 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1472 place count 8644 transition count 16564
Applied a total of 1472 rules in 10243 ms. Remains 8644 /9380 variables (removed 736) and now considering 16564/17316 (removed 752) transitions.
// Phase 1: matrix 16564 rows 8644 cols
[2023-03-09 14:36:08] [INFO ] Computed 181 place invariants in 196 ms
[2023-03-09 14:36:15] [INFO ] Implicit Places using invariants in 7122 ms returned []
Implicit Place search using SMT only with invariants took 7125 ms to find 0 implicit places.
[2023-03-09 14:36:15] [INFO ] Invariant cache hit.
[2023-03-09 14:36:15] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9380 places, 16564/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18258 ms. Remains : 8644/9380 places, 16564/17316 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3181 1), p0:(GEQ s6733 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 846 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-11 finished in 18518 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((G(p0) U X((p1 U !p2))))))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9364 transition count 17284
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9364 transition count 17284
Applied a total of 32 rules in 6957 ms. Remains 9364 /9380 variables (removed 16) and now considering 17284/17316 (removed 32) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-09 14:36:23] [INFO ] Computed 181 place invariants in 195 ms
[2023-03-09 14:36:25] [INFO ] Implicit Places using invariants in 1897 ms returned []
Implicit Place search using SMT only with invariants took 1906 ms to find 0 implicit places.
[2023-03-09 14:36:25] [INFO ] Invariant cache hit.
[2023-03-09 14:36:26] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9380 places, 17284/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9925 ms. Remains : 9364/9380 places, 17284/17316 transitions.
Stuttering acceptance computed with spot in 470 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s8337 1), p2:(AND (GEQ s916 1) (GEQ s4976 1)), p1:(GEQ s5477 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3974 ms.
Product exploration explored 100000 steps with 25000 reset in 3784 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 994 ms. (steps per millisecond=10 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 102603 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102603 steps, saw 100992 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-09 14:36:39] [INFO ] Invariant cache hit.
[2023-03-09 14:36:41] [INFO ] [Real]Absence check using 91 positive place invariants in 339 ms returned sat
[2023-03-09 14:36:41] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 164 ms returned sat
[2023-03-09 14:36:55] [INFO ] After 12720ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-09 14:36:55] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-09 14:36:59] [INFO ] After 4089ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:36:59] [INFO ] After 19998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:37:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 328 ms returned sat
[2023-03-09 14:37:02] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 168 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 14:37:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:37:24] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9364 transition count 16655
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8735 transition count 16655
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1438 place count 8645 transition count 16565
Free-agglomeration rule applied 176 times.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1614 place count 8645 transition count 16389
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 1790 place count 8469 transition count 16389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1791 place count 8469 transition count 16388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1792 place count 8468 transition count 16388
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1796 place count 8468 transition count 16388
Applied a total of 1796 rules in 16240 ms. Remains 8468 /9364 variables (removed 896) and now considering 16388/17284 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16240 ms. Remains : 8468/9364 places, 16388/17284 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16388 rows 8468 cols
[2023-03-09 14:37:41] [INFO ] Computed 181 place invariants in 141 ms
[2023-03-09 14:37:42] [INFO ] [Real]Absence check using 91 positive place invariants in 258 ms returned sat
[2023-03-09 14:37:43] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 126 ms returned sat
[2023-03-09 14:37:57] [INFO ] After 14223ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-09 14:37:57] [INFO ] State equation strengthened by 16202 read => feed constraints.
[2023-03-09 14:38:00] [INFO ] After 2886ms SMT Verify possible using 16202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 14:38:00] [INFO ] After 19261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 14:38:02] [INFO ] [Nat]Absence check using 91 positive place invariants in 253 ms returned sat
[2023-03-09 14:38:02] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 123 ms returned sat
[2023-03-09 14:38:17] [INFO ] After 15137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 14:38:22] [INFO ] After 4745ms SMT Verify possible using 16202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 14:38:25] [INFO ] After 7978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:38:25] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 p0)), (F (NOT p0)), (F (AND (NOT p1) p2 p0)), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 566 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 556 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Stuttering acceptance computed with spot in 450 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Applied a total of 0 rules in 3709 ms. Remains 9364 /9364 variables (removed 0) and now considering 17284/17284 (removed 0) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-09 14:38:31] [INFO ] Computed 181 place invariants in 181 ms
[2023-03-09 14:38:32] [INFO ] Implicit Places using invariants in 1426 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-09 14:38:32] [INFO ] Invariant cache hit.
[2023-03-09 14:38:33] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6088 ms. Remains : 9364/9364 places, 17284/17284 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 281 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 607 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1026 ms. (steps per millisecond=9 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 77647 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77647 steps, saw 76504 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-09 14:38:38] [INFO ] Invariant cache hit.
[2023-03-09 14:38:41] [INFO ] [Real]Absence check using 91 positive place invariants in 313 ms returned sat
[2023-03-09 14:38:41] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 144 ms returned sat
[2023-03-09 14:38:59] [INFO ] After 17352ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-09 14:38:59] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-09 14:39:02] [INFO ] After 3586ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:39:03] [INFO ] After 24114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:39:05] [INFO ] [Nat]Absence check using 91 positive place invariants in 343 ms returned sat
[2023-03-09 14:39:05] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 170 ms returned sat
[2023-03-09 14:39:26] [INFO ] After 19382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 14:39:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:39:28] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 381 ms.
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9364 transition count 16655
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8735 transition count 16655
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1438 place count 8645 transition count 16565
Free-agglomeration rule applied 176 times.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1614 place count 8645 transition count 16389
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 1790 place count 8469 transition count 16389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1791 place count 8469 transition count 16388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1792 place count 8468 transition count 16388
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1796 place count 8468 transition count 16388
Applied a total of 1796 rules in 16049 ms. Remains 8468 /9364 variables (removed 896) and now considering 16388/17284 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16062 ms. Remains : 8468/9364 places, 16388/17284 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 94254 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94254 steps, saw 89719 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16388 rows 8468 cols
[2023-03-09 14:39:48] [INFO ] Computed 181 place invariants in 136 ms
[2023-03-09 14:39:49] [INFO ] [Real]Absence check using 91 positive place invariants in 201 ms returned sat
[2023-03-09 14:39:49] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 215 ms returned sat
[2023-03-09 14:40:03] [INFO ] After 13474ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-09 14:40:03] [INFO ] State equation strengthened by 16202 read => feed constraints.
[2023-03-09 14:40:06] [INFO ] After 3252ms SMT Verify possible using 16202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 14:40:06] [INFO ] After 18848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 14:40:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 209 ms returned sat
[2023-03-09 14:40:08] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 119 ms returned sat
[2023-03-09 14:40:19] [INFO ] After 10626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 14:40:24] [INFO ] After 4440ms SMT Verify possible using 16202 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 14:40:28] [INFO ] After 8299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2671 ms.
[2023-03-09 14:40:30] [INFO ] After 23889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), true]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 p0)), (F (NOT p0)), (F (AND (NOT p1) p2 p0)), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 549 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Stuttering acceptance computed with spot in 426 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Stuttering acceptance computed with spot in 486 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 3851 ms.
Product exploration explored 100000 steps with 25000 reset in 3606 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 439 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 9364 transition count 17284
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 91 Pre rules applied. Total rules applied 449 place count 9364 transition count 17284
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 540 place count 9364 transition count 17284
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9184 transition count 17104
Deduced a syphon composed of 360 places in 5 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9184 transition count 17104
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 539 places in 4 ms
Iterating global reduction 1 with 179 rules applied. Total rules applied 1079 place count 9184 transition count 17104
Discarding 358 places :
Symmetric choice reduction at 1 with 358 rule applications. Total rules 1437 place count 8826 transition count 16746
Deduced a syphon composed of 181 places in 3 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 1795 place count 8826 transition count 16746
Deduced a syphon composed of 181 places in 3 ms
Applied a total of 1795 rules in 13809 ms. Remains 8826 /9364 variables (removed 538) and now considering 16746/17284 (removed 538) transitions.
// Phase 1: matrix 16746 rows 8826 cols
[2023-03-09 14:40:54] [INFO ] Computed 181 place invariants in 93 ms
[2023-03-09 14:40:56] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8826/9364 places, 16746/17284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15333 ms. Remains : 8826/9364 places, 16746/17284 transitions.
Built C files in :
/tmp/ltsmin16261464319720713264
[2023-03-09 14:40:56] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16261464319720713264
Running compilation step : cd /tmp/ltsmin16261464319720713264;'/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/ltsmin16261464319720713264;'/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/ltsmin16261464319720713264;'/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 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Applied a total of 0 rules in 3922 ms. Remains 9364 /9364 variables (removed 0) and now considering 17284/17284 (removed 0) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-09 14:41:03] [INFO ] Computed 181 place invariants in 95 ms
[2023-03-09 14:41:04] [INFO ] Implicit Places using invariants in 1158 ms returned []
Implicit Place search using SMT only with invariants took 1177 ms to find 0 implicit places.
[2023-03-09 14:41:04] [INFO ] Invariant cache hit.
[2023-03-09 14:41:06] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6825 ms. Remains : 9364/9364 places, 17284/17284 transitions.
Built C files in :
/tmp/ltsmin14802368010179253514
[2023-03-09 14:41:06] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14802368010179253514
Running compilation step : cd /tmp/ltsmin14802368010179253514;'/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/ltsmin14802368010179253514;'/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/ltsmin14802368010179253514;'/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 14:41:10] [INFO ] Flatten gal took : 504 ms
[2023-03-09 14:41:10] [INFO ] Flatten gal took : 452 ms
[2023-03-09 14:41:10] [INFO ] Time to serialize gal into /tmp/LTL8438926569880653511.gal : 87 ms
[2023-03-09 14:41:10] [INFO ] Time to serialize properties into /tmp/LTL2901303126512658929.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/LTL8438926569880653511.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13904195252229268043.hoa' '-atoms' '/tmp/LTL2901303126512658929.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/LTL2901303126512658929.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13904195252229268043.hoa
Detected timeout of ITS tools.
[2023-03-09 14:41:26] [INFO ] Flatten gal took : 364 ms
[2023-03-09 14:41:26] [INFO ] Flatten gal took : 376 ms
[2023-03-09 14:41:27] [INFO ] Time to serialize gal into /tmp/LTL4293121077878999600.gal : 58 ms
[2023-03-09 14:41:27] [INFO ] Time to serialize properties into /tmp/LTL8123121636686674422.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4293121077878999600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8123121636686674422.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(Node78GiveAnswer41<1)"))U(X(("(Node46GiveAnswer30>=1)")U(!("((Node65IsInserted>=1)&&(Node40requestsent65>=1))"))))))))
Formula 0 simplified : XX(F!"(Node78GiveAnswer41<1)" R X(!"(Node46GiveAnswer30>=1)" R "((Node65IsInserted>=1)&&(Node40requestsent65>=1))"))
Detected timeout of ITS tools.
[2023-03-09 14:41:42] [INFO ] Flatten gal took : 357 ms
[2023-03-09 14:41:42] [INFO ] Applying decomposition
[2023-03-09 14:41:42] [INFO ] Flatten gal took : 488 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/graph2739334132921268109.txt' '-o' '/tmp/graph2739334132921268109.bin' '-w' '/tmp/graph2739334132921268109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2739334132921268109.bin' '-l' '-1' '-v' '-w' '/tmp/graph2739334132921268109.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:41:44] [INFO ] Decomposing Gal with order
[2023-03-09 14:41:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:41:47] [INFO ] Removed a total of 16337 redundant transitions.
[2023-03-09 14:41:47] [INFO ] Flatten gal took : 2296 ms
[2023-03-09 14:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 32480 labels/synchronizations in 2926 ms.
[2023-03-09 14:41:50] [INFO ] Time to serialize gal into /tmp/LTL1999150008534479278.gal : 146 ms
[2023-03-09 14:41:50] [INFO ] Time to serialize properties into /tmp/LTL17574697338881564738.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1999150008534479278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17574697338881564738.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 : !((X(X((G("(i44.u167.Node78GiveAnswer41<1)"))U(X(("(i32.u360.Node46GiveAnswer30>=1)")U(!("((i67.u260.Node65IsInserted>=1)&&(i42.u162.N...187
Formula 0 simplified : XX(F!"(i44.u167.Node78GiveAnswer41<1)" R X(!"(i32.u360.Node46GiveAnswer30>=1)" R "((i67.u260.Node65IsInserted>=1)&&(i42.u162.Node40r...175
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11737060642058675845
[2023-03-09 14:42:06] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11737060642058675845
Running compilation step : cd /tmp/ltsmin11737060642058675845;'/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/ltsmin11737060642058675845;'/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/ltsmin11737060642058675845;'/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 CANConstruction-PT-090-LTLFireability-12 finished in 352877 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)||F(G(p1)))))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 9362 transition count 17280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 9362 transition count 17280
Applied a total of 36 rules in 6960 ms. Remains 9362 /9380 variables (removed 18) and now considering 17280/17316 (removed 36) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2023-03-09 14:42:16] [INFO ] Computed 181 place invariants in 151 ms
[2023-03-09 14:42:17] [INFO ] Implicit Places using invariants in 1288 ms returned []
Implicit Place search using SMT only with invariants took 1302 ms to find 0 implicit places.
[2023-03-09 14:42:17] [INFO ] Invariant cache hit.
[2023-03-09 14:42:18] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9362/9380 places, 17280/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9260 ms. Remains : 9362/9380 places, 17280/17316 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s454 1) (LT s1019 1)), p1:(AND (GEQ s748 1) (GEQ s7902 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1480 steps with 0 reset in 43 ms.
FORMULA CANConstruction-PT-090-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-14 finished in 9613 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||G(F(p1)))))'
Support contains 2 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9364 transition count 17284
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9364 transition count 17284
Applied a total of 32 rules in 7126 ms. Remains 9364 /9380 variables (removed 16) and now considering 17284/17316 (removed 32) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-09 14:42:26] [INFO ] Computed 181 place invariants in 189 ms
[2023-03-09 14:42:27] [INFO ] Implicit Places using invariants in 1264 ms returned []
Implicit Place search using SMT only with invariants took 1281 ms to find 0 implicit places.
[2023-03-09 14:42:27] [INFO ] Invariant cache hit.
[2023-03-09 14:42:28] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9380 places, 17284/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9386 ms. Remains : 9364/9380 places, 17284/17316 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-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=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s3484 1), p1:(OR (GEQ s3833 1) (GEQ s3484 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 1615 steps with 0 reset in 38 ms.
FORMULA CANConstruction-PT-090-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-15 finished in 9799 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((X(!(p0 U p1))&&!p0))))'
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((G(p0) U X((p1 U !p2))))))'
[2023-03-09 14:42:29] [INFO ] Flatten gal took : 540 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13267011114404875837
[2023-03-09 14:42:29] [INFO ] Too many transitions (17316) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:42:29] [INFO ] Built C files in 309ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13267011114404875837
Running compilation step : cd /tmp/ltsmin13267011114404875837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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 14:42:30] [INFO ] Applying decomposition
[2023-03-09 14:42:30] [INFO ] Flatten gal took : 548 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/graph10291830563777636286.txt' '-o' '/tmp/graph10291830563777636286.bin' '-w' '/tmp/graph10291830563777636286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10291830563777636286.bin' '-l' '-1' '-v' '-w' '/tmp/graph10291830563777636286.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:42:31] [INFO ] Decomposing Gal with order
[2023-03-09 14:42:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:42:37] [INFO ] Removed a total of 16344 redundant transitions.
[2023-03-09 14:42:37] [INFO ] Flatten gal took : 4029 ms
[2023-03-09 14:42:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 34410 labels/synchronizations in 5606 ms.
[2023-03-09 14:42:44] [INFO ] Time to serialize gal into /tmp/LTLFireability4297377103052103694.gal : 150 ms
[2023-03-09 14:42:44] [INFO ] Time to serialize properties into /tmp/LTLFireability14930619475736520351.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/LTLFireability4297377103052103694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14930619475736520351.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...277
Read 2 LTL properties
Checking formula 0 : !((X(X((X(!(("((i7.u20.Node5IsInserted>=1)&&(i38.u143.Node35requestsent5>=1))")U("((i54.i0.u204.Node50Request>=1)&&(i75.u300.Node74IsI...243
Formula 0 simplified : XX(!"((i7.u20.Node5IsInserted<1)||(i38.u143.Node35requestsent5<1))" | X("((i7.u20.Node5IsInserted>=1)&&(i38.u143.Node35requestsent5>...231
Compilation finished in 192104 ms.
Running link step : cd /tmp/ltsmin13267011114404875837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 247 ms.
Running LTSmin : cd /tmp/ltsmin13267011114404875837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X(!((LTLAPp0==true) U (LTLAPp1==true)))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 35475 ms.
FORMULA CANConstruction-PT-090-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13267011114404875837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp2==true)) U X(((LTLAPp3==true) U !(LTLAPp4==true))))))' '--buchi-type=spotba'
LTSmin run took 66230 ms.
FORMULA CANConstruction-PT-090-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1065196 ms.

BK_STOP 1678373244640

--------------------
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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.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="CANConstruction-PT-090"
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 CANConstruction-PT-090, 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-167813690700684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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