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.r042-tajo-167813695700413.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 marciexred
Input is BugTracking-PT-q8m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695700413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 08:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 07:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 07:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q8m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678721615765

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 15:33:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 15:33:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:33:38] [INFO ] Load time of PNML (sax parser for PT used): 1034 ms
[2023-03-13 15:33:38] [INFO ] Transformed 754 places.
[2023-03-13 15:33:38] [INFO ] Transformed 27370 transitions.
[2023-03-13 15:33:38] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 121 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 15:33:39] [INFO ] Computed 10 place invariants in 54 ms
Incomplete random walk after 10012 steps, including 29 resets, run finished after 110 ms. (steps per millisecond=91 ) properties (out of 5) seen :11
FORMULA BugTracking-PT-q8m016-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m016-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :6
[2023-03-13 15:33:39] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 15:33:39] [INFO ] Computed 10 place invariants in 57 ms
[2023-03-13 15:33:39] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 15:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:40] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2023-03-13 15:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:33:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 15:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:40] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-13 15:33:40] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 15:33:41] [INFO ] [Nat]Added 303 Read/Feed constraints in 67 ms returned sat
[2023-03-13 15:33:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 384 ms.
[2023-03-13 15:33:42] [INFO ] Deduced a trap composed of 64 places in 440 ms of which 7 ms to minimize.
[2023-03-13 15:33:43] [INFO ] Deduced a trap composed of 62 places in 634 ms of which 2 ms to minimize.
[2023-03-13 15:33:44] [INFO ] Deduced a trap composed of 61 places in 576 ms of which 2 ms to minimize.
[2023-03-13 15:33:44] [INFO ] Deduced a trap composed of 38 places in 537 ms of which 3 ms to minimize.
[2023-03-13 15:33:45] [INFO ] Deduced a trap composed of 38 places in 360 ms of which 1 ms to minimize.
[2023-03-13 15:33:45] [INFO ] Deduced a trap composed of 48 places in 411 ms of which 1 ms to minimize.
[2023-03-13 15:33:45] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
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-13 15:33:45] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 15:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:46] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2023-03-13 15:33:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:33:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-13 15:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:47] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2023-03-13 15:33:47] [INFO ] [Nat]Added 303 Read/Feed constraints in 197 ms returned sat
[2023-03-13 15:33:48] [INFO ] Deduced a trap composed of 19 places in 414 ms of which 1 ms to minimize.
[2023-03-13 15:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 722 ms
[2023-03-13 15:33:48] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 339 ms.
[2023-03-13 15:33:49] [INFO ] Added : 8 causal constraints over 2 iterations in 1082 ms. Result :sat
[2023-03-13 15:33:49] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 15:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:50] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-03-13 15:33:50] [INFO ] [Real]Added 303 Read/Feed constraints in 63 ms returned sat
[2023-03-13 15:33:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:33:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 15:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:33:50] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2023-03-13 15:33:51] [INFO ] [Nat]Added 303 Read/Feed constraints in 113 ms returned sat
[2023-03-13 15:33:51] [INFO ] Deduced a trap composed of 78 places in 538 ms of which 1 ms to minimize.
[2023-03-13 15:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 741 ms
[2023-03-13 15:33:52] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 356 ms.
[2023-03-13 15:33:52] [INFO ] Added : 2 causal constraints over 1 iterations in 806 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 16] Max seen :[0, 0, 9]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 278 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 278 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 276 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 276 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 270 transition count 3871
Applied a total of 19 rules in 376 ms. Remains 270 /280 variables (removed 10) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 270/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:33:53] [INFO ] Computed 9 place invariants in 35 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 2458 ms. (steps per millisecond=406 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2047 ms. (steps per millisecond=488 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1990 ms. (steps per millisecond=502 ) properties (out of 3) seen :7
[2023-03-13 15:34:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:34:02] [INFO ] Computed 9 place invariants in 48 ms
[2023-03-13 15:34:02] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 15:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:03] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2023-03-13 15:34:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-13 15:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:04] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-13 15:34:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 298 ms returned sat
[2023-03-13 15:34:05] [INFO ] Deduced a trap composed of 23 places in 420 ms of which 1 ms to minimize.
[2023-03-13 15:34:05] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 1 ms to minimize.
[2023-03-13 15:34:05] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 0 ms to minimize.
[2023-03-13 15:34:06] [INFO ] Deduced a trap composed of 63 places in 459 ms of which 1 ms to minimize.
[2023-03-13 15:34:06] [INFO ] Deduced a trap composed of 60 places in 446 ms of which 0 ms to minimize.
[2023-03-13 15:34:07] [INFO ] Deduced a trap composed of 61 places in 396 ms of which 0 ms to minimize.
[2023-03-13 15:34:07] [INFO ] Deduced a trap composed of 26 places in 371 ms of which 1 ms to minimize.
[2023-03-13 15:34:08] [INFO ] Deduced a trap composed of 62 places in 442 ms of which 1 ms to minimize.
[2023-03-13 15:34:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3954 ms
[2023-03-13 15:34:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 362 ms.
[2023-03-13 15:34:09] [INFO ] Added : 1 causal constraints over 1 iterations in 802 ms. Result :sat
[2023-03-13 15:34:09] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-13 15:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:10] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2023-03-13 15:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 15:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:10] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2023-03-13 15:34:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 159 ms returned sat
[2023-03-13 15:34:11] [INFO ] Deduced a trap composed of 35 places in 479 ms of which 1 ms to minimize.
[2023-03-13 15:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 683 ms
[2023-03-13 15:34:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 326 ms.
[2023-03-13 15:34:12] [INFO ] Added : 2 causal constraints over 1 iterations in 747 ms. Result :sat
[2023-03-13 15:34:12] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-13 15:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:13] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-13 15:34:13] [INFO ] [Real]Added 283 Read/Feed constraints in 71 ms returned sat
[2023-03-13 15:34:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 15:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:14] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2023-03-13 15:34:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 94 ms returned sat
[2023-03-13 15:34:14] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 0 ms to minimize.
[2023-03-13 15:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 527 ms
[2023-03-13 15:34:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 238 ms.
[2023-03-13 15:34:15] [INFO ] Added : 2 causal constraints over 1 iterations in 610 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 16] Max seen :[0, 0, 9]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 176 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 176 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:34:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:15] [INFO ] Invariant cache hit.
[2023-03-13 15:34:16] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-13 15:34:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:16] [INFO ] Invariant cache hit.
[2023-03-13 15:34:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:18] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2903 ms to find 0 implicit places.
[2023-03-13 15:34:19] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-13 15:34:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:19] [INFO ] Invariant cache hit.
[2023-03-13 15:34:20] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4439 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:34:20] [INFO ] Computed 9 place invariants in 10 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 15:34:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:34:20] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-13 15:34:20] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 15:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:20] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-13 15:34:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-13 15:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:21] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2023-03-13 15:34:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 213 ms returned sat
[2023-03-13 15:34:22] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 0 ms to minimize.
[2023-03-13 15:34:22] [INFO ] Deduced a trap composed of 54 places in 358 ms of which 1 ms to minimize.
[2023-03-13 15:34:22] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 1 ms to minimize.
[2023-03-13 15:34:23] [INFO ] Deduced a trap composed of 63 places in 415 ms of which 1 ms to minimize.
[2023-03-13 15:34:23] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 1 ms to minimize.
[2023-03-13 15:34:24] [INFO ] Deduced a trap composed of 61 places in 311 ms of which 0 ms to minimize.
[2023-03-13 15:34:24] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 0 ms to minimize.
[2023-03-13 15:34:25] [INFO ] Deduced a trap composed of 62 places in 405 ms of which 0 ms to minimize.
[2023-03-13 15:34:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3605 ms
[2023-03-13 15:34:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 256 ms.
[2023-03-13 15:34:26] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 2 ms to minimize.
[2023-03-13 15:34:26] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
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:733)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Graph (complete) has 4586 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 75 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:34:26] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 2293 ms. (steps per millisecond=436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1565 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
[2023-03-13 15:34:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:34:30] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-13 15:34:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:31] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-13 15:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:31] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2023-03-13 15:34:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 69 ms returned sat
[2023-03-13 15:34:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 365 ms.
[2023-03-13 15:34:33] [INFO ] Deduced a trap composed of 96 places in 514 ms of which 1 ms to minimize.
[2023-03-13 15:34:34] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 1 ms to minimize.
[2023-03-13 15:34:34] [INFO ] Deduced a trap composed of 53 places in 404 ms of which 1 ms to minimize.
[2023-03-13 15:34:35] [INFO ] Deduced a trap composed of 14 places in 440 ms of which 1 ms to minimize.
[2023-03-13 15:34:35] [INFO ] Deduced a trap composed of 94 places in 413 ms of which 1 ms to minimize.
[2023-03-13 15:34:36] [INFO ] Deduced a trap composed of 45 places in 428 ms of which 1 ms to minimize.
[2023-03-13 15:34:36] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 2 ms to minimize.
[2023-03-13 15:34:37] [INFO ] Deduced a trap composed of 92 places in 423 ms of which 4 ms to minimize.
[2023-03-13 15:34:38] [INFO ] Deduced a trap composed of 90 places in 409 ms of which 1 ms to minimize.
[2023-03-13 15:34:38] [INFO ] Deduced a trap composed of 55 places in 378 ms of which 0 ms to minimize.
[2023-03-13 15:34:39] [INFO ] Deduced a trap composed of 48 places in 377 ms of which 0 ms to minimize.
[2023-03-13 15:34:39] [INFO ] Deduced a trap composed of 54 places in 460 ms of which 0 ms to minimize.
[2023-03-13 15:34:40] [INFO ] Deduced a trap composed of 35 places in 390 ms of which 0 ms to minimize.
[2023-03-13 15:34:40] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 0 ms to minimize.
[2023-03-13 15:34:41] [INFO ] Deduced a trap composed of 41 places in 468 ms of which 0 ms to minimize.
[2023-03-13 15:34:42] [INFO ] Deduced a trap composed of 54 places in 537 ms of which 0 ms to minimize.
[2023-03-13 15:34:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9491 ms
[2023-03-13 15:34:43] [INFO ] Added : 9 causal constraints over 4 iterations in 11001 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:34:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:43] [INFO ] Invariant cache hit.
[2023-03-13 15:34:43] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-13 15:34:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:43] [INFO ] Invariant cache hit.
[2023-03-13 15:34:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:45] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2023-03-13 15:34:45] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-13 15:34:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:45] [INFO ] Invariant cache hit.
[2023-03-13 15:34:47] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3839 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-11 in 26938 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:34:47] [INFO ] Computed 9 place invariants in 19 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 15:34:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:34:47] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-13 15:34:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 15:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:47] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-13 15:34:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 15:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:48] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-13 15:34:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:48] [INFO ] [Nat]Added 283 Read/Feed constraints in 143 ms returned sat
[2023-03-13 15:34:48] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 1 ms to minimize.
[2023-03-13 15:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 445 ms
[2023-03-13 15:34:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2023-03-13 15:34:49] [INFO ] Added : 2 causal constraints over 1 iterations in 555 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Graph (complete) has 4586 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 63 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:34:49] [INFO ] Computed 8 place invariants in 31 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 3975 ms. (steps per millisecond=251 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1969 ms. (steps per millisecond=507 ) properties (out of 1) seen :0
[2023-03-13 15:34:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 15:34:55] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-13 15:34:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 15:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:56] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-13 15:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:34:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 15:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:34:56] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2023-03-13 15:34:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:34:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 149 ms returned sat
[2023-03-13 15:34:57] [INFO ] Deduced a trap composed of 36 places in 402 ms of which 1 ms to minimize.
[2023-03-13 15:34:57] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 0 ms to minimize.
[2023-03-13 15:34:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1137 ms
[2023-03-13 15:34:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 331 ms.
[2023-03-13 15:34:58] [INFO ] Added : 2 causal constraints over 1 iterations in 758 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 109 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 76 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:34:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:59] [INFO ] Invariant cache hit.
[2023-03-13 15:34:59] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-13 15:34:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:34:59] [INFO ] Invariant cache hit.
[2023-03-13 15:35:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:35:01] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2023-03-13 15:35:01] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-13 15:35:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:35:01] [INFO ] Invariant cache hit.
[2023-03-13 15:35:02] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3758 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-12 in 15742 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:35:02] [INFO ] Computed 9 place invariants in 10 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :6
[2023-03-13 15:35:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:35:02] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-13 15:35:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 15:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:03] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2023-03-13 15:35:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:35:03] [INFO ] [Real]Added 283 Read/Feed constraints in 88 ms returned sat
[2023-03-13 15:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:35:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 15:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:04] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-13 15:35:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 75 ms returned sat
[2023-03-13 15:35:05] [INFO ] Deduced a trap composed of 16 places in 744 ms of which 1 ms to minimize.
[2023-03-13 15:35:05] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 1 ms to minimize.
[2023-03-13 15:35:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1350 ms
[2023-03-13 15:35:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2023-03-13 15:35:06] [INFO ] Added : 2 causal constraints over 1 iterations in 549 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[6]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 124 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 270/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:35:06] [INFO ] Computed 9 place invariants in 19 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 2304 ms. (steps per millisecond=434 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties (out of 1) seen :4
[2023-03-13 15:35:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-13 15:35:10] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-13 15:35:11] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-13 15:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:11] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-13 15:35:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:35:11] [INFO ] [Real]Added 283 Read/Feed constraints in 80 ms returned sat
[2023-03-13 15:35:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:35:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-13 15:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:35:12] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2023-03-13 15:35:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 90 ms returned sat
[2023-03-13 15:35:13] [INFO ] Deduced a trap composed of 16 places in 441 ms of which 1 ms to minimize.
[2023-03-13 15:35:13] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 1 ms to minimize.
[2023-03-13 15:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1104 ms
[2023-03-13 15:35:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 276 ms.
[2023-03-13 15:35:14] [INFO ] Added : 2 causal constraints over 1 iterations in 736 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[6]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 86 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 137 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 15:35:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:35:15] [INFO ] Invariant cache hit.
[2023-03-13 15:35:15] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-13 15:35:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:35:15] [INFO ] Invariant cache hit.
[2023-03-13 15:35:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 15:35:17] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
[2023-03-13 15:35:17] [INFO ] Redundant transitions in 153 ms returned []
[2023-03-13 15:35:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 15:35:17] [INFO ] Invariant cache hit.
[2023-03-13 15:35:18] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3907 ms. Remains : 270/270 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-13 in 16034 ms.
[2023-03-13 15:35:19] [INFO ] Flatten gal took : 286 ms
[2023-03-13 15:35:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 15:35:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 3871 transitions and 19051 arcs took 17 ms.
Total runtime 101889 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BugTracking_PT_q8
(NrP: 270 NrTr: 3871 NrArc: 19051)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.088sec

net check time: 0m 0.003sec

init dd package: 0m 2.963sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10566228 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081324 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.058sec

6286 14013 20446 27784 33447 38093 43142 46914 50881 52767 55473 58397 61797 62049 65403 69161 74007 78029 76537 105274 130014 136959 150137 150650 166148 162601 163085 164020 161447

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="BugTracking-PT-q8m016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q8m016, 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 r042-tajo-167813695700413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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