Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821200653.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 15K Apr 29 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 29 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.0M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652822918718

Running Version 202205111006
[2022-05-17 21:28:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 21:28:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:28:40] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2022-05-17 21:28:40] [INFO ] Transformed 2952 places.
[2022-05-17 21:28:40] [INFO ] Transformed 4255 transitions.
[2022-05-17 21:28:40] [INFO ] Parsed PT model containing 2952 places and 4255 transitions in 415 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 3983 out of 4255 initially.
// Phase 1: matrix 3983 rows 2952 cols
[2022-05-17 21:28:40] [INFO ] Computed 421 place invariants in 233 ms
Incomplete random walk after 10000 steps, including 468 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :2
[2022-05-17 21:28:41] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2022-05-17 21:28:41] [INFO ] Computed 421 place invariants in 113 ms
[2022-05-17 21:28:41] [INFO ] [Real]Absence check using 42 positive place invariants in 48 ms returned sat
[2022-05-17 21:28:41] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2022-05-17 21:28:42] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2022-05-17 21:28:42] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 114 ms returned sat
[2022-05-17 21:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:28:43] [INFO ] [Real]Absence check using state equation in 1361 ms returned sat
[2022-05-17 21:28:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:28:44] [INFO ] [Nat]Absence check using 42 positive place invariants in 39 ms returned sat
[2022-05-17 21:28:44] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 103 ms returned sat
[2022-05-17 21:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:28:45] [INFO ] [Nat]Absence check using state equation in 1546 ms returned sat
[2022-05-17 21:28:45] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:28:45] [INFO ] [Nat]Added 1090 Read/Feed constraints in 72 ms returned unsat
[2022-05-17 21:28:46] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2022-05-17 21:28:46] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 115 ms returned unsat
[2022-05-17 21:28:46] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2022-05-17 21:28:46] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 115 ms returned unsat
[2022-05-17 21:28:47] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2022-05-17 21:28:47] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 113 ms returned unsat
[2022-05-17 21:28:47] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2022-05-17 21:28:47] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 113 ms returned sat
[2022-05-17 21:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:28:49] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2022-05-17 21:28:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:28:49] [INFO ] [Nat]Absence check using 42 positive place invariants in 34 ms returned sat
[2022-05-17 21:28:49] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 106 ms returned sat
[2022-05-17 21:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:28:51] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2022-05-17 21:28:51] [INFO ] [Nat]Added 1090 Read/Feed constraints in 77 ms returned unsat
[2022-05-17 21:28:51] [INFO ] [Real]Absence check using 42 positive place invariants in 34 ms returned sat
[2022-05-17 21:28:51] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 114 ms returned unsat
[2022-05-17 21:28:52] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2022-05-17 21:28:52] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned sat
[2022-05-17 21:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:28:53] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2022-05-17 21:28:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:28:53] [INFO ] [Nat]Absence check using 42 positive place invariants in 40 ms returned sat
[2022-05-17 21:28:54] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 136 ms returned sat
[2022-05-17 21:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:28:55] [INFO ] [Nat]Absence check using state equation in 1708 ms returned sat
[2022-05-17 21:28:55] [INFO ] [Nat]Added 1090 Read/Feed constraints in 159 ms returned sat
[2022-05-17 21:28:58] [INFO ] Deduced a trap composed of 532 places in 2044 ms of which 8 ms to minimize.
[2022-05-17 21:28:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2382 ms
[2022-05-17 21:28:58] [INFO ] Computed and/alt/rep : 3608/6090/3608 causal constraints (skipped 358 transitions) in 226 ms.
[2022-05-17 21:29:01] [INFO ] Deduced a trap composed of 2 places in 2340 ms of which 8 ms to minimize.
[2022-05-17 21:29:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-17 21:29:01] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2022-05-17 21:29:01] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 113 ms returned unsat
[2022-05-17 21:29:01] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2022-05-17 21:29:01] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned unsat
[2022-05-17 21:29:02] [INFO ] [Real]Absence check using 42 positive place invariants in 35 ms returned sat
[2022-05-17 21:29:02] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 111 ms returned unsat
[2022-05-17 21:29:02] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2022-05-17 21:29:02] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 114 ms returned sat
[2022-05-17 21:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:04] [INFO ] [Real]Absence check using state equation in 1493 ms returned sat
[2022-05-17 21:29:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:29:04] [INFO ] [Nat]Absence check using 42 positive place invariants in 33 ms returned sat
[2022-05-17 21:29:04] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned sat
[2022-05-17 21:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:06] [INFO ] [Nat]Absence check using state equation in 1626 ms returned sat
[2022-05-17 21:29:06] [INFO ] [Nat]Added 1090 Read/Feed constraints in 434 ms returned unsat
[2022-05-17 21:29:07] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2022-05-17 21:29:07] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 111 ms returned sat
[2022-05-17 21:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:08] [INFO ] [Real]Absence check using state equation in 1350 ms returned sat
[2022-05-17 21:29:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:29:08] [INFO ] [Nat]Absence check using 42 positive place invariants in 31 ms returned sat
[2022-05-17 21:29:09] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned sat
[2022-05-17 21:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:10] [INFO ] [Nat]Absence check using state equation in 1632 ms returned sat
[2022-05-17 21:29:10] [INFO ] [Nat]Added 1090 Read/Feed constraints in 107 ms returned unsat
[2022-05-17 21:29:11] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2022-05-17 21:29:11] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 108 ms returned unsat
[2022-05-17 21:29:11] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2022-05-17 21:29:11] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2022-05-17 21:29:11] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2022-05-17 21:29:11] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1] Max seen :[1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.18 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 545 place count 2928 transition count 3711
Reduce places removed 544 places and 0 transitions.
Iterating post reduction 1 with 544 rules applied. Total rules applied 1089 place count 2384 transition count 3711
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 1089 place count 2384 transition count 3643
Deduced a syphon composed of 68 places in 6 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 1225 place count 2316 transition count 3643
Discarding 476 places :
Symmetric choice reduction at 2 with 476 rule applications. Total rules 1701 place count 1840 transition count 3167
Iterating global reduction 2 with 476 rules applied. Total rules applied 2177 place count 1840 transition count 3167
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2177 place count 1840 transition count 3163
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2185 place count 1836 transition count 3163
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 2423 place count 1598 transition count 2687
Iterating global reduction 2 with 238 rules applied. Total rules applied 2661 place count 1598 transition count 2687
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 2695 place count 1581 transition count 2670
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2855 place count 1581 transition count 2748
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 3015 place count 1421 transition count 2748
Applied a total of 3015 rules in 1370 ms. Remains 1421 /2952 variables (removed 1531) and now considering 2748/4255 (removed 1507) transitions.
Finished structural reductions, in 1 iterations. Remains : 1421/2952 places, 2748/4255 transitions.
Normalized transition count is 2350 out of 2748 initially.
// Phase 1: matrix 2350 rows 1421 cols
[2022-05-17 21:29:13] [INFO ] Computed 397 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 76189 resets, run finished after 7729 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12966 resets, run finished after 1902 ms. (steps per millisecond=525 ) properties (out of 1) seen :0
[2022-05-17 21:29:23] [INFO ] Flow matrix only has 2350 transitions (discarded 398 similar events)
// Phase 1: matrix 2350 rows 1421 cols
[2022-05-17 21:29:23] [INFO ] Computed 397 place invariants in 48 ms
[2022-05-17 21:29:23] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2022-05-17 21:29:23] [INFO ] [Real]Absence check using 33 positive and 364 generalized place invariants in 61 ms returned sat
[2022-05-17 21:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:23] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2022-05-17 21:29:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:29:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2022-05-17 21:29:24] [INFO ] [Nat]Absence check using 33 positive and 364 generalized place invariants in 63 ms returned sat
[2022-05-17 21:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:24] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2022-05-17 21:29:24] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:29:25] [INFO ] [Nat]Added 1090 Read/Feed constraints in 136 ms returned sat
[2022-05-17 21:29:25] [INFO ] Deduced a trap composed of 183 places in 715 ms of which 6 ms to minimize.
[2022-05-17 21:29:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 886 ms
[2022-05-17 21:29:26] [INFO ] Computed and/alt/rep : 1472/2796/1472 causal constraints (skipped 861 transitions) in 145 ms.
[2022-05-17 21:29:26] [INFO ] Added : 8 causal constraints over 2 iterations in 576 ms. Result :sat
Minimization took 378 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1421/1421 places, 2748/2748 transitions.
Applied a total of 0 rules in 83 ms. Remains 1421 /1421 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1421/1421 places, 2748/2748 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1421/1421 places, 2748/2748 transitions.
Applied a total of 0 rules in 73 ms. Remains 1421 /1421 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2022-05-17 21:29:27] [INFO ] Flow matrix only has 2350 transitions (discarded 398 similar events)
// Phase 1: matrix 2350 rows 1421 cols
[2022-05-17 21:29:27] [INFO ] Computed 397 place invariants in 28 ms
[2022-05-17 21:29:29] [INFO ] Implicit Places using invariants in 2075 ms returned [4, 7, 9, 10, 11, 15, 21, 29, 39, 51, 65, 80, 94, 95, 96, 108, 118, 126, 132, 136, 138, 145, 151, 153, 154, 155, 157, 161, 167, 175, 185, 197, 210, 222, 223, 224, 234, 242, 248, 252, 254, 256, 263, 269, 271, 272, 273, 275, 277, 281, 287, 295, 305, 316, 326, 327, 328, 336, 342, 346, 348, 350, 352, 359, 365, 367, 368, 369, 371, 373, 375, 379, 385, 393, 402, 410, 411, 412, 418, 422, 424, 426, 428, 430, 437, 443, 445, 446, 447, 449, 451, 453, 455, 459, 465, 472, 478, 479, 480, 484, 486, 488, 490, 492, 494, 501, 507, 509, 510, 511, 513, 515, 517, 519, 521, 525, 530, 534, 535, 536, 538, 540, 542, 544, 546, 548, 555, 561, 563, 564, 565, 567, 569, 571, 573, 575, 577, 580, 582, 583, 584, 586, 588, 590, 592, 594, 596, 603, 609, 611, 612, 613, 615, 617, 619, 621, 623, 625, 627, 629, 630, 631, 633, 635, 637, 639, 641, 643, 650, 652, 655, 657, 658, 659, 661, 663, 665, 667, 669, 671, 673, 675, 676, 677, 679, 681, 683, 685, 687, 689, 696, 702, 704, 705, 706, 708, 710, 712, 714, 716, 718, 720, 722, 723, 724, 726, 728, 730, 732, 734, 736, 743, 749, 751, 752, 753, 755, 757, 759, 761, 763, 765, 767, 770, 771, 772, 774, 776, 778, 780, 782, 784, 791, 797, 799, 800, 801, 803, 805, 807, 809, 811, 813, 817, 822, 823, 824, 828, 830, 832, 834, 836, 838, 845, 851, 853, 854, 855, 857, 859, 861, 863, 865, 869, 875, 882, 883, 884, 890, 894, 896, 898, 900, 902, 909, 915, 917, 918, 919, 921, 923, 925, 927, 931, 937, 945, 954, 955, 956, 964, 970, 974, 976, 978, 980, 987, 993, 995, 996, 997, 999, 1001, 1003, 1007, 1013, 1021, 1031, 1042, 1043, 1044, 1054, 1062, 1068, 1072, 1074, 1076, 1083, 1089, 1091, 1092, 1093, 1095, 1097, 1101, 1107, 1115, 1125, 1137, 1150, 1151, 1152, 1164, 1174, 1182, 1188, 1192, 1194, 1201, 1203, 1206, 1208, 1209, 1210, 1212, 1216, 1222, 1230, 1240, 1252, 1266, 1281, 1282, 1283, 1297, 1309, 1319, 1327, 1333, 1337, 1344]
Discarding 360 places :
Implicit Place search using SMT only with invariants took 2089 ms to find 360 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1061/1421 places, 2748/2748 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 997 transition count 2684
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 997 transition count 2684
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 192 place count 933 transition count 2620
Iterating global reduction 0 with 64 rules applied. Total rules applied 256 place count 933 transition count 2620
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 259 place count 933 transition count 2617
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 262 place count 930 transition count 2617
Applied a total of 262 rules in 159 ms. Remains 930 /1061 variables (removed 131) and now considering 2617/2748 (removed 131) transitions.
[2022-05-17 21:29:29] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:29:29] [INFO ] Computed 37 place invariants in 29 ms
[2022-05-17 21:29:30] [INFO ] Implicit Places using invariants in 884 ms returned []
[2022-05-17 21:29:30] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:29:30] [INFO ] Computed 37 place invariants in 23 ms
[2022-05-17 21:29:30] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:29:41] [INFO ] Implicit Places using invariants and state equation in 11231 ms returned []
Implicit Place search using SMT with State Equation took 12119 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 930/1421 places, 2617/2748 transitions.
Finished structural reductions, in 2 iterations. Remains : 930/1421 places, 2617/2748 transitions.
Normalized transition count is 2219 out of 2617 initially.
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:29:41] [INFO ] Computed 37 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 83163 resets, run finished after 7617 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7742 resets, run finished after 1280 ms. (steps per millisecond=781 ) properties (out of 1) seen :0
[2022-05-17 21:29:50] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:29:50] [INFO ] Computed 37 place invariants in 23 ms
[2022-05-17 21:29:50] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 21:29:50] [INFO ] [Real]Absence check using 31 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:51] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2022-05-17 21:29:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:29:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 21:29:51] [INFO ] [Nat]Absence check using 31 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:29:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:29:51] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-05-17 21:29:51] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:29:51] [INFO ] [Nat]Added 1090 Read/Feed constraints in 260 ms returned sat
[2022-05-17 21:29:52] [INFO ] Deduced a trap composed of 124 places in 354 ms of which 2 ms to minimize.
[2022-05-17 21:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2022-05-17 21:29:52] [INFO ] Computed and/alt/rep : 1326/1904/1326 causal constraints (skipped 831 transitions) in 130 ms.
[2022-05-17 21:29:52] [INFO ] Added : 4 causal constraints over 1 iterations in 368 ms. Result :sat
Minimization took 344 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 930 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 930/930 places, 2617/2617 transitions.
Applied a total of 0 rules in 56 ms. Remains 930 /930 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 930/930 places, 2617/2617 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 930/930 places, 2617/2617 transitions.
Applied a total of 0 rules in 56 ms. Remains 930 /930 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
[2022-05-17 21:29:53] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:29:53] [INFO ] Computed 37 place invariants in 33 ms
[2022-05-17 21:29:54] [INFO ] Implicit Places using invariants in 886 ms returned []
[2022-05-17 21:29:54] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:29:54] [INFO ] Computed 37 place invariants in 19 ms
[2022-05-17 21:29:54] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:30:04] [INFO ] Implicit Places using invariants and state equation in 10496 ms returned []
Implicit Place search using SMT with State Equation took 11390 ms to find 0 implicit places.
[2022-05-17 21:30:04] [INFO ] Redundant transitions in 155 ms returned []
[2022-05-17 21:30:04] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:04] [INFO ] Computed 37 place invariants in 21 ms
[2022-05-17 21:30:05] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 930/930 places, 2617/2617 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07
Normalized transition count is 2219 out of 2617 initially.
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:05] [INFO ] Computed 37 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 831 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2022-05-17 21:30:05] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:05] [INFO ] Computed 37 place invariants in 21 ms
[2022-05-17 21:30:06] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2022-05-17 21:30:06] [INFO ] [Real]Absence check using 31 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:30:06] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-05-17 21:30:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:30:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 21:30:06] [INFO ] [Nat]Absence check using 31 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:30:07] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-05-17 21:30:07] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:30:07] [INFO ] [Nat]Added 1090 Read/Feed constraints in 268 ms returned sat
[2022-05-17 21:30:07] [INFO ] Deduced a trap composed of 124 places in 362 ms of which 1 ms to minimize.
[2022-05-17 21:30:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 477 ms
[2022-05-17 21:30:08] [INFO ] Computed and/alt/rep : 1326/1904/1326 causal constraints (skipped 831 transitions) in 114 ms.
[2022-05-17 21:30:08] [INFO ] Added : 4 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 930 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 930/930 places, 2617/2617 transitions.
Applied a total of 0 rules in 64 ms. Remains 930 /930 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 930/930 places, 2617/2617 transitions.
Normalized transition count is 2219 out of 2617 initially.
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:08] [INFO ] Computed 37 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 83176 resets, run finished after 7605 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7744 resets, run finished after 1267 ms. (steps per millisecond=789 ) properties (out of 1) seen :0
[2022-05-17 21:30:17] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:17] [INFO ] Computed 37 place invariants in 25 ms
[2022-05-17 21:30:17] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-17 21:30:17] [INFO ] [Real]Absence check using 31 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:30:18] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2022-05-17 21:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:30:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-17 21:30:18] [INFO ] [Nat]Absence check using 31 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 21:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:30:18] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2022-05-17 21:30:18] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:30:19] [INFO ] [Nat]Added 1090 Read/Feed constraints in 256 ms returned sat
[2022-05-17 21:30:19] [INFO ] Deduced a trap composed of 124 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 472 ms
[2022-05-17 21:30:19] [INFO ] Computed and/alt/rep : 1326/1904/1326 causal constraints (skipped 831 transitions) in 130 ms.
[2022-05-17 21:30:19] [INFO ] Added : 4 causal constraints over 1 iterations in 361 ms. Result :sat
Minimization took 349 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 930 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 930/930 places, 2617/2617 transitions.
Applied a total of 0 rules in 61 ms. Remains 930 /930 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 930/930 places, 2617/2617 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 930/930 places, 2617/2617 transitions.
Applied a total of 0 rules in 54 ms. Remains 930 /930 variables (removed 0) and now considering 2617/2617 (removed 0) transitions.
[2022-05-17 21:30:20] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:20] [INFO ] Computed 37 place invariants in 25 ms
[2022-05-17 21:30:21] [INFO ] Implicit Places using invariants in 870 ms returned []
[2022-05-17 21:30:21] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:21] [INFO ] Computed 37 place invariants in 23 ms
[2022-05-17 21:30:21] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-17 21:30:32] [INFO ] Implicit Places using invariants and state equation in 11043 ms returned []
Implicit Place search using SMT with State Equation took 11922 ms to find 0 implicit places.
[2022-05-17 21:30:32] [INFO ] Redundant transitions in 124 ms returned []
[2022-05-17 21:30:32] [INFO ] Flow matrix only has 2219 transitions (discarded 398 similar events)
// Phase 1: matrix 2219 rows 930 cols
[2022-05-17 21:30:32] [INFO ] Computed 37 place invariants in 24 ms
[2022-05-17 21:30:33] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 930/930 places, 2617/2617 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 in 27732 ms.
[2022-05-17 21:30:33] [INFO ] Flatten gal took : 224 ms
[2022-05-17 21:30:34] [INFO ] Applying decomposition
[2022-05-17 21:30:34] [INFO ] Flatten gal took : 165 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14190788391742484039.txt' '-o' '/tmp/graph14190788391742484039.bin' '-w' '/tmp/graph14190788391742484039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14190788391742484039.bin' '-l' '-1' '-v' '-w' '/tmp/graph14190788391742484039.weights' '-q' '0' '-e' '0.001'
[2022-05-17 21:30:34] [INFO ] Decomposing Gal with order
[2022-05-17 21:30:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:30:35] [INFO ] Removed a total of 3363 redundant transitions.
[2022-05-17 21:30:35] [INFO ] Flatten gal took : 825 ms
[2022-05-17 21:30:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2305 labels/synchronizations in 193 ms.
[2022-05-17 21:30:35] [INFO ] Time to serialize gal into /tmp/UpperBounds3634879721668448462.gal : 55 ms
[2022-05-17 21:30:35] [INFO ] Time to serialize properties into /tmp/UpperBounds8507699321814599186.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3634879721668448462.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8507699321814599186.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds8507699321814599186.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,10407,154.785,2766608,49140,43614,1.92504e+06,399864,5191,1.48096e+07,1076,1.08915e+06,0
Total reachable state count : 10407

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 :0 <= u112.Node16ThinksNode10ShouldBeNodeMasterToReplaceNode9 <= 0
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07,0,156.476,2766608,1,0,1.92504e+06,399864,5794,1.48096e+07,1153,1.08915e+06,27837
Total runtime 272853 ms.

BK_STOP 1652823192791

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="MultiCrashLeafsetExtension-PT-S16C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C02, 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 r132-tall-165271821200653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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