Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556100253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is StigmergyElection-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556100253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 413M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 413M May 18 16:43 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-11b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-11b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717131749284

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 05:02:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:02:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:02:44] [INFO ] Load time of PNML (sax parser for PT used): 13491 ms
[2024-05-31 05:02:45] [INFO ] Transformed 1515 places.
[2024-05-31 05:02:46] [INFO ] Transformed 357966 transitions.
[2024-05-31 05:02:46] [INFO ] Found NUPN structural information;
[2024-05-31 05:02:46] [INFO ] Parsed PT model containing 1515 places and 357966 transitions and 7842915 arcs in 15429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 57 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-11b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 357966/357966 transitions.
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 190 place count 1325 transition count 357776
Iterating global reduction 0 with 190 rules applied. Total rules applied 380 place count 1325 transition count 357776
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 481 place count 1224 transition count 357675
Iterating global reduction 0 with 101 rules applied. Total rules applied 582 place count 1224 transition count 357675
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 604 place count 1202 transition count 357653
Iterating global reduction 0 with 22 rules applied. Total rules applied 626 place count 1202 transition count 357653
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 637 place count 1191 transition count 357642
Iterating global reduction 0 with 11 rules applied. Total rules applied 648 place count 1191 transition count 357642
Applied a total of 648 rules in 12444 ms. Remains 1191 /1515 variables (removed 324) and now considering 357642/357966 (removed 324) transitions.
// Phase 1: matrix 357642 rows 1191 cols
[2024-05-31 05:03:15] [INFO ] Computed 12 invariants in 12808 ms
[2024-05-31 05:03:16] [INFO ] Implicit Places using invariants in 14067 ms returned []
Implicit Place search using SMT only with invariants took 14093 ms to find 0 implicit places.
[2024-05-31 05:03:16] [INFO ] Invariant cache hit.
[2024-05-31 05:03:46] [INFO ] Performed 63397/357642 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 05:04:16] [INFO ] Dead Transitions using invariants and state equation in 60309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1191/1515 places, 357642/357966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86882 ms. Remains : 1191/1515 places, 357642/357966 transitions.
Support contains 66 out of 1191 places after structural reductions.
[2024-05-31 05:05:09] [INFO ] Flatten gal took : 45396 ms
[2024-05-31 05:05:52] [INFO ] Flatten gal took : 43551 ms
[2024-05-31 05:07:08] [INFO ] Input system was already deterministic with 357642 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 2875 ms. (steps per millisecond=3 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Interrupted probabilistic random walk after 5062 steps, run timeout after 9012 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 5062 steps, saw 4550 distinct states, run finished after 9013 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 30 properties.
[2024-05-31 05:07:27] [INFO ] Invariant cache hit.
[2024-05-31 05:07:28] [INFO ] [Real]Absence check using 12 positive place invariants in 38 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 05:07:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 05:07:52] [INFO ] After 25101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 66 out of 1191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1191/1191 places, 357642/357642 transitions.
Graph (trivial) has 1157 edges and 1191 vertex of which 187 / 1191 are part of one of the 33 SCC in 73 ms
Free SCC test removed 154 places
Drop transitions removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 3723 edges and 1037 vertex of which 1026 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1842 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 669 transitions
Trivial Post-agglo rules discarded 669 transitions
Performed 669 trivial Post agglomeration. Transition count delta: 669
Iterating post reduction 0 with 680 rules applied. Total rules applied 682 place count 1026 transition count 356753
Reduce places removed 669 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 691 rules applied. Total rules applied 1373 place count 357 transition count 356731
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1384 place count 346 transition count 356731
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1384 place count 346 transition count 356675
Deduced a syphon composed of 56 places in 491 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1496 place count 290 transition count 356675
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1497 place count 290 transition count 356674
Performed 12 Post agglomeration using F-continuation condition.
Performed 16 Post agglomeration using F-continuation condition.
Performed 20 Post agglomeration using F-continuation condition.
Performed 24 Post agglomeration using F-continuation condition.
Performed 28 Post agglomeration using F-continuation condition.
Performed 32 Post agglomeration using F-continuation condition.
Performed 36 Post agglomeration using F-continuation condition.
Performed 40 Post agglomeration using F-continuation condition.
Performed 44 Post agglomeration using F-continuation condition.
Performed 48 Post agglomeration using F-continuation condition.
Performed 52 Post agglomeration using F-continuation condition.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 414 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1609 place count 234 transition count 356618
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1631 place count 234 transition count 356596
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1654 place count 211 transition count 356552
Iterating global reduction 5 with 23 rules applied. Total rules applied 1677 place count 211 transition count 356552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1678 place count 211 transition count 356551
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1689 place count 200 transition count 356540
Iterating global reduction 6 with 11 rules applied. Total rules applied 1700 place count 200 transition count 356540
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 77 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1722 place count 189 transition count 356529
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 77 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1728 place count 186 transition count 356537
Free-agglomeration rule applied 78 times.
Iterating global reduction 6 with 78 rules applied. Total rules applied 1806 place count 186 transition count 356459
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 6 with 78 rules applied. Total rules applied 1884 place count 108 transition count 356459
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1895 place count 97 transition count 356448
Iterating global reduction 7 with 11 rules applied. Total rules applied 1906 place count 97 transition count 356448
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1913 place count 97 transition count 356448
Applied a total of 1913 rules in 635803 ms. Remains 97 /1191 variables (removed 1094) and now considering 356448/357642 (removed 1194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 635814 ms. Remains : 97/1191 places, 356448/357642 transitions.
Computed a total of 165 stabilizing places and 176 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))||(!p1 U (p2||G(!p1))))&&X((G(!p1)||(!p1&&F(p3))))))'
Support contains 27 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 357642/357642 transitions.
Applied a total of 0 rules in 7363 ms. Remains 1191 /1191 variables (removed 0) and now considering 357642/357642 (removed 0) transitions.
[2024-05-31 05:18:41] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] Performed 452/1191 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 05:19:44] [INFO ] Performed 982/1191 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-31 05:19:53] [INFO ] Implicit Places using invariants in 72206 ms returned []
Implicit Place search using SMT only with invariants took 72216 ms to find 0 implicit places.
[2024-05-31 05:19:54] [INFO ] Invariant cache hit.
[2024-05-31 05:20:24] [INFO ] Performed 61794/357642 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-31 05:20:54] [INFO ] Dead Transitions using invariants and state equation in 60371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140051 ms. Remains : 1191/1191 places, 357642/357642 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 675 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p2) p1), true, (AND (NOT p3) p1), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (NOT p3), (AND (NOT p2) p1)]
Running random walk in product with property : StigmergyElection-PT-11b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s86 1) (EQ s192 1) (EQ s276 1) (EQ s404 1) (EQ s488 1) (EQ s594 1) (EQ s700 1) (EQ s828 1) (EQ s934 1) (EQ s1040 1) (EQ s1135 1))) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 42650 steps with 229 reset in 10001 ms.
Product exploration timeout after 45820 steps with 243 reset in 10006 ms.
Computed a total of 165 stabilizing places and 176 stable transitions
Computed a total of 165 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p0)), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 10 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3)]
Interrupted random walk after 6688 steps, including 35 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2848 steps, including 1 resets, run timeout after 5003 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 4534 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 4353 steps, including 2 resets, run timeout after 6794 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 3345 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 1516 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 52772 steps, run timeout after 153008 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 52772 steps, saw 16088 distinct states, run finished after 153010 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 05:24:59] [INFO ] Invariant cache hit.
[2024-05-31 05:24:59] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 05:25:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 05:25:24] [INFO ] After 25059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 1191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1191/1191 places, 357642/357642 transitions.
Graph (trivial) has 1207 edges and 1191 vertex of which 187 / 1191 are part of one of the 33 SCC in 28 ms
Free SCC test removed 154 places
Drop transitions removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Graph (complete) has 3723 edges and 1037 vertex of which 1026 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.824 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 719 transitions
Trivial Post-agglo rules discarded 719 transitions
Performed 719 trivial Post agglomeration. Transition count delta: 719
Iterating post reduction 0 with 730 rules applied. Total rules applied 732 place count 1026 transition count 356703
Reduce places removed 719 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 741 rules applied. Total rules applied 1473 place count 307 transition count 356681
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1484 place count 296 transition count 356681
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1484 place count 296 transition count 356625
Deduced a syphon composed of 56 places in 510 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1596 place count 240 transition count 356625
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1597 place count 240 transition count 356624
Performed 12 Post agglomeration using F-continuation condition.
Performed 16 Post agglomeration using F-continuation condition.
Performed 20 Post agglomeration using F-continuation condition.
Performed 24 Post agglomeration using F-continuation condition.
Performed 28 Post agglomeration using F-continuation condition.
Performed 32 Post agglomeration using F-continuation condition.
Performed 36 Post agglomeration using F-continuation condition.
Performed 40 Post agglomeration using F-continuation condition.
Performed 44 Post agglomeration using F-continuation condition.
Performed 48 Post agglomeration using F-continuation condition.
Performed 52 Post agglomeration using F-continuation condition.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 71 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1709 place count 184 transition count 356568
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1731 place count 184 transition count 356546
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1768 place count 147 transition count 56744
Iterating global reduction 5 with 37 rules applied. Total rules applied 1805 place count 147 transition count 56744
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1820 place count 147 transition count 56729
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1831 place count 136 transition count 56718
Iterating global reduction 6 with 11 rules applied. Total rules applied 1842 place count 136 transition count 56718
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 14 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1864 place count 125 transition count 56707
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1870 place count 122 transition count 56715
Free-agglomeration rule applied 64 times.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1934 place count 122 transition count 56651
Reduce places removed 64 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 73 rules applied. Total rules applied 2007 place count 58 transition count 56642
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2018 place count 47 transition count 56631
Iterating global reduction 7 with 11 rules applied. Total rules applied 2029 place count 47 transition count 56631
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 7 with 2047 rules applied. Total rules applied 4076 place count 47 transition count 54584
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 4083 place count 47 transition count 54584
Applied a total of 4083 rules in 719879 ms. Remains 47 /1191 variables (removed 1144) and now considering 54584/357642 (removed 303058) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719886 ms. Remains : 47/1191 places, 54584/357642 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p3) p0), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p0)), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (G (NOT (AND p1 p3)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p3), (AND (NOT p3) p1), (AND (NOT p3) p1), false, (AND (NOT p3) p1), false, false]
Stuttering acceptance computed with spot in 319 ms :[(NOT p3), (AND (NOT p3) p1), (AND (NOT p3) p1), false, (AND (NOT p3) p1), false, false]
Support contains 16 out of 1191 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 : 1191/1191 places, 357642/357642 transitions.
Graph (trivial) has 1196 edges and 1191 vertex of which 187 / 1191 are part of one of the 33 SCC in 20 ms
Free SCC test removed 154 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 687 place count 1036 transition count 356779
Reduce places removed 686 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 708 rules applied. Total rules applied 1395 place count 350 transition count 356757
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1406 place count 339 transition count 356757
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1406 place count 339 transition count 356712
Deduced a syphon composed of 45 places in 349 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1496 place count 294 transition count 356712
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1506 place count 284 transition count 356702
Iterating global reduction 3 with 10 rules applied. Total rules applied 1516 place count 284 transition count 356702
Performed 11 Post agglomeration using F-continuation condition.
Performed 15 Post agglomeration using F-continuation condition.
Performed 19 Post agglomeration using F-continuation condition.
Performed 23 Post agglomeration using F-continuation condition.
Performed 27 Post agglomeration using F-continuation condition.
Performed 31 Post agglomeration using F-continuation condition.
Performed 35 Post agglomeration using F-continuation condition.
Performed 39 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 47 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 89 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1624 place count 230 transition count 356648
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1654 place count 200 transition count 78137
Iterating global reduction 3 with 30 rules applied. Total rules applied 1684 place count 200 transition count 78137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1692 place count 200 transition count 78129
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1703 place count 189 transition count 78107
Iterating global reduction 4 with 11 rules applied. Total rules applied 1714 place count 189 transition count 78107
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1725 place count 178 transition count 78085
Iterating global reduction 4 with 11 rules applied. Total rules applied 1736 place count 178 transition count 78085
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1766 place count 163 transition count 78092
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1767 place count 162 transition count 78070
Iterating global reduction 4 with 1 rules applied. Total rules applied 1768 place count 162 transition count 78070
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1769 place count 162 transition count 78069
Applied a total of 1769 rules in 585093 ms. Remains 162 /1191 variables (removed 1029) and now considering 78069/357642 (removed 279573) transitions.
[2024-05-31 05:47:10] [INFO ] Flow matrix only has 78057 transitions (discarded 12 similar events)
// Phase 1: matrix 78057 rows 162 cols
[2024-05-31 05:47:12] [INFO ] Computed 2 invariants in 1528 ms
[2024-05-31 05:47:24] [INFO ] Implicit Places using invariants in 13820 ms returned []
Implicit Place search using SMT only with invariants took 13824 ms to find 0 implicit places.
[2024-05-31 05:47:24] [INFO ] Flow matrix only has 78057 transitions (discarded 12 similar events)
[2024-05-31 05:47:24] [INFO ] Invariant cache hit.
[2024-05-31 05:47:49] [INFO ] Dead Transitions using invariants and state equation in 24889 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/1191 places, 78069/357642 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 623814 ms. Remains : 162/1191 places, 78069/357642 transitions.
Computed a total of 8 stabilizing places and 30 stable transitions
Computed a total of 8 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT p3)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p3))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p3), (AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), false, (AND (NOT p3) p1), false]
Incomplete random walk after 10000 steps, including 440 resets, run finished after 2315 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 31578 steps, run timeout after 6002 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 31578 steps, saw 14219 distinct states, run finished after 6003 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 05:47:59] [INFO ] Flow matrix only has 78057 transitions (discarded 12 similar events)
[2024-05-31 05:47:59] [INFO ] Invariant cache hit.
[2024-05-31 05:47:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 05:48:18] [INFO ] After 19209ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 140624 kB
After kill :
MemTotal: 16393232 kB
MemFree: 138408 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is StigmergyElection-PT-11b, 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 r417-tall-171690556100253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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