About the Execution of ITS-Tools for StigmergyCommit-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16187.479 | 1594525.00 | 5512239.00 | 2010.00 | TTFTFTTFTFFTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645600523.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyCommit-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645600523
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 7.6K Feb 26 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 11:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 11:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 11:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 11:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 155M Mar 5 18:23 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 StigmergyCommit-PT-10a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679385504515
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 07:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 07:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:58:35] [INFO ] Load time of PNML (sax parser for PT used): 7038 ms
[2023-03-21 07:58:35] [INFO ] Transformed 400 places.
[2023-03-21 07:58:35] [INFO ] Transformed 136960 transitions.
[2023-03-21 07:58:35] [INFO ] Found NUPN structural information;
[2023-03-21 07:58:35] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 7993 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 316 transition count 4520
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 316 transition count 4520
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 179 place count 316 transition count 4509
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 218 place count 277 transition count 4461
Iterating global reduction 1 with 39 rules applied. Total rules applied 257 place count 277 transition count 4461
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 267 place count 277 transition count 4451
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 273 place count 271 transition count 4445
Iterating global reduction 2 with 6 rules applied. Total rules applied 279 place count 271 transition count 4445
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 285 place count 265 transition count 4439
Iterating global reduction 2 with 6 rules applied. Total rules applied 291 place count 265 transition count 4439
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 296 place count 260 transition count 4434
Iterating global reduction 2 with 5 rules applied. Total rules applied 301 place count 260 transition count 4434
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 306 place count 255 transition count 4429
Iterating global reduction 2 with 5 rules applied. Total rules applied 311 place count 255 transition count 4429
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 316 place count 255 transition count 4424
Applied a total of 316 rules in 315 ms. Remains 255 /400 variables (removed 145) and now considering 4424/4615 (removed 191) transitions.
[2023-03-21 07:58:38] [INFO ] Flow matrix only has 4412 transitions (discarded 12 similar events)
// Phase 1: matrix 4412 rows 255 cols
[2023-03-21 07:58:38] [INFO ] Computed 2 place invariants in 138 ms
[2023-03-21 07:58:40] [INFO ] Implicit Places using invariants in 2284 ms returned []
[2023-03-21 07:58:40] [INFO ] Flow matrix only has 4412 transitions (discarded 12 similar events)
[2023-03-21 07:58:40] [INFO ] Invariant cache hit.
[2023-03-21 07:58:42] [INFO ] State equation strengthened by 4207 read => feed constraints.
[2023-03-21 07:58:43] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 5344 ms to find 0 implicit places.
[2023-03-21 07:58:43] [INFO ] Flow matrix only has 4412 transitions (discarded 12 similar events)
[2023-03-21 07:58:43] [INFO ] Invariant cache hit.
[2023-03-21 07:58:45] [INFO ] Dead Transitions using invariants and state equation in 2675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/400 places, 4424/4615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8340 ms. Remains : 255/400 places, 4424/4615 transitions.
Support contains 19 out of 255 places after structural reductions.
[2023-03-21 07:58:46] [INFO ] Flatten gal took : 708 ms
[2023-03-21 07:58:47] [INFO ] Flatten gal took : 399 ms
[2023-03-21 07:58:48] [INFO ] Input system was already deterministic with 4424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3685 ms. (steps per millisecond=2 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 07:58:52] [INFO ] Flow matrix only has 4412 transitions (discarded 12 similar events)
[2023-03-21 07:58:52] [INFO ] Invariant cache hit.
[2023-03-21 07:58:52] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-21 07:58:52] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 07:58:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-21 07:58:55] [INFO ] After 2211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 07:58:55] [INFO ] State equation strengthened by 4207 read => feed constraints.
[2023-03-21 07:58:58] [INFO ] After 2410ms SMT Verify possible using 4207 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 07:59:01] [INFO ] Deduced a trap composed of 14 places in 3082 ms of which 6 ms to minimize.
[2023-03-21 07:59:04] [INFO ] Deduced a trap composed of 16 places in 2411 ms of which 5 ms to minimize.
[2023-03-21 07:59:05] [INFO ] Deduced a trap composed of 16 places in 1562 ms of which 3 ms to minimize.
[2023-03-21 07:59:07] [INFO ] Deduced a trap composed of 16 places in 1673 ms of which 1 ms to minimize.
[2023-03-21 07:59:09] [INFO ] Deduced a trap composed of 17 places in 1617 ms of which 2 ms to minimize.
[2023-03-21 07:59:10] [INFO ] Deduced a trap composed of 19 places in 1331 ms of which 1 ms to minimize.
[2023-03-21 07:59:11] [INFO ] Deduced a trap composed of 14 places in 1186 ms of which 1 ms to minimize.
[2023-03-21 07:59:13] [INFO ] Deduced a trap composed of 17 places in 1397 ms of which 1 ms to minimize.
[2023-03-21 07:59:14] [INFO ] Deduced a trap composed of 14 places in 1217 ms of which 1 ms to minimize.
[2023-03-21 07:59:15] [INFO ] Deduced a trap composed of 14 places in 987 ms of which 1 ms to minimize.
[2023-03-21 07:59:17] [INFO ] Deduced a trap composed of 14 places in 965 ms of which 1 ms to minimize.
[2023-03-21 07:59:17] [INFO ] Deduced a trap composed of 14 places in 773 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-21 07:59:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:59:17] [INFO ] After 25361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 14 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 4424/4424 transitions.
Graph (complete) has 782 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.50 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 254 transition count 4383
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 75 place count 237 transition count 4366
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 75 place count 237 transition count 4318
Deduced a syphon composed of 48 places in 6 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 171 place count 189 transition count 4318
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 186 place count 174 transition count 4301
Iterating global reduction 2 with 15 rules applied. Total rules applied 201 place count 174 transition count 4301
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 212 place count 163 transition count 4290
Iterating global reduction 2 with 11 rules applied. Total rules applied 223 place count 163 transition count 4290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 227 place count 163 transition count 4286
Performed 43 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 313 place count 120 transition count 4241
Drop transitions removed 9 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 331 place count 120 transition count 4223
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 352 place count 99 transition count 4202
Iterating global reduction 4 with 21 rules applied. Total rules applied 373 place count 99 transition count 4202
Ensure Unique test removed 2045 transitions
Reduce isomorphic transitions removed 2045 transitions.
Iterating post reduction 4 with 2045 rules applied. Total rules applied 2418 place count 99 transition count 2157
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2425 place count 92 transition count 2150
Iterating global reduction 5 with 7 rules applied. Total rules applied 2432 place count 92 transition count 2150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2433 place count 92 transition count 2149
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2438 place count 87 transition count 2144
Iterating global reduction 6 with 5 rules applied. Total rules applied 2443 place count 87 transition count 2144
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2445 place count 87 transition count 2142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2447 place count 86 transition count 2141
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2448 place count 85 transition count 2140
Iterating global reduction 6 with 1 rules applied. Total rules applied 2449 place count 85 transition count 2140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2450 place count 85 transition count 2139
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2451 place count 85 transition count 2138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2452 place count 84 transition count 2138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2453 place count 84 transition count 2138
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2454 place count 84 transition count 2137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2455 place count 83 transition count 2136
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 8 with 13 rules applied. Total rules applied 2468 place count 82 transition count 2124
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 2480 place count 70 transition count 2124
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 2480 place count 70 transition count 2117
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 2494 place count 63 transition count 2117
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2495 place count 62 transition count 2116
Iterating global reduction 10 with 1 rules applied. Total rules applied 2496 place count 62 transition count 2116
Performed 17 Post agglomeration using F-continuation condition with reduction of 2026 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 2530 place count 45 transition count 73
Drop transitions removed 13 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 2554 place count 45 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 2568 place count 36 transition count 44
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2573 place count 36 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2574 place count 36 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2575 place count 35 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2576 place count 35 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2578 place count 33 transition count 35
Applied a total of 2578 rules in 4952 ms. Remains 33 /255 variables (removed 222) and now considering 35/4424 (removed 4389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4953 ms. Remains : 33/255 places, 35/4424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 33 cols
[2023-03-21 07:59:22] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-21 07:59:23] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 07:59:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-21 07:59:23] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 07:59:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 07:59:23] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 07:59:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-21 07:59:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 07:59:23] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-21 07:59:23] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 68 stabilizing places and 67 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' '!(((p0||G(p1)) U X(p2)))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 4424/4424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 247 transition count 4414
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 247 transition count 4414
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 241 transition count 4408
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 241 transition count 4408
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 241 transition count 4406
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 237 transition count 4402
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 237 transition count 4402
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 233 transition count 4398
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 233 transition count 4398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 233 transition count 4397
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 230 transition count 4394
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 230 transition count 4394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 230 transition count 4393
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 228 transition count 4391
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 228 transition count 4391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 228 transition count 4389
Applied a total of 60 rules in 167 ms. Remains 228 /255 variables (removed 27) and now considering 4389/4424 (removed 35) transitions.
[2023-03-21 07:59:23] [INFO ] Flow matrix only has 4377 transitions (discarded 12 similar events)
// Phase 1: matrix 4377 rows 228 cols
[2023-03-21 07:59:23] [INFO ] Computed 2 place invariants in 32 ms
[2023-03-21 07:59:25] [INFO ] Implicit Places using invariants in 1495 ms returned []
[2023-03-21 07:59:25] [INFO ] Flow matrix only has 4377 transitions (discarded 12 similar events)
[2023-03-21 07:59:25] [INFO ] Invariant cache hit.
[2023-03-21 07:59:26] [INFO ] State equation strengthened by 4194 read => feed constraints.
[2023-03-21 07:59:27] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 3724 ms to find 0 implicit places.
[2023-03-21 07:59:27] [INFO ] Flow matrix only has 4377 transitions (discarded 12 similar events)
[2023-03-21 07:59:27] [INFO ] Invariant cache hit.
[2023-03-21 07:59:30] [INFO ] Dead Transitions using invariants and state equation in 3375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/255 places, 4389/4424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7273 ms. Remains : 228/255 places, 4389/4424 transitions.
Stuttering acceptance computed with spot in 462 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s189 1), p1:(OR (EQ s215 0) (EQ s60 1)), p2:(OR (EQ s214 0) (EQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1039 ms.
Product exploration explored 100000 steps with 50000 reset in 875 ms.
Computed a total of 68 stabilizing places and 67 stable transitions
Computed a total of 68 stabilizing places and 67 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 15 factoid took 269 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-01 finished in 10078 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)&&X((p1&&F(G(p2))))))))'
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 4424/4424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 247 transition count 4414
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 247 transition count 4414
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 242 transition count 4409
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 242 transition count 4409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 242 transition count 4407
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 239 transition count 4404
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 239 transition count 4404
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 236 transition count 4401
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 236 transition count 4401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 236 transition count 4400
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 234 transition count 4398
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 234 transition count 4398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 234 transition count 4397
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 233 transition count 4396
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 233 transition count 4396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 233 transition count 4395
Applied a total of 49 rules in 261 ms. Remains 233 /255 variables (removed 22) and now considering 4395/4424 (removed 29) transitions.
[2023-03-21 07:59:33] [INFO ] Flow matrix only has 4383 transitions (discarded 12 similar events)
// Phase 1: matrix 4383 rows 233 cols
[2023-03-21 07:59:33] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-21 07:59:35] [INFO ] Implicit Places using invariants in 1730 ms returned []
[2023-03-21 07:59:35] [INFO ] Flow matrix only has 4383 transitions (discarded 12 similar events)
[2023-03-21 07:59:35] [INFO ] Invariant cache hit.
[2023-03-21 07:59:37] [INFO ] State equation strengthened by 4197 read => feed constraints.
[2023-03-21 07:59:37] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 3760 ms to find 0 implicit places.
[2023-03-21 07:59:37] [INFO ] Flow matrix only has 4383 transitions (discarded 12 similar events)
[2023-03-21 07:59:37] [INFO ] Invariant cache hit.
[2023-03-21 07:59:41] [INFO ] Dead Transitions using invariants and state equation in 4026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/255 places, 4395/4424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8049 ms. Remains : 233/255 places, 4395/4424 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (EQ s16 0) (EQ s110 1)) (EQ s196 1)), p1:(OR (EQ s16 0) (EQ s110 1)), p2:(EQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-02 finished in 8360 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((p0 U X(X(p0)))))'
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 4424/4424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 246 transition count 4413
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 246 transition count 4413
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 240 transition count 4407
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 240 transition count 4407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 240 transition count 4406
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 235 transition count 4401
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 235 transition count 4401
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 231 transition count 4397
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 231 transition count 4397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 231 transition count 4395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 229 transition count 4393
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 229 transition count 4393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 229 transition count 4392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 228 transition count 4391
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 228 transition count 4391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 228 transition count 4390
Applied a total of 59 rules in 165 ms. Remains 228 /255 variables (removed 27) and now considering 4390/4424 (removed 34) transitions.
[2023-03-21 07:59:42] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
// Phase 1: matrix 4378 rows 228 cols
[2023-03-21 07:59:42] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-21 07:59:43] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2023-03-21 07:59:43] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 07:59:43] [INFO ] Invariant cache hit.
[2023-03-21 07:59:46] [INFO ] Implicit Places using invariants and state equation in 2904 ms returned []
Implicit Place search using SMT with State Equation took 4303 ms to find 0 implicit places.
[2023-03-21 07:59:46] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 07:59:46] [INFO ] Invariant cache hit.
[2023-03-21 07:59:50] [INFO ] Dead Transitions using invariants and state equation in 3736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/255 places, 4390/4424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8207 ms. Remains : 228/255 places, 4390/4424 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 33040 steps with 0 reset in 10001 ms.
Product exploration explored 100000 steps with 0 reset in 7557 ms.
Computed a total of 68 stabilizing places and 67 stable transitions
Computed a total of 68 stabilizing places and 67 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3721 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4758 steps, run visited all 1 properties in 52 ms. (steps per millisecond=91 )
Probabilistic random walk after 4758 steps, saw 4610 distinct states, run finished after 53 ms. (steps per millisecond=89 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 4390/4390 transitions.
Applied a total of 0 rules in 18 ms. Remains 228 /228 variables (removed 0) and now considering 4390/4390 (removed 0) transitions.
[2023-03-21 08:00:12] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:00:12] [INFO ] Invariant cache hit.
[2023-03-21 08:00:14] [INFO ] Implicit Places using invariants in 2011 ms returned []
[2023-03-21 08:00:14] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:00:14] [INFO ] Invariant cache hit.
[2023-03-21 08:00:15] [INFO ] State equation strengthened by 4195 read => feed constraints.
[2023-03-21 08:00:15] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 3618 ms to find 0 implicit places.
[2023-03-21 08:00:15] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:00:15] [INFO ] Invariant cache hit.
[2023-03-21 08:00:19] [INFO ] Dead Transitions using invariants and state equation in 3143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6781 ms. Remains : 228/228 places, 4390/4390 transitions.
Computed a total of 68 stabilizing places and 67 stable transitions
Computed a total of 68 stabilizing places and 67 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3604 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4758 steps, run visited all 1 properties in 31 ms. (steps per millisecond=153 )
Probabilistic random walk after 4758 steps, saw 4610 distinct states, run finished after 31 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 0 reset in 9823 ms.
Product exploration timeout after 32800 steps with 0 reset in 10003 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 4390/4390 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 228 transition count 4390
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 228 transition count 4380
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 20 place count 228 transition count 4380
Deduced a syphon composed of 53 places in 3 ms
Iterating global reduction 2 with 43 rules applied. Total rules applied 63 place count 228 transition count 4380
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 99 places in 3 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 109 place count 228 transition count 4415
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 121 place count 228 transition count 4403
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 154 place count 195 transition count 4370
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 3 with 33 rules applied. Total rules applied 187 place count 195 transition count 4370
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 3 with 2047 rules applied. Total rules applied 2234 place count 195 transition count 2323
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2255 place count 174 transition count 2302
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 4 with 21 rules applied. Total rules applied 2276 place count 174 transition count 2302
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2287 place count 163 transition count 2291
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 2298 place count 163 transition count 2291
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 2309 place count 163 transition count 2313
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2320 place count 152 transition count 2291
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 2331 place count 152 transition count 2291
Deduced a syphon composed of 78 places in 1 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 2353 place count 152 transition count 2269
Deduced a syphon composed of 78 places in 0 ms
Applied a total of 2353 rules in 3152 ms. Remains 152 /228 variables (removed 76) and now considering 2269/4390 (removed 2121) transitions.
[2023-03-21 08:00:47] [INFO ] Redundant transitions in 469 ms returned []
[2023-03-21 08:00:47] [INFO ] Flow matrix only has 2257 transitions (discarded 12 similar events)
// Phase 1: matrix 2257 rows 152 cols
[2023-03-21 08:00:47] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-21 08:00:48] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/228 places, 2269/4390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5006 ms. Remains : 152/228 places, 2269/4390 transitions.
Built C files in :
/tmp/ltsmin17466958384976679326
[2023-03-21 08:00:49] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17466958384976679326
Running compilation step : cd /tmp/ltsmin17466958384976679326;'/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/ltsmin17466958384976679326;'/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/ltsmin17466958384976679326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 4390/4390 transitions.
Applied a total of 0 rules in 20 ms. Remains 228 /228 variables (removed 0) and now considering 4390/4390 (removed 0) transitions.
[2023-03-21 08:00:52] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
// Phase 1: matrix 4378 rows 228 cols
[2023-03-21 08:00:52] [INFO ] Computed 2 place invariants in 28 ms
[2023-03-21 08:00:53] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2023-03-21 08:00:53] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:00:53] [INFO ] Invariant cache hit.
[2023-03-21 08:00:54] [INFO ] State equation strengthened by 4195 read => feed constraints.
[2023-03-21 08:00:55] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 3123 ms to find 0 implicit places.
[2023-03-21 08:00:55] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:00:55] [INFO ] Invariant cache hit.
[2023-03-21 08:00:58] [INFO ] Dead Transitions using invariants and state equation in 3447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6593 ms. Remains : 228/228 places, 4390/4390 transitions.
Built C files in :
/tmp/ltsmin18429692597533743827
[2023-03-21 08:00:58] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18429692597533743827
Running compilation step : cd /tmp/ltsmin18429692597533743827;'/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/ltsmin18429692597533743827;'/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/ltsmin18429692597533743827;'/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-21 08:01:02] [INFO ] Flatten gal took : 371 ms
[2023-03-21 08:01:03] [INFO ] Flatten gal took : 350 ms
[2023-03-21 08:01:03] [INFO ] Time to serialize gal into /tmp/LTL11612005103850991866.gal : 184 ms
[2023-03-21 08:01:03] [INFO ] Time to serialize properties into /tmp/LTL11814609615467103808.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11612005103850991866.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17204206652788939685.hoa' '-atoms' '/tmp/LTL11814609615467103808.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...320
Loading property file /tmp/LTL11814609615467103808.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17204206652788939685.hoa
Detected timeout of ITS tools.
[2023-03-21 08:01:19] [INFO ] Flatten gal took : 356 ms
[2023-03-21 08:01:19] [INFO ] Flatten gal took : 300 ms
[2023-03-21 08:01:19] [INFO ] Time to serialize gal into /tmp/LTL8031554783829946274.gal : 123 ms
[2023-03-21 08:01:19] [INFO ] Time to serialize properties into /tmp/LTL1599814045383916078.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/LTL8031554783829946274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1599814045383916078.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 : !((G(("((p19==0)||(p270==1))")U(X(X("((p19==0)||(p270==1))"))))))
Formula 0 simplified : F(!"((p19==0)||(p270==1))" R XX!"((p19==0)||(p270==1))")
Detected timeout of ITS tools.
[2023-03-21 08:01:35] [INFO ] Flatten gal took : 332 ms
[2023-03-21 08:01:35] [INFO ] Applying decomposition
[2023-03-21 08:01:35] [INFO ] Flatten gal took : 307 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/graph10769022768692258541.txt' '-o' '/tmp/graph10769022768692258541.bin' '-w' '/tmp/graph10769022768692258541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10769022768692258541.bin' '-l' '-1' '-v' '-w' '/tmp/graph10769022768692258541.weights' '-q' '0' '-e' '0.001'
[2023-03-21 08:01:36] [INFO ] Decomposing Gal with order
[2023-03-21 08:01:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 08:01:38] [INFO ] Removed a total of 45215 redundant transitions.
[2023-03-21 08:01:39] [INFO ] Flatten gal took : 1639 ms
[2023-03-21 08:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 647 ms.
[2023-03-21 08:01:40] [INFO ] Time to serialize gal into /tmp/LTL3835071542368551569.gal : 63 ms
[2023-03-21 08:01:40] [INFO ] Time to serialize properties into /tmp/LTL13290843778197860471.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3835071542368551569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13290843778197860471.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.i0.u3.p19==0)||(i1.i19.u54.p270==1))")U(X(X("((i1.i0.u3.p19==0)||(i1.i19.u54.p270==1))"))))))
Formula 0 simplified : F(!"((i1.i0.u3.p19==0)||(i1.i19.u54.p270==1))" R XX!"((i1.i0.u3.p19==0)||(i1.i19.u54.p270==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6914190857674107759
[2023-03-21 08:01:55] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6914190857674107759
Running compilation step : cd /tmp/ltsmin6914190857674107759;'/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/ltsmin6914190857674107759;'/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/ltsmin6914190857674107759;'/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 StigmergyCommit-PT-10a-LTLCardinality-06 finished in 136264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 4424/4424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 246 transition count 4413
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 246 transition count 4413
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 240 transition count 4407
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 240 transition count 4407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 240 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 236 transition count 4401
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 236 transition count 4401
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 232 transition count 4397
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 232 transition count 4397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 232 transition count 4395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 230 transition count 4393
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 230 transition count 4393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 230 transition count 4392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 229 transition count 4391
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 229 transition count 4391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 229 transition count 4390
Applied a total of 58 rules in 163 ms. Remains 229 /255 variables (removed 26) and now considering 4390/4424 (removed 34) transitions.
[2023-03-21 08:01:58] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
// Phase 1: matrix 4378 rows 229 cols
[2023-03-21 08:01:58] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-21 08:01:59] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2023-03-21 08:01:59] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:01:59] [INFO ] Invariant cache hit.
[2023-03-21 08:02:00] [INFO ] State equation strengthened by 4195 read => feed constraints.
[2023-03-21 08:02:01] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2023-03-21 08:02:01] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:02:01] [INFO ] Invariant cache hit.
[2023-03-21 08:02:05] [INFO ] Dead Transitions using invariants and state equation in 3757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/255 places, 4390/4424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6960 ms. Remains : 229/255 places, 4390/4424 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s150 0), p0:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 33780 steps with 0 reset in 10004 ms.
Product exploration explored 100000 steps with 0 reset in 6178 ms.
Computed a total of 68 stabilizing places and 67 stable transitions
Computed a total of 68 stabilizing places and 67 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3587 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 686555 steps, run timeout after 9001 ms. (steps per millisecond=76 ) properties seen :{0=1}
Probabilistic random walk after 686555 steps, saw 81721 distinct states, run finished after 9002 ms. (steps per millisecond=76 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-21 08:02:34] [INFO ] Flow matrix only has 4378 transitions (discarded 12 similar events)
[2023-03-21 08:02:34] [INFO ] Invariant cache hit.
[2023-03-21 08:02:34] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 08:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 08:02:35] [INFO ] After 1197ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-08 finished in 37646 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)&&X(X(p1))&&F(p2))))'
Support contains 6 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 4424/4424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 249 transition count 4418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 249 transition count 4418
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 245 transition count 4414
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 245 transition count 4414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 245 transition count 4413
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 243 transition count 4411
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 243 transition count 4411
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 241 transition count 4409
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 241 transition count 4409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 241 transition count 4408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 240 transition count 4407
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 240 transition count 4407
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 239 transition count 4406
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 239 transition count 4406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 239 transition count 4405
Applied a total of 35 rules in 154 ms. Remains 239 /255 variables (removed 16) and now considering 4405/4424 (removed 19) transitions.
[2023-03-21 08:02:35] [INFO ] Flow matrix only has 4393 transitions (discarded 12 similar events)
// Phase 1: matrix 4393 rows 239 cols
[2023-03-21 08:02:36] [INFO ] Computed 2 place invariants in 26 ms
[2023-03-21 08:02:37] [INFO ] Implicit Places using invariants in 1418 ms returned []
[2023-03-21 08:02:37] [INFO ] Flow matrix only has 4393 transitions (discarded 12 similar events)
[2023-03-21 08:02:37] [INFO ] Invariant cache hit.
[2023-03-21 08:02:38] [INFO ] State equation strengthened by 4200 read => feed constraints.
[2023-03-21 08:02:38] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2023-03-21 08:02:38] [INFO ] Flow matrix only has 4393 transitions (discarded 12 similar events)
[2023-03-21 08:02:38] [INFO ] Invariant cache hit.
[2023-03-21 08:02:41] [INFO ] Dead Transitions using invariants and state equation in 2916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/255 places, 4405/4424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6086 ms. Remains : 239/255 places, 4405/4424 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}]], initial=0, aps=[p0:(AND (EQ s141 0) (EQ s218 1)), p2:(AND (EQ s117 0) (EQ s224 1)), p1:(AND (EQ s7 0) (EQ s108 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-10 finished in 6408 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((p0 U X(X(p0)))))'
[2023-03-21 08:02:42] [INFO ] Flatten gal took : 302 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1849932955826462774
[2023-03-21 08:02:42] [INFO ] Too many transitions (4424) to apply POR reductions. Disabling POR matrices.
[2023-03-21 08:02:43] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1849932955826462774
Running compilation step : cd /tmp/ltsmin1849932955826462774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 08:02:43] [INFO ] Applying decomposition
[2023-03-21 08:02:43] [INFO ] Flatten gal took : 315 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/graph11160467117644381556.txt' '-o' '/tmp/graph11160467117644381556.bin' '-w' '/tmp/graph11160467117644381556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11160467117644381556.bin' '-l' '-1' '-v' '-w' '/tmp/graph11160467117644381556.weights' '-q' '0' '-e' '0.001'
[2023-03-21 08:02:44] [INFO ] Decomposing Gal with order
[2023-03-21 08:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 08:02:45] [INFO ] Removed a total of 45252 redundant transitions.
[2023-03-21 08:02:46] [INFO ] Flatten gal took : 858 ms
[2023-03-21 08:02:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 416 ms.
[2023-03-21 08:02:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality12757598630827465982.gal : 44 ms
[2023-03-21 08:02:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality3609151771637334263.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12757598630827465982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3609151771637334263.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 1 LTL properties
Checking formula 0 : !((G(("((i1.i0.u5.p19==0)||(i1.i17.u62.p270==1))")U(X(X("((i1.i0.u5.p19==0)||(i1.i17.u62.p270==1))"))))))
Formula 0 simplified : F(!"((i1.i0.u5.p19==0)||(i1.i17.u62.p270==1))" R XX!"((i1.i0.u5.p19==0)||(i1.i17.u62.p270==1))")
Compilation finished in 35015 ms.
Running link step : cd /tmp/ltsmin1849932955826462774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin1849932955826462774;'/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' '[](((LTLAPp0==true) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-21 08:24:34] [INFO ] Applying decomposition
[2023-03-21 08:24:35] [INFO ] Flatten gal took : 560 ms
[2023-03-21 08:24:35] [INFO ] Decomposing Gal with order
[2023-03-21 08:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 08:24:38] [INFO ] Removed a total of 45233 redundant transitions.
[2023-03-21 08:24:38] [INFO ] Flatten gal took : 2651 ms
[2023-03-21 08:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 1434 ms.
[2023-03-21 08:24:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality3882703509929831968.gal : 154 ms
[2023-03-21 08:24:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality1714687507416299010.ltl : 12 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/LTLCardinality3882703509929831968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1714687507416299010.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((u1.p19==0)||(u8.p270==1))")U(X(X("((u1.p19==0)||(u8.p270==1))"))))))
Formula 0 simplified : F(!"((u1.p19==0)||(u8.p270==1))" R XX!"((u1.p19==0)||(u8.p270==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t13, t18, t23, t28, t35, t40, t45, t50, t72, t76, t89, t90, t96, t109, t111, t117, t1...753
72 unique states visited
0 strongly connected components in search stack
141 transitions explored
72 items max in DFS search stack
512 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.27302,57200,1,0,42476,15894,38804,31813,1823,91514,128855
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1587834 ms.
BK_STOP 1679387099040
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-10a"
export BK_EXAMINATION="LTLCardinality"
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 StigmergyCommit-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645600523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-10a.tgz
mv StigmergyCommit-PT-10a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;