Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978200469.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d2m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679318124013

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:15:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 13:15:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:15:26] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2023-03-20 13:15:26] [INFO ] Transformed 2398 places.
[2023-03-20 13:15:26] [INFO ] Transformed 1954 transitions.
[2023-03-20 13:15:26] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 1984 places in 29 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 13:15:26] [INFO ] Computed 6 place invariants in 83 ms
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 938 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
[2023-03-20 13:15:27] [INFO ] Invariant cache hit.
[2023-03-20 13:15:27] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-20 13:15:27] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:27] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-20 13:15:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:15:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:15:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:28] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-20 13:15:28] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 13:15:29] [INFO ] [Nat]Added 1674 Read/Feed constraints in 661 ms returned sat
[2023-03-20 13:15:30] [INFO ] Deduced a trap composed of 115 places in 1119 ms of which 5 ms to minimize.
[2023-03-20 13:15:30] [INFO ] Deduced a trap composed of 135 places in 402 ms of which 1 ms to minimize.
[2023-03-20 13:15:31] [INFO ] Deduced a trap composed of 105 places in 763 ms of which 1 ms to minimize.
[2023-03-20 13:15:31] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 2 ms to minimize.
[2023-03-20 13:15:32] [INFO ] Deduced a trap composed of 141 places in 236 ms of which 1 ms to minimize.
[2023-03-20 13:15:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3658 ms
[2023-03-20 13:15:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 13:15:32] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2023-03-20 13:15:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:33] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-20 13:15:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:15:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:33] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-20 13:15:34] [INFO ] [Nat]Added 1674 Read/Feed constraints in 528 ms returned sat
[2023-03-20 13:15:34] [INFO ] Deduced a trap composed of 90 places in 498 ms of which 1 ms to minimize.
[2023-03-20 13:15:35] [INFO ] Deduced a trap composed of 98 places in 353 ms of which 1 ms to minimize.
[2023-03-20 13:15:35] [INFO ] Deduced a trap composed of 197 places in 396 ms of which 13 ms to minimize.
[2023-03-20 13:15:36] [INFO ] Deduced a trap composed of 244 places in 292 ms of which 1 ms to minimize.
[2023-03-20 13:15:36] [INFO ] Deduced a trap composed of 250 places in 282 ms of which 1 ms to minimize.
[2023-03-20 13:15:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2488 ms
[2023-03-20 13:15:37] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 456 ms.
[2023-03-20 13:15:38] [INFO ] Added : 14 causal constraints over 4 iterations in 1395 ms. Result :sat
Minimization took 139 ms.
[2023-03-20 13:15:38] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-20 13:15:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:39] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-20 13:15:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-20 13:15:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 13:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:39] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-20 13:15:40] [INFO ] [Nat]Added 1674 Read/Feed constraints in 622 ms returned sat
[2023-03-20 13:15:40] [INFO ] Deduced a trap composed of 113 places in 262 ms of which 1 ms to minimize.
[2023-03-20 13:15:40] [INFO ] Deduced a trap composed of 112 places in 166 ms of which 1 ms to minimize.
[2023-03-20 13:15:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 699 ms
[2023-03-20 13:15:41] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 285 ms.
[2023-03-20 13:15:42] [INFO ] Added : 14 causal constraints over 3 iterations in 1152 ms. Result :sat
Minimization took 649 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 12] Max seen :[0, 0, 0]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 389 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.7 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 792 transitions
Reduce isomorphic transitions removed 794 transitions.
Iterating post reduction 0 with 794 rules applied. Total rules applied 795 place count 389 transition count 1160
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 913 place count 271 transition count 374
Iterating global reduction 1 with 118 rules applied. Total rules applied 1031 place count 271 transition count 374
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1040 place count 271 transition count 365
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1133 place count 178 transition count 272
Iterating global reduction 2 with 93 rules applied. Total rules applied 1226 place count 178 transition count 272
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1262 place count 178 transition count 236
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1301 place count 139 transition count 182
Iterating global reduction 3 with 39 rules applied. Total rules applied 1340 place count 139 transition count 182
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1364 place count 139 transition count 158
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1373 place count 130 transition count 145
Iterating global reduction 4 with 9 rules applied. Total rules applied 1382 place count 130 transition count 145
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1391 place count 121 transition count 136
Iterating global reduction 4 with 9 rules applied. Total rules applied 1400 place count 121 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1405 place count 116 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 1410 place count 116 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1412 place count 116 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1417 place count 111 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1422 place count 111 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1424 place count 109 transition count 121
Iterating global reduction 5 with 2 rules applied. Total rules applied 1426 place count 109 transition count 121
Applied a total of 1426 rules in 134 ms. Remains 109 /414 variables (removed 305) and now considering 121/1954 (removed 1833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 109/414 places, 121/1954 transitions.
// Phase 1: matrix 121 rows 109 cols
[2023-03-20 13:15:43] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224445 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103356 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103612 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103269 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 3) seen :0
[2023-03-20 13:15:46] [INFO ] Invariant cache hit.
[2023-03-20 13:15:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:46] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-20 13:15:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:46] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-20 13:15:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:15:46] [INFO ] [Nat]Added 47 Read/Feed constraints in 26 ms returned sat
[2023-03-20 13:15:46] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 9 ms.
[2023-03-20 13:15:46] [INFO ] Added : 19 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 41 ms.
[2023-03-20 13:15:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:46] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-20 13:15:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:46] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-20 13:15:46] [INFO ] [Nat]Added 47 Read/Feed constraints in 15 ms returned sat
[2023-03-20 13:15:46] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 9 ms.
[2023-03-20 13:15:46] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 26 ms.
[2023-03-20 13:15:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:15:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:47] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-20 13:15:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:47] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-20 13:15:47] [INFO ] [Nat]Added 47 Read/Feed constraints in 40 ms returned sat
[2023-03-20 13:15:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2023-03-20 13:15:47] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-03-20 13:15:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-20 13:15:47] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 14 ms.
[2023-03-20 13:15:47] [INFO ] Added : 16 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 12] Max seen :[0, 0, 0]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 109/109 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-20 13:15:47] [INFO ] Invariant cache hit.
[2023-03-20 13:15:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 13:15:47] [INFO ] Invariant cache hit.
[2023-03-20 13:15:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:15:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-20 13:15:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:15:47] [INFO ] Invariant cache hit.
[2023-03-20 13:15:48] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 109/109 places, 121/121 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-00
[2023-03-20 13:15:48] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 979 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-20 13:15:48] [INFO ] Invariant cache hit.
[2023-03-20 13:15:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:48] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-20 13:15:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 13:15:48] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:15:48] [INFO ] [Nat]Added 47 Read/Feed constraints in 38 ms returned sat
[2023-03-20 13:15:48] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 13 ms.
[2023-03-20 13:15:48] [INFO ] Added : 19 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Graph (complete) has 308 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 106 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 105 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 105 transition count 116
Applied a total of 9 rules in 20 ms. Remains 105 /109 variables (removed 4) and now considering 116/121 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 105/109 places, 116/121 transitions.
// Phase 1: matrix 116 rows 105 cols
[2023-03-20 13:15:48] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224588 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103016 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 1) seen :0
[2023-03-20 13:15:50] [INFO ] Invariant cache hit.
[2023-03-20 13:15:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:50] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 13:15:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:50] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-20 13:15:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 13:15:50] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2023-03-20 13:15:50] [INFO ] Computed and/alt/rep : 28/73/28 causal constraints (skipped 87 transitions) in 8 ms.
[2023-03-20 13:15:50] [INFO ] Added : 18 causal constraints over 4 iterations in 138 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/105 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 116/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-20 13:15:50] [INFO ] Invariant cache hit.
[2023-03-20 13:15:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 13:15:50] [INFO ] Invariant cache hit.
[2023-03-20 13:15:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 13:15:50] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-20 13:15:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:15:50] [INFO ] Invariant cache hit.
[2023-03-20 13:15:50] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 105/105 places, 116/116 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 in 2840 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
// Phase 1: matrix 121 rows 109 cols
[2023-03-20 13:15:50] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-20 13:15:50] [INFO ] Invariant cache hit.
[2023-03-20 13:15:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:15:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:51] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-20 13:15:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:15:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:51] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-20 13:15:51] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:15:51] [INFO ] [Nat]Added 47 Read/Feed constraints in 11 ms returned sat
[2023-03-20 13:15:51] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 11 ms.
[2023-03-20 13:15:51] [INFO ] Added : 14 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Graph (complete) has 308 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 106 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 101 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 100 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 100 transition count 109
Applied a total of 18 rules in 32 ms. Remains 100 /109 variables (removed 9) and now considering 109/121 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 100/109 places, 109/121 transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-20 13:15:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224596 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102893 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :0
[2023-03-20 13:15:52] [INFO ] Invariant cache hit.
[2023-03-20 13:15:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:15:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:52] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-20 13:15:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-20 13:15:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 13:15:53] [INFO ] [Nat]Added 42 Read/Feed constraints in 6 ms returned sat
[2023-03-20 13:15:53] [INFO ] Computed and/alt/rep : 26/65/26 causal constraints (skipped 82 transitions) in 8 ms.
[2023-03-20 13:15:53] [INFO ] Added : 11 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 100/100 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-20 13:15:53] [INFO ] Invariant cache hit.
[2023-03-20 13:15:53] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 13:15:53] [INFO ] Invariant cache hit.
[2023-03-20 13:15:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 13:15:53] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-20 13:15:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:15:53] [INFO ] Invariant cache hit.
[2023-03-20 13:15:53] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 100/100 places, 109/109 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 in 2702 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
// Phase 1: matrix 121 rows 109 cols
[2023-03-20 13:15:53] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2185 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-20 13:15:53] [INFO ] Invariant cache hit.
[2023-03-20 13:15:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:53] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-20 13:15:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:53] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-20 13:15:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 13:15:53] [INFO ] [Nat]Added 47 Read/Feed constraints in 14 ms returned sat
[2023-03-20 13:15:53] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2023-03-20 13:15:53] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2023-03-20 13:15:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-20 13:15:53] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-20 13:15:54] [INFO ] Added : 16 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 107 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 105 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 103 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 103 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 102 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 101 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 100 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 100 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 99 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 98 transition count 106
Applied a total of 23 rules in 64 ms. Remains 98 /109 variables (removed 11) and now considering 106/121 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 98/109 places, 106/121 transitions.
// Phase 1: matrix 106 rows 98 cols
[2023-03-20 13:15:54] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224219 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103151 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 1) seen :0
[2023-03-20 13:15:55] [INFO ] Invariant cache hit.
[2023-03-20 13:15:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-20 13:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:55] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-20 13:15:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:15:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:15:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:15:55] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-20 13:15:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:15:55] [INFO ] [Nat]Added 40 Read/Feed constraints in 22 ms returned sat
[2023-03-20 13:15:55] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2023-03-20 13:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-20 13:15:56] [INFO ] Computed and/alt/rep : 25/65/25 causal constraints (skipped 80 transitions) in 10 ms.
[2023-03-20 13:15:56] [INFO ] Added : 18 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 21 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-20 13:15:56] [INFO ] Invariant cache hit.
[2023-03-20 13:15:56] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-20 13:15:56] [INFO ] Invariant cache hit.
[2023-03-20 13:15:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 13:15:56] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-20 13:15:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 13:15:56] [INFO ] Invariant cache hit.
[2023-03-20 13:15:56] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 98/98 places, 106/106 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 in 3037 ms.
[2023-03-20 13:15:57] [INFO ] Flatten gal took : 98 ms
[2023-03-20 13:15:57] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-20 13:15:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 121 transitions and 482 arcs took 2 ms.
Total runtime 30957 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/670/ub_0_ --maxsum=/tmp/670/ub_1_ --maxsum=/tmp/670/ub_2_
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679318225191

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name SieveSingleMsgMbox-PT-d2m18-UpperBounds-00
ub formula formula --maxsum=/tmp/670/ub_0_
ub formula name SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
ub formula formula --maxsum=/tmp/670/ub_1_
ub formula name SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
ub formula formula --maxsum=/tmp/670/ub_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 109 places, 121 transitions and 482 arcs
pnml2lts-sym: Petri net SieveSingleMsgMbox_PT_d2m18 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 121->119 groups
pnml2lts-sym: Regrouping took 0.030 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 109; there are 119 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 1106406 group checks and 0 next state calls
pnml2lts-sym: reachability took 45.140 real 178.810 user 1.110 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.120 user 0.000 sys
pnml2lts-sym: state space has 13495396472 states, 59288 nodes
pnml2lts-sym: Maximum sum of /tmp/670/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/670/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/670/ub_2_ is: 1
pnml2lts-sym: group_next: 3696 nodes total
pnml2lts-sym: group_explored: 5117 nodes, 7469 short vectors total
pnml2lts-sym: max token count: 18

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="SieveSingleMsgMbox-PT-d2m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d2m18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978200469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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