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.r459-smll-167912651300470.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 smartxred
Input is StigmergyCommit-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651300470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 10:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:12 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 3.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679361075389

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 01:11:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 01:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 01:11:19] [INFO ] Load time of PNML (sax parser for PT used): 961 ms
[2023-03-21 01:11:19] [INFO ] Transformed 2140 places.
[2023-03-21 01:11:19] [INFO ] Transformed 6760 transitions.
[2023-03-21 01:11:19] [INFO ] Found NUPN structural information;
[2023-03-21 01:11:19] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 1173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 78 resets, run finished after 875 ms. (steps per millisecond=11 ) properties (out of 15) seen :2
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 6760 rows 2140 cols
[2023-03-21 01:11:22] [INFO ] Computed 8 place invariants in 198 ms
[2023-03-21 01:11:24] [INFO ] After 1814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-21 01:11:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2023-03-21 01:11:33] [INFO ] After 7615ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :7
[2023-03-21 01:11:39] [INFO ] Deduced a trap composed of 401 places in 5099 ms of which 18 ms to minimize.
[2023-03-21 01:11:45] [INFO ] Deduced a trap composed of 400 places in 4988 ms of which 3 ms to minimize.
[2023-03-21 01:11:49] [INFO ] Deduced a trap composed of 402 places in 4221 ms of which 3 ms to minimize.
[2023-03-21 01:11:49] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 15338 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 01:11:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 01:11:49] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 382 ms.
Support contains 100 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 1946 edges and 2140 vertex of which 127 / 2140 are part of one of the 19 SCC in 22 ms
Free SCC test removed 108 places
Drop transitions removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 3348 edges and 2032 vertex of which 2018 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.71 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1419 transitions
Trivial Post-agglo rules discarded 1419 transitions
Performed 1419 trivial Post agglomeration. Transition count delta: 1419
Iterating post reduction 0 with 1426 rules applied. Total rules applied 1428 place count 2018 transition count 5189
Reduce places removed 1419 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 1452 rules applied. Total rules applied 2880 place count 599 transition count 5156
Reduce places removed 13 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 2 with 80 rules applied. Total rules applied 2960 place count 586 transition count 5089
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 69 rules applied. Total rules applied 3029 place count 519 transition count 5087
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3030 place count 518 transition count 5087
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 79 Pre rules applied. Total rules applied 3030 place count 518 transition count 5008
Deduced a syphon composed of 79 places in 7 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 3188 place count 439 transition count 5008
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 3250 place count 377 transition count 4946
Iterating global reduction 5 with 62 rules applied. Total rules applied 3312 place count 377 transition count 4946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3312 place count 377 transition count 4945
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3314 place count 376 transition count 4945
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 3339 place count 351 transition count 1104
Iterating global reduction 5 with 25 rules applied. Total rules applied 3364 place count 351 transition count 1104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3372 place count 351 transition count 1096
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3376 place count 347 transition count 1092
Iterating global reduction 6 with 4 rules applied. Total rules applied 3380 place count 347 transition count 1092
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3384 place count 343 transition count 1088
Iterating global reduction 6 with 4 rules applied. Total rules applied 3388 place count 343 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3390 place count 343 transition count 1086
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 3446 place count 315 transition count 1058
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3452 place count 309 transition count 1052
Iterating global reduction 7 with 6 rules applied. Total rules applied 3458 place count 309 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3462 place count 305 transition count 1048
Iterating global reduction 7 with 4 rules applied. Total rules applied 3466 place count 305 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3469 place count 302 transition count 1045
Iterating global reduction 7 with 3 rules applied. Total rules applied 3472 place count 302 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3474 place count 301 transition count 1048
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 3481 place count 301 transition count 1041
Free-agglomeration rule applied 59 times.
Iterating global reduction 7 with 59 rules applied. Total rules applied 3540 place count 301 transition count 982
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 3599 place count 242 transition count 982
Drop transitions removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 8 with 119 rules applied. Total rules applied 3718 place count 242 transition count 863
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3722 place count 242 transition count 863
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3725 place count 242 transition count 860
Applied a total of 3725 rules in 1668 ms. Remains 242 /2140 variables (removed 1898) and now considering 860/6760 (removed 5900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1669 ms. Remains : 242/2140 places, 860/6760 transitions.
Incomplete random walk after 10000 steps, including 422 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 7) seen :2
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 860 rows 242 cols
[2023-03-21 01:11:52] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-21 01:11:52] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 01:11:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-21 01:11:52] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 01:11:52] [INFO ] State equation strengthened by 491 read => feed constraints.
[2023-03-21 01:11:53] [INFO ] After 596ms SMT Verify possible using 491 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 01:11:54] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 1 ms to minimize.
[2023-03-21 01:11:54] [INFO ] Deduced a trap composed of 34 places in 553 ms of which 2 ms to minimize.
[2023-03-21 01:11:55] [INFO ] Deduced a trap composed of 35 places in 517 ms of which 1 ms to minimize.
[2023-03-21 01:11:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1715 ms
[2023-03-21 01:11:55] [INFO ] Deduced a trap composed of 53 places in 513 ms of which 1 ms to minimize.
[2023-03-21 01:11:56] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 1 ms to minimize.
[2023-03-21 01:11:56] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 0 ms to minimize.
[2023-03-21 01:11:57] [INFO ] Deduced a trap composed of 50 places in 441 ms of which 1 ms to minimize.
[2023-03-21 01:11:57] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 2 ms to minimize.
[2023-03-21 01:11:58] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 1 ms to minimize.
[2023-03-21 01:11:58] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2023-03-21 01:11:58] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 1 ms to minimize.
[2023-03-21 01:11:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3314 ms
[2023-03-21 01:11:59] [INFO ] Deduced a trap composed of 51 places in 400 ms of which 1 ms to minimize.
[2023-03-21 01:11:59] [INFO ] Deduced a trap composed of 46 places in 395 ms of which 1 ms to minimize.
[2023-03-21 01:12:00] [INFO ] Deduced a trap composed of 45 places in 379 ms of which 1 ms to minimize.
[2023-03-21 01:12:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1345 ms
[2023-03-21 01:12:00] [INFO ] Deduced a trap composed of 40 places in 395 ms of which 1 ms to minimize.
[2023-03-21 01:12:01] [INFO ] Deduced a trap composed of 42 places in 385 ms of which 0 ms to minimize.
[2023-03-21 01:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 901 ms
[2023-03-21 01:12:01] [INFO ] Deduced a trap composed of 43 places in 498 ms of which 1 ms to minimize.
[2023-03-21 01:12:02] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 0 ms to minimize.
[2023-03-21 01:12:02] [INFO ] Deduced a trap composed of 48 places in 323 ms of which 1 ms to minimize.
[2023-03-21 01:12:02] [INFO ] Deduced a trap composed of 46 places in 355 ms of which 0 ms to minimize.
[2023-03-21 01:12:03] [INFO ] Deduced a trap composed of 53 places in 416 ms of which 1 ms to minimize.
[2023-03-21 01:12:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2265 ms
[2023-03-21 01:12:03] [INFO ] After 10487ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-21 01:12:03] [INFO ] After 11465ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 64 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 860/860 transitions.
Graph (trivial) has 68 edges and 242 vertex of which 4 / 242 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 240 transition count 828
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 212 transition count 826
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 210 transition count 826
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 61 place count 210 transition count 822
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 69 place count 206 transition count 822
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 74 place count 201 transition count 817
Iterating global reduction 3 with 5 rules applied. Total rules applied 79 place count 201 transition count 817
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 200 transition count 816
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 200 transition count 816
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 95 place count 193 transition count 809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 193 transition count 808
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 100 place count 189 transition count 804
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 189 transition count 804
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 188 transition count 803
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 188 transition count 803
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 187 transition count 802
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 187 transition count 802
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 125 place count 187 transition count 785
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 135 place count 187 transition count 775
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 145 place count 177 transition count 775
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 151 place count 171 transition count 769
Iterating global reduction 5 with 6 rules applied. Total rules applied 157 place count 171 transition count 769
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 171 transition count 769
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 171 transition count 768
Applied a total of 160 rules in 314 ms. Remains 171 /242 variables (removed 71) and now considering 768/860 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 171/242 places, 768/860 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 33 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 33 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 768 rows 171 cols
[2023-03-21 01:12:04] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-21 01:12:04] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 01:12:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 01:12:05] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:05] [INFO ] State equation strengthened by 593 read => feed constraints.
[2023-03-21 01:12:05] [INFO ] After 510ms SMT Verify possible using 593 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:06] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 1 ms to minimize.
[2023-03-21 01:12:06] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 1 ms to minimize.
[2023-03-21 01:12:06] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2023-03-21 01:12:07] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 1 ms to minimize.
[2023-03-21 01:12:07] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 1 ms to minimize.
[2023-03-21 01:12:07] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 0 ms to minimize.
[2023-03-21 01:12:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2232 ms
[2023-03-21 01:12:08] [INFO ] Deduced a trap composed of 24 places in 320 ms of which 1 ms to minimize.
[2023-03-21 01:12:08] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 1 ms to minimize.
[2023-03-21 01:12:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2023-03-21 01:12:09] [INFO ] Deduced a trap composed of 47 places in 348 ms of which 0 ms to minimize.
[2023-03-21 01:12:09] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 1 ms to minimize.
[2023-03-21 01:12:10] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 1 ms to minimize.
[2023-03-21 01:12:10] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 1 ms to minimize.
[2023-03-21 01:12:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1650 ms
[2023-03-21 01:12:10] [INFO ] After 5689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 552 ms.
[2023-03-21 01:12:11] [INFO ] After 6685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 48 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 768/768 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 171 transition count 755
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 158 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 157 transition count 754
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 28 place count 157 transition count 751
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 34 place count 154 transition count 751
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 151 transition count 748
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 151 transition count 748
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 150 transition count 747
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 150 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 150 transition count 746
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 53 place count 145 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 145 transition count 740
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 60 place count 139 transition count 734
Iterating global reduction 5 with 6 rules applied. Total rules applied 66 place count 139 transition count 734
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 70 place count 135 transition count 730
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 135 transition count 730
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 134 transition count 729
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 134 transition count 729
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 133 transition count 732
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 82 place count 133 transition count 728
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 133 transition count 726
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 87 place count 131 transition count 725
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 89 place count 131 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 131 transition count 724
Applied a total of 90 rules in 279 ms. Remains 131 /171 variables (removed 40) and now considering 724/768 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 131/171 places, 724/768 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 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 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 634750 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634750 steps, saw 104701 distinct states, run finished after 3003 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 724 rows 131 cols
[2023-03-21 01:12:15] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-21 01:12:15] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 01:12:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-21 01:12:15] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:15] [INFO ] State equation strengthened by 576 read => feed constraints.
[2023-03-21 01:12:15] [INFO ] After 323ms SMT Verify possible using 576 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:16] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 2 ms to minimize.
[2023-03-21 01:12:16] [INFO ] Deduced a trap composed of 21 places in 345 ms of which 1 ms to minimize.
[2023-03-21 01:12:17] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 1 ms to minimize.
[2023-03-21 01:12:17] [INFO ] Deduced a trap composed of 22 places in 356 ms of which 1 ms to minimize.
[2023-03-21 01:12:17] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 1 ms to minimize.
[2023-03-21 01:12:18] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 1 ms to minimize.
[2023-03-21 01:12:18] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 1 ms to minimize.
[2023-03-21 01:12:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2713 ms
[2023-03-21 01:12:18] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 0 ms to minimize.
[2023-03-21 01:12:19] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2023-03-21 01:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2023-03-21 01:12:19] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 1 ms to minimize.
[2023-03-21 01:12:19] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 0 ms to minimize.
[2023-03-21 01:12:20] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 0 ms to minimize.
[2023-03-21 01:12:20] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 3 ms to minimize.
[2023-03-21 01:12:20] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 0 ms to minimize.
[2023-03-21 01:12:21] [INFO ] Deduced a trap composed of 28 places in 311 ms of which 1 ms to minimize.
[2023-03-21 01:12:21] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 0 ms to minimize.
[2023-03-21 01:12:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2219 ms
[2023-03-21 01:12:21] [INFO ] After 6097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-21 01:12:21] [INFO ] After 6779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 48 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 724/724 transitions.
Applied a total of 0 rules in 48 ms. Remains 131 /131 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 131/131 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 724/724 transitions.
Applied a total of 0 rules in 45 ms. Remains 131 /131 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-21 01:12:21] [INFO ] Invariant cache hit.
[2023-03-21 01:12:22] [INFO ] Implicit Places using invariants in 202 ms returned [130]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/131 places, 724/724 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 0 with 5 rules applied. Total rules applied 5 place count 130 transition count 719
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 125 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 122 transition count 716
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 16 place count 122 transition count 711
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 117 transition count 711
Performed 20 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 66 place count 97 transition count 599
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 83 place count 97 transition count 582
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 95 transition count 294
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 95 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 94 transition count 295
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 112 place count 94 transition count 272
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 94 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 92 transition count 270
Applied a total of 116 rules in 88 ms. Remains 92 /130 variables (removed 38) and now considering 270/724 (removed 454) transitions.
// Phase 1: matrix 270 rows 92 cols
[2023-03-21 01:12:22] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-21 01:12:22] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-21 01:12:22] [INFO ] Invariant cache hit.
[2023-03-21 01:12:22] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-21 01:12:22] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 92/131 places, 270/724 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 738 ms. Remains : 92/131 places, 270/724 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 940469 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 940469 steps, saw 137223 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 01:12:26] [INFO ] Invariant cache hit.
[2023-03-21 01:12:26] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 01:12:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-21 01:12:26] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:26] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-21 01:12:26] [INFO ] After 117ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:26] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-21 01:12:26] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 4 ms to minimize.
[2023-03-21 01:12:26] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-21 01:12:26] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-21 01:12:26] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2023-03-21 01:12:27] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2023-03-21 01:12:27] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-03-21 01:12:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 825 ms
[2023-03-21 01:12:27] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-21 01:12:27] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-21 01:12:27] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-21 01:12:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 409 ms
[2023-03-21 01:12:27] [INFO ] After 1439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-21 01:12:27] [INFO ] After 1749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 48 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 270/270 transitions.
Applied a total of 0 rules in 15 ms. Remains 92 /92 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 92/92 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 270/270 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-21 01:12:27] [INFO ] Invariant cache hit.
[2023-03-21 01:12:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-21 01:12:27] [INFO ] Invariant cache hit.
[2023-03-21 01:12:28] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-21 01:12:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-21 01:12:28] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-21 01:12:28] [INFO ] Invariant cache hit.
[2023-03-21 01:12:28] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 92/92 places, 270/270 transitions.
Graph (trivial) has 7 edges and 92 vertex of which 2 / 92 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 9 ms. Remains 91 /92 variables (removed 1) and now considering 268/270 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 268 rows 91 cols
[2023-03-21 01:12:28] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-21 01:12:28] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 01:12:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-21 01:12:28] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 01:12:28] [INFO ] After 69ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:29] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-21 01:12:29] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 01:12:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-21 01:12:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 270 transitions and 2542 arcs took 6 ms.
[2023-03-21 01:12:29] [INFO ] Flatten gal took : 131 ms
Total runtime 70935 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 06b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 92 places, 270 transitions, 2542 arcs.
Final Score: 2111.9
Took : 49 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-06b-ReachabilityCardinality-10 (reachable & potential(( ( ( (tk(P40)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) ) & ( ( ( ( (tk(P17)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P17)) ) ) | ( ( (tk(P20)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P20)) ) ) ) & ( ( ( (tk(P85)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P85)) ) ) | ( ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) & ( ( ( (tk(P10)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P10)) ) ) & ( ( ( (tk(P69)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P69)) ) ) | ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) ) ) ) ) ) )))
PROPERTY: StigmergyCommit-PT-06b-ReachabilityCardinality-13 (reachable &!potential( ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) | ( ( ( (tk(P83)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P83)) ) ) & ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) ) )))
PROPERTY: StigmergyCommit-PT-06b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) | ( ( ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) & ( ( (tk(P35)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P35)) ) ) ) & ( ( ( (tk(P53)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P53)) ) ) & ( ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) & ( ( (tk(P70)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P70)) ) ) ) ) ) & ( ( ( ( (tk(P87)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P87)) ) ) & ( ( ( ( (tk(P76)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P76)) ) ) | ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) ) & ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) | ( ( ( ( (tk(P88)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P88)) ) ) & ( ( (tk(P45)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P45)) ) ) ) | ( ( ( ( (tk(P39)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P39)) ) ) & ( ( (tk(P3)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P3)) ) ) ) & ( ( ( (tk(P82)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P82)) ) ) & ( ( ( (tk(P23)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P23)) ) ) | ( ( (tk(P79)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P79)) ) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) | ( ( (tk(P37)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P37)) ) ) ) | ( ( ( (tk(P68)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P68)) ) ) | ( ( ( (tk(P73)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P73)) ) ) | ( ( ( (tk(P29)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P29)) ) ) & ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) ) ) ) ) & ( ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) | ( ( ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) & ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) ) & ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) & ( ( ( (tk(P19)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P19)) ) ) | ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P12)) ) ) ) ) ) ) & ( ( ( ( (tk(P14)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P14)) ) ) | ( ( ( (tk(P59)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P59)) ) ) | ( ( (tk(P77)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P77)) ) ) ) ) | ( ( ( (tk(P67)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P67)) ) ) | ( ( ( (tk(P25)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P25)) ) ) | ( ( ( (tk(P32)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P32)) ) ) & ( ( (tk(P56)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P56)) ) ) ) ) ) ) ) ) ) ) )))
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679361200559

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-06b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r459-smll-167912651300470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;