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.r455-smll-167912647600628.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 lolaxred
Input is StigmergyElection-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647600628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 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 1.2M 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 StigmergyElection-PT-06b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679319105772

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 13:31:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:31:48] [INFO ] Load time of PNML (sax parser for PT used): 506 ms
[2023-03-20 13:31:48] [INFO ] Transformed 835 places.
[2023-03-20 13:31:48] [INFO ] Transformed 2416 transitions.
[2023-03-20 13:31:48] [INFO ] Found NUPN structural information;
[2023-03-20 13:31:48] [INFO ] Parsed PT model containing 835 places and 2416 transitions and 20130 arcs in 661 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-06b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 2416/2416 transitions.
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 102 place count 733 transition count 2314
Iterating global reduction 0 with 102 rules applied. Total rules applied 204 place count 733 transition count 2314
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 259 place count 678 transition count 2259
Iterating global reduction 0 with 55 rules applied. Total rules applied 314 place count 678 transition count 2259
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 326 place count 666 transition count 2247
Iterating global reduction 0 with 12 rules applied. Total rules applied 338 place count 666 transition count 2247
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 344 place count 660 transition count 2241
Iterating global reduction 0 with 6 rules applied. Total rules applied 350 place count 660 transition count 2241
Applied a total of 350 rules in 569 ms. Remains 660 /835 variables (removed 175) and now considering 2241/2416 (removed 175) transitions.
// Phase 1: matrix 2241 rows 660 cols
[2023-03-20 13:31:49] [INFO ] Computed 7 place invariants in 64 ms
[2023-03-20 13:31:50] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-20 13:31:50] [INFO ] Invariant cache hit.
[2023-03-20 13:31:51] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2023-03-20 13:31:51] [INFO ] Invariant cache hit.
[2023-03-20 13:31:53] [INFO ] Dead Transitions using invariants and state equation in 1909 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 660/835 places, 2241/2416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4526 ms. Remains : 660/835 places, 2241/2416 transitions.
Support contains 61 out of 660 places after structural reductions.
[2023-03-20 13:31:54] [INFO ] Flatten gal took : 351 ms
[2023-03-20 13:31:54] [INFO ] Flatten gal took : 192 ms
[2023-03-20 13:31:55] [INFO ] Input system was already deterministic with 2241 transitions.
Support contains 60 out of 660 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 819 ms. (steps per millisecond=12 ) properties (out of 38) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-20 13:31:56] [INFO ] Invariant cache hit.
[2023-03-20 13:31:57] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-20 13:31:59] [INFO ] After 1784ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:25
[2023-03-20 13:32:00] [INFO ] After 2673ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:25
Attempting to minimize the solution found.
Minimization took 663 ms.
[2023-03-20 13:32:01] [INFO ] After 4320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:25
[2023-03-20 13:32:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-20 13:32:12] [INFO ] After 9663ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :26
[2023-03-20 13:32:23] [INFO ] Deduced a trap composed of 162 places in 1361 ms of which 3 ms to minimize.
[2023-03-20 13:32:25] [INFO ] Deduced a trap composed of 182 places in 1354 ms of which 2 ms to minimize.
[2023-03-20 13:32:26] [INFO ] Deduced a trap composed of 167 places in 1220 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-20 13:32:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 13:32:26] [INFO ] After 25433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:25
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 21 properties in 434 ms.
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 663 edges and 660 vertex of which 102 / 660 are part of one of the 18 SCC in 19 ms
Free SCC test removed 84 places
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 1382 edges and 576 vertex of which 570 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.46 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 401 rules applied. Total rules applied 403 place count 570 transition count 1726
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 405 rules applied. Total rules applied 808 place count 175 transition count 1716
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 817 place count 170 transition count 1712
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 821 place count 166 transition count 1712
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 821 place count 166 transition count 1683
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 879 place count 137 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 881 place count 135 transition count 1681
Iterating global reduction 4 with 2 rules applied. Total rules applied 883 place count 135 transition count 1681
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 947 place count 103 transition count 1649
Drop transitions removed 1 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 959 place count 103 transition count 1637
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 981 place count 81 transition count 286
Iterating global reduction 5 with 22 rules applied. Total rules applied 1003 place count 81 transition count 286
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1016 place count 81 transition count 273
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1019 place count 78 transition count 270
Iterating global reduction 6 with 3 rules applied. Total rules applied 1022 place count 78 transition count 270
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1034 place count 72 transition count 264
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1040 place count 69 transition count 272
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1050 place count 69 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 1052 place count 68 transition count 268
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 1083 place count 68 transition count 237
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 1123 place count 37 transition count 228
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1129 place count 31 transition count 222
Iterating global reduction 7 with 6 rules applied. Total rules applied 1135 place count 31 transition count 222
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1154 place count 31 transition count 203
Applied a total of 1154 rules in 569 ms. Remains 31 /660 variables (removed 629) and now considering 203/2241 (removed 2038) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 31/660 places, 203/2241 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 203 rows 31 cols
[2023-03-20 13:32:28] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-20 13:32:28] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:32:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-20 13:32:28] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:32:28] [INFO ] State equation strengthened by 170 read => feed constraints.
[2023-03-20 13:32:28] [INFO ] After 36ms SMT Verify possible using 170 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:32:28] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2023-03-20 13:32:28] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2023-03-20 13:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 172 ms
[2023-03-20 13:32:28] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-20 13:32:28] [INFO ] After 366ms 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.
FORMULA StigmergyElection-PT-06b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 91 stabilizing places and 97 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p2&&X(p2))||p1)&&p0)))'
Support contains 11 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 657 transition count 2238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 657 transition count 2238
Applied a total of 6 rules in 55 ms. Remains 657 /660 variables (removed 3) and now considering 2238/2241 (removed 3) transitions.
// Phase 1: matrix 2238 rows 657 cols
[2023-03-20 13:32:29] [INFO ] Computed 7 place invariants in 38 ms
[2023-03-20 13:32:29] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-20 13:32:29] [INFO ] Invariant cache hit.
[2023-03-20 13:32:31] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2023-03-20 13:32:31] [INFO ] Invariant cache hit.
[2023-03-20 13:32:33] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 657/660 places, 2238/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4771 ms. Remains : 657/660 places, 2238/2241 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(AND (EQ s550 0) (EQ s70 1) (EQ s165 1) (EQ s271 1) (EQ s388 1) (EQ s483 1) (EQ s612 1)), p1:(OR (EQ s70 0) (EQ s165 0) (EQ s271 0) (EQ s388 0) (EQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 7 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-00 finished in 5274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(G(p0))&&(p1||F(p2)))))))'
Support contains 1 out of 660 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 669 edges and 660 vertex of which 102 / 660 are part of one of the 18 SCC in 3 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 387 place count 575 transition count 1758
Reduce places removed 386 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 398 rules applied. Total rules applied 785 place count 189 transition count 1746
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 792 place count 183 transition count 1745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 793 place count 182 transition count 1745
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 793 place count 182 transition count 1721
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 841 place count 158 transition count 1721
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 848 place count 151 transition count 1714
Iterating global reduction 4 with 7 rules applied. Total rules applied 855 place count 151 transition count 1714
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 915 place count 121 transition count 1684
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 934 place count 102 transition count 758
Iterating global reduction 4 with 19 rules applied. Total rules applied 953 place count 102 transition count 758
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 960 place count 102 transition count 751
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 966 place count 96 transition count 739
Iterating global reduction 5 with 6 rules applied. Total rules applied 972 place count 96 transition count 739
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 978 place count 90 transition count 727
Iterating global reduction 5 with 6 rules applied. Total rules applied 984 place count 90 transition count 727
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1004 place count 80 transition count 734
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1005 place count 79 transition count 722
Iterating global reduction 5 with 1 rules applied. Total rules applied 1006 place count 79 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1007 place count 79 transition count 721
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1013 place count 79 transition count 715
Applied a total of 1013 rules in 494 ms. Remains 79 /660 variables (removed 581) and now considering 715/2241 (removed 1526) transitions.
[2023-03-20 13:32:34] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
// Phase 1: matrix 708 rows 79 cols
[2023-03-20 13:32:34] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-20 13:32:35] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-20 13:32:35] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:35] [INFO ] Invariant cache hit.
[2023-03-20 13:32:35] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:32:35] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-20 13:32:35] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 13:32:35] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:35] [INFO ] Invariant cache hit.
[2023-03-20 13:32:36] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/660 places, 715/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2094 ms. Remains : 79/660 places, 715/2241 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-01 finished in 2188 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)||G(p1)||G(p2)))'
Support contains 13 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 663 edges and 660 vertex of which 102 / 660 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 382 rules applied. Total rules applied 383 place count 575 transition count 1762
Reduce places removed 382 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 394 rules applied. Total rules applied 777 place count 193 transition count 1750
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 783 place count 187 transition count 1750
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 783 place count 187 transition count 1726
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 831 place count 163 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 838 place count 156 transition count 1719
Iterating global reduction 3 with 7 rules applied. Total rules applied 845 place count 156 transition count 1719
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 905 place count 126 transition count 1689
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 922 place count 109 transition count 753
Iterating global reduction 3 with 17 rules applied. Total rules applied 939 place count 109 transition count 753
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 944 place count 109 transition count 748
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 949 place count 104 transition count 738
Iterating global reduction 4 with 5 rules applied. Total rules applied 954 place count 104 transition count 738
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 959 place count 99 transition count 728
Iterating global reduction 4 with 5 rules applied. Total rules applied 964 place count 99 transition count 728
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 984 place count 89 transition count 735
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 985 place count 88 transition count 722
Iterating global reduction 4 with 1 rules applied. Total rules applied 986 place count 88 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 987 place count 88 transition count 721
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 993 place count 88 transition count 715
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 994 place count 88 transition count 715
Applied a total of 994 rules in 412 ms. Remains 88 /660 variables (removed 572) and now considering 715/2241 (removed 1526) transitions.
[2023-03-20 13:32:36] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
// Phase 1: matrix 708 rows 88 cols
[2023-03-20 13:32:36] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-20 13:32:37] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-20 13:32:37] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:37] [INFO ] Invariant cache hit.
[2023-03-20 13:32:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:32:37] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2023-03-20 13:32:37] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-20 13:32:37] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:37] [INFO ] Invariant cache hit.
[2023-03-20 13:32:38] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/660 places, 715/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1662 ms. Remains : 88/660 places, 715/2241 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=3, aps=[p2:(OR (EQ s8 0) (EQ s24 0) (EQ s38 0) (EQ s52 0) (EQ s66 0) (EQ s81 0)), p1:(EQ s49 0), p0:(AND (EQ s5 1) (EQ s20 1) (EQ s34 1) (EQ s46 1) (EQ s63 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 8391 reset in 861 ms.
Product exploration explored 100000 steps with 8383 reset in 425 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 48 factoid took 2580 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 839 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 359990 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 359990 steps, saw 71318 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-20 13:32:46] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:46] [INFO ] Invariant cache hit.
[2023-03-20 13:32:46] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 13:32:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:32:47] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-20 13:32:47] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:32:47] [INFO ] After 425ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-20 13:32:47] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-20 13:32:48] [INFO ] After 1781ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 715/715 transitions.
Graph (complete) has 526 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 87 transition count 695
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 26 place count 81 transition count 695
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 77 transition count 435
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 77 transition count 435
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 77 transition count 431
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 65 transition count 419
Free-agglomeration rule applied 34 times.
Iterating global reduction 3 with 34 rules applied. Total rules applied 96 place count 65 transition count 385
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 140 place count 30 transition count 376
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 146 place count 24 transition count 370
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 24 transition count 370
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 215 place count 24 transition count 307
Performed 6 Post agglomeration using F-continuation condition with reduction of 152 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 227 place count 18 transition count 149
Drop transitions removed 6 transitions
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 300 place count 18 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 304 place count 16 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 16 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 306 place count 15 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 307 place count 15 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 308 place count 14 transition count 71
Applied a total of 308 rules in 105 ms. Remains 14 /88 variables (removed 74) and now considering 71/715 (removed 644) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 14/88 places, 71/715 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=26 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2)), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 49 factoid took 2798 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 7 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 715/715 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 715/715 (removed 0) transitions.
[2023-03-20 13:32:51] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:51] [INFO ] Invariant cache hit.
[2023-03-20 13:32:51] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-20 13:32:51] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:51] [INFO ] Invariant cache hit.
[2023-03-20 13:32:52] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:32:52] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-20 13:32:52] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:52] [INFO ] Invariant cache hit.
[2023-03-20 13:32:53] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1529 ms. Remains : 88/88 places, 715/715 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (AND p1 p2)), (X (X p2)), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 850 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 385069 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385069 steps, saw 76805 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 13:32:57] [INFO ] Flow matrix only has 708 transitions (discarded 7 similar events)
[2023-03-20 13:32:57] [INFO ] Invariant cache hit.
[2023-03-20 13:32:57] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 13:32:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:32:58] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 13:32:58] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:32:58] [INFO ] After 321ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 13:32:58] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-20 13:32:58] [INFO ] After 1277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 715/715 transitions.
Graph (complete) has 526 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 87 transition count 695
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 26 place count 81 transition count 695
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 77 transition count 435
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 77 transition count 435
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 77 transition count 431
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 62 place count 65 transition count 419
Free-agglomeration rule applied 34 times.
Iterating global reduction 3 with 34 rules applied. Total rules applied 96 place count 65 transition count 385
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 140 place count 30 transition count 376
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 146 place count 24 transition count 370
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 24 transition count 370
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 215 place count 24 transition count 307
Performed 6 Post agglomeration using F-continuation condition with reduction of 152 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 227 place count 18 transition count 149
Drop transitions removed 6 transitions
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 300 place count 18 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 304 place count 16 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 16 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 306 place count 15 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 307 place count 15 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 308 place count 14 transition count 71
Applied a total of 308 rules in 70 ms. Remains 14 /88 variables (removed 74) and now considering 71/715 (removed 644) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 14/88 places, 71/715 transitions.
Finished random walk after 19 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (AND p1 p2)), (X (X p2)), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 8355 reset in 323 ms.
Product exploration explored 100000 steps with 8426 reset in 486 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 715/715 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 88 transition count 715
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 84 transition count 455
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 84 transition count 455
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 84 transition count 451
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 48 ms. Remains 84 /88 variables (removed 4) and now considering 451/715 (removed 264) transitions.
[2023-03-20 13:33:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 13:33:01] [INFO ] Flow matrix only has 444 transitions (discarded 7 similar events)
// Phase 1: matrix 444 rows 84 cols
[2023-03-20 13:33:01] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-20 13:33:01] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/88 places, 451/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 84/88 places, 451/715 transitions.
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 715/715 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 84 transition count 455
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 455
Applied a total of 8 rules in 9 ms. Remains 84 /88 variables (removed 4) and now considering 455/715 (removed 260) transitions.
[2023-03-20 13:33:01] [INFO ] Flow matrix only has 448 transitions (discarded 7 similar events)
// Phase 1: matrix 448 rows 84 cols
[2023-03-20 13:33:01] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-20 13:33:01] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-20 13:33:01] [INFO ] Flow matrix only has 448 transitions (discarded 7 similar events)
[2023-03-20 13:33:01] [INFO ] Invariant cache hit.
[2023-03-20 13:33:02] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:33:02] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-20 13:33:02] [INFO ] Flow matrix only has 448 transitions (discarded 7 similar events)
[2023-03-20 13:33:02] [INFO ] Invariant cache hit.
[2023-03-20 13:33:02] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/88 places, 455/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 84/88 places, 455/715 transitions.
Treatment of property StigmergyElection-PT-06b-LTLFireability-02 finished in 26518 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))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 87 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2023-03-20 13:33:03] [INFO ] Computed 7 place invariants in 25 ms
[2023-03-20 13:33:03] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-20 13:33:03] [INFO ] Invariant cache hit.
[2023-03-20 13:33:04] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2023-03-20 13:33:04] [INFO ] Invariant cache hit.
[2023-03-20 13:33:07] [INFO ] Dead Transitions using invariants and state equation in 2091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3976 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s70 1) (EQ s165 1) (EQ s293 1) (EQ s399 1) (EQ s494 1) (EQ s611 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 785 ms.
Product exploration explored 100000 steps with 33333 reset in 697 ms.
Computed a total of 90 stabilizing places and 96 stable transitions
Computed a total of 90 stabilizing places and 96 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06b-LTLFireability-03 finished in 5656 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||(X(G(p2))&&p1))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 47 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
[2023-03-20 13:33:08] [INFO ] Invariant cache hit.
[2023-03-20 13:33:09] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-20 13:33:09] [INFO ] Invariant cache hit.
[2023-03-20 13:33:10] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-20 13:33:10] [INFO ] Invariant cache hit.
[2023-03-20 13:33:12] [INFO ] Dead Transitions using invariants and state equation in 1997 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4009 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s498 0), p1:(AND (EQ s23 1) (EQ s140 1) (EQ s246 1) (EQ s341 1) (EQ s458 1) (EQ s553 1)), p2:(OR (EQ s23 0) (EQ s140 0) (EQ s246 0) (EQ s341 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1237 steps with 11 reset in 4 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-05 finished in 4154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (p1||X(F((p1&&F(p2)))))))'
Support contains 8 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 661 edges and 660 vertex of which 102 / 660 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 381 transitions
Trivial Post-agglo rules discarded 381 transitions
Performed 381 trivial Post agglomeration. Transition count delta: 381
Iterating post reduction 0 with 381 rules applied. Total rules applied 382 place count 575 transition count 1763
Reduce places removed 381 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 393 rules applied. Total rules applied 775 place count 194 transition count 1751
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 787 place count 188 transition count 1745
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 793 place count 182 transition count 1745
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 793 place count 182 transition count 1722
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 839 place count 159 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 846 place count 152 transition count 1715
Iterating global reduction 4 with 7 rules applied. Total rules applied 853 place count 152 transition count 1715
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 913 place count 122 transition count 1685
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 932 place count 103 transition count 759
Iterating global reduction 4 with 19 rules applied. Total rules applied 951 place count 103 transition count 759
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 957 place count 103 transition count 753
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 963 place count 97 transition count 741
Iterating global reduction 5 with 6 rules applied. Total rules applied 969 place count 97 transition count 741
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 975 place count 91 transition count 729
Iterating global reduction 5 with 6 rules applied. Total rules applied 981 place count 91 transition count 729
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1001 place count 81 transition count 736
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1002 place count 80 transition count 724
Iterating global reduction 5 with 1 rules applied. Total rules applied 1003 place count 80 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1004 place count 80 transition count 723
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1010 place count 80 transition count 717
Applied a total of 1010 rules in 266 ms. Remains 80 /660 variables (removed 580) and now considering 717/2241 (removed 1524) transitions.
[2023-03-20 13:33:13] [INFO ] Flow matrix only has 711 transitions (discarded 6 similar events)
// Phase 1: matrix 711 rows 80 cols
[2023-03-20 13:33:13] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-20 13:33:13] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-20 13:33:13] [INFO ] Flow matrix only has 711 transitions (discarded 6 similar events)
[2023-03-20 13:33:13] [INFO ] Invariant cache hit.
[2023-03-20 13:33:13] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:33:13] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-20 13:33:13] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 13:33:13] [INFO ] Flow matrix only has 711 transitions (discarded 6 similar events)
[2023-03-20 13:33:13] [INFO ] Invariant cache hit.
[2023-03-20 13:33:14] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/660 places, 717/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1312 ms. Remains : 80/660 places, 717/2241 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s39 1), p2:(EQ s31 1), p0:(AND (EQ s7 1) (EQ s20 1) (EQ s33 1) (EQ s45 1) (EQ s60 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 117 steps with 36 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-06 finished in 1454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 51 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2023-03-20 13:33:14] [INFO ] Computed 7 place invariants in 20 ms
[2023-03-20 13:33:14] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-20 13:33:14] [INFO ] Invariant cache hit.
[2023-03-20 13:33:16] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2023-03-20 13:33:16] [INFO ] Invariant cache hit.
[2023-03-20 13:33:19] [INFO ] Dead Transitions using invariants and state equation in 2832 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5361 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s88 1), p1:(NEQ s468 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1409 steps with 12 reset in 7 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-07 finished in 5549 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||(F((F(G(p2))&&X(p2)&&p1))&&p3))))'
Support contains 15 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 69 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
[2023-03-20 13:33:19] [INFO ] Invariant cache hit.
[2023-03-20 13:33:20] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-20 13:33:20] [INFO ] Invariant cache hit.
[2023-03-20 13:33:21] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2023-03-20 13:33:21] [INFO ] Invariant cache hit.
[2023-03-20 13:33:23] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3617 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s45 1) (EQ s151 1) (EQ s257 1) (EQ s341 1) (EQ s469 1) (EQ s575 1)), p3:(EQ s250 0), p1:(AND (EQ s45 1) (EQ s140 1) (EQ s246 1) (EQ s352 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-08 finished in 3841 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(p0) U G(p1))) U G(X((X(F(p2))&&G(p0))))))'
Support contains 17 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 42 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
[2023-03-20 13:33:23] [INFO ] Invariant cache hit.
[2023-03-20 13:33:24] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-20 13:33:24] [INFO ] Invariant cache hit.
[2023-03-20 13:33:25] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2023-03-20 13:33:25] [INFO ] Invariant cache hit.
[2023-03-20 13:33:27] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4106 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s129 1) (EQ s246 1) (EQ s341 1) (EQ s447 1) (EQ s575 1)), p1:(AND (EQ s45 1) (EQ s129 1) (EQ s235 1) (EQ s363 1) (EQ s469 1) (EQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-09 finished in 4543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(G(p1)||F(G(p2)))))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 658 transition count 2239
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 2239
Applied a total of 4 rules in 81 ms. Remains 658 /660 variables (removed 2) and now considering 2239/2241 (removed 2) transitions.
// Phase 1: matrix 2239 rows 658 cols
[2023-03-20 13:33:28] [INFO ] Computed 7 place invariants in 31 ms
[2023-03-20 13:33:29] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-20 13:33:29] [INFO ] Invariant cache hit.
[2023-03-20 13:33:31] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2754 ms to find 0 implicit places.
[2023-03-20 13:33:31] [INFO ] Invariant cache hit.
[2023-03-20 13:33:33] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 658/660 places, 2239/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5232 ms. Remains : 658/660 places, 2239/2241 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s576 1), p1:(EQ s523 1), p2:(EQ s83 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-10 finished in 5440 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)&&(X(p1)||(p1&&X(p2)))) U X(G(!p1))))'
Support contains 13 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 46 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2023-03-20 13:33:33] [INFO ] Computed 7 place invariants in 21 ms
[2023-03-20 13:33:34] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-20 13:33:34] [INFO ] Invariant cache hit.
[2023-03-20 13:33:35] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
[2023-03-20 13:33:35] [INFO ] Invariant cache hit.
[2023-03-20 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 2344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4506 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 294 ms :[p1, (AND p1 (NOT p0)), false, p1, false, true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(EQ s631 1), p0:(AND (EQ s59 1) (EQ s165 1) (EQ s282 1) (EQ s377 1) (EQ s505 1) (EQ s611 1)), p2:(AND (EQ s98 1) (EQ s203 1) (EQ s309 1) (EQ s415 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-11 finished in 4828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Graph (trivial) has 675 edges and 660 vertex of which 102 / 660 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 394 place count 575 transition count 1751
Reduce places removed 393 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 405 rules applied. Total rules applied 799 place count 182 transition count 1739
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 806 place count 176 transition count 1738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 807 place count 175 transition count 1738
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 807 place count 175 transition count 1714
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 855 place count 151 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 862 place count 144 transition count 1707
Iterating global reduction 4 with 7 rules applied. Total rules applied 869 place count 144 transition count 1707
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 929 place count 114 transition count 1677
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 953 place count 90 transition count 329
Iterating global reduction 4 with 24 rules applied. Total rules applied 977 place count 90 transition count 329
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 989 place count 90 transition count 317
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 995 place count 84 transition count 305
Iterating global reduction 5 with 6 rules applied. Total rules applied 1001 place count 84 transition count 305
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1007 place count 78 transition count 293
Iterating global reduction 5 with 6 rules applied. Total rules applied 1013 place count 78 transition count 293
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1033 place count 68 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1034 place count 67 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 1035 place count 67 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1036 place count 67 transition count 287
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1042 place count 67 transition count 281
Applied a total of 1042 rules in 235 ms. Remains 67 /660 variables (removed 593) and now considering 281/2241 (removed 1960) transitions.
[2023-03-20 13:33:38] [INFO ] Flow matrix only has 274 transitions (discarded 7 similar events)
// Phase 1: matrix 274 rows 67 cols
[2023-03-20 13:33:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-20 13:33:38] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-20 13:33:38] [INFO ] Flow matrix only has 274 transitions (discarded 7 similar events)
[2023-03-20 13:33:38] [INFO ] Invariant cache hit.
[2023-03-20 13:33:39] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:33:39] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-20 13:33:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:33:39] [INFO ] Flow matrix only has 274 transitions (discarded 7 similar events)
[2023-03-20 13:33:39] [INFO ] Invariant cache hit.
[2023-03-20 13:33:39] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/660 places, 281/2241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 67/660 places, 281/2241 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 67720 steps with 6339 reset in 184 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-13 finished in 1143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||(G(p1)&&F(p2))))'
Support contains 8 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2241/2241 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2237
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2237
Applied a total of 8 rules in 43 ms. Remains 656 /660 variables (removed 4) and now considering 2237/2241 (removed 4) transitions.
// Phase 1: matrix 2237 rows 656 cols
[2023-03-20 13:33:39] [INFO ] Computed 7 place invariants in 19 ms
[2023-03-20 13:33:40] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-20 13:33:40] [INFO ] Invariant cache hit.
[2023-03-20 13:33:42] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2023-03-20 13:33:42] [INFO ] Invariant cache hit.
[2023-03-20 13:33:44] [INFO ] Dead Transitions using invariants and state equation in 2243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2237/2241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4695 ms. Remains : 656/660 places, 2237/2241 transitions.
Stuttering acceptance computed with spot in 450 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 10}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 12}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 11}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 12}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 11}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p1 p2), acceptance={} source=9 dest: 5}, { cond=(NOT p1), acceptance={} source=9 dest: 7}], [{ cond=(AND p1 p2), acceptance={0} source=10 dest: 6}, { cond=(NOT p1), acceptance={0} source=10 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0} source=10 dest: 10}], [{ cond=true, acceptance={} source=11 dest: 12}], [{ cond=(NOT p0), acceptance={} source=12 dest: 8}]], initial=9, aps=[p1:(OR (EQ s34 0) (EQ s129 0) (EQ s235 0) (EQ s352 0) (EQ s458 0) (EQ s564 0)), p2:(EQ s230 1), p0:(EQ s375 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06b-LTLFireability-14 finished in 5171 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)||G(p1)||G(p2)))'
[2023-03-20 13:33:45] [INFO ] Flatten gal took : 144 ms
[2023-03-20 13:33:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 13:33:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 660 places, 2241 transitions and 19780 arcs took 37 ms.
Total runtime 117016 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyElection-PT-06b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLFireability

FORMULA StigmergyElection-PT-06b-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679319326402

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 StigmergyElection-PT-06b-LTLFireability-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 1/32 StigmergyElection-PT-06b-LTLFireability-02 56646 m, 11329 m/sec, 174276 t fired, .

Time elapsed: 6 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 1/32 StigmergyElection-PT-06b-LTLFireability-02 124463 m, 13563 m/sec, 399671 t fired, .

Time elapsed: 11 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 2/32 StigmergyElection-PT-06b-LTLFireability-02 187766 m, 12660 m/sec, 579451 t fired, .

Time elapsed: 16 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 2/32 StigmergyElection-PT-06b-LTLFireability-02 240454 m, 10537 m/sec, 797179 t fired, .

Time elapsed: 21 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 2/32 StigmergyElection-PT-06b-LTLFireability-02 297926 m, 11494 m/sec, 997888 t fired, .

Time elapsed: 26 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3599 3/32 StigmergyElection-PT-06b-LTLFireability-02 370603 m, 14535 m/sec, 1282789 t fired, .

Time elapsed: 31 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3599 3/32 StigmergyElection-PT-06b-LTLFireability-02 447695 m, 15418 m/sec, 1535765 t fired, .

Time elapsed: 36 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3599 4/32 StigmergyElection-PT-06b-LTLFireability-02 500542 m, 10569 m/sec, 1765408 t fired, .

Time elapsed: 41 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3599 4/32 StigmergyElection-PT-06b-LTLFireability-02 563685 m, 12628 m/sec, 1994306 t fired, .

Time elapsed: 46 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3599 5/32 StigmergyElection-PT-06b-LTLFireability-02 624351 m, 12133 m/sec, 2177116 t fired, .

Time elapsed: 51 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3599 5/32 StigmergyElection-PT-06b-LTLFireability-02 678023 m, 10734 m/sec, 2388312 t fired, .

Time elapsed: 56 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3599 5/32 StigmergyElection-PT-06b-LTLFireability-02 731071 m, 10609 m/sec, 2630639 t fired, .

Time elapsed: 61 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3599 6/32 StigmergyElection-PT-06b-LTLFireability-02 791008 m, 11987 m/sec, 2883795 t fired, .

Time elapsed: 66 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3599 6/32 StigmergyElection-PT-06b-LTLFireability-02 844758 m, 10750 m/sec, 3109369 t fired, .

Time elapsed: 71 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3599 7/32 StigmergyElection-PT-06b-LTLFireability-02 913926 m, 13833 m/sec, 3380770 t fired, .

Time elapsed: 76 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3599 7/32 StigmergyElection-PT-06b-LTLFireability-02 967171 m, 10649 m/sec, 3621451 t fired, .

Time elapsed: 81 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3599 7/32 StigmergyElection-PT-06b-LTLFireability-02 1026970 m, 11959 m/sec, 3891735 t fired, .

Time elapsed: 86 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3599 8/32 StigmergyElection-PT-06b-LTLFireability-02 1070752 m, 8756 m/sec, 4062438 t fired, .

Time elapsed: 91 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
StigmergyElection-PT-06b-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3599 8/32 StigmergyElection-PT-06b-LTLFireability-02 1145358 m, 14921 m/sec, 4366176 t fired, .

Time elapsed: 96 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for StigmergyElection-PT-06b-LTLFireability-02
lola: result : false
lola: markings : 1211978
lola: fired transitions : 4649071
lola: time used : 99.000000
lola: memory pages used : 9
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyElection-PT-06b-LTLFireability-02: LTL false LTL model checker


Time elapsed: 100 secs. Pages in use: 9

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="StigmergyElection-PT-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is StigmergyElection-PT-06b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r455-smll-167912647600628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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