Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r089-smll-167814408700273.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CloudDeployment-PT-6b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-smll-167814408700273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678272805605

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-08 10:53:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-08 10:53:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:53:29] [INFO ] Load time of PNML (sax parser for PT used): 869 ms
[2023-03-08 10:53:29] [INFO ] Transformed 1888 places.
[2023-03-08 10:53:29] [INFO ] Transformed 6804 transitions.
[2023-03-08 10:53:29] [INFO ] Found NUPN structural information;
[2023-03-08 10:53:29] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 1109 ms.
Graph (trivial) has 1908 edges and 1888 vertex of which 504 / 1888 are part of one of the 48 SCC in 17 ms
Free SCC test removed 456 places
Structural test allowed to assert that 641 places are NOT stable. Took 90 ms.
Ensure Unique test removed 510 transitions
Reduce redundant transitions removed 510 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 1506 ms. (steps per millisecond=6 ) properties (out of 1247) seen :561
Running SMT prover for 686 properties.
[2023-03-08 10:53:31] [INFO ] Flow matrix only has 6247 transitions (discarded 47 similar events)
// Phase 1: matrix 6247 rows 1432 cols
[2023-03-08 10:53:32] [INFO ] Computed 25 place invariants in 273 ms
[2023-03-08 10:53:58] [INFO ] After 24594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:686
[2023-03-08 10:54:21] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 31 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-08 10:54:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 10:54:23] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:686
Fused 686 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 686 out of 1432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 6294/6294 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 396 rules applied. Total rules applied 396 place count 1432 transition count 5898
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 744 place count 1084 transition count 5898
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 744 place count 1084 transition count 5892
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 756 place count 1078 transition count 5892
Discarding 165 places :
Symmetric choice reduction at 2 with 165 rule applications. Total rules 921 place count 913 transition count 5727
Iterating global reduction 2 with 165 rules applied. Total rules applied 1086 place count 913 transition count 5727
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1094 place count 913 transition count 5719
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 9 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1200 place count 860 transition count 5666
Performed 28 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 28 places in 8 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1256 place count 832 transition count 5707
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1261 place count 832 transition count 5702
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1271 place count 827 transition count 5752
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 1307 place count 827 transition count 5716
Free-agglomeration rule applied 65 times with reduction of 13 identical transitions.
Iterating global reduction 4 with 65 rules applied. Total rules applied 1372 place count 827 transition count 5638
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 4 with 175 rules applied. Total rules applied 1547 place count 762 transition count 5528
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1548 place count 762 transition count 5528
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1549 place count 761 transition count 5527
Applied a total of 1549 rules in 1884 ms. Remains 761 /1432 variables (removed 671) and now considering 5527/6294 (removed 767) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1889 ms. Remains : 761/1432 places, 5527/6294 transitions.
Interrupted random walk after 302086 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 103
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 583) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 581) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 581) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 579) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 579) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 577) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 577) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 577) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 575) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 575) seen :0
Running SMT prover for 575 properties.
[2023-03-08 10:54:55] [INFO ] Flow matrix only has 5510 transitions (discarded 17 similar events)
// Phase 1: matrix 5510 rows 761 cols
[2023-03-08 10:54:55] [INFO ] Computed 25 place invariants in 144 ms
[2023-03-08 10:55:14] [INFO ] After 18401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:575
[2023-03-08 10:55:27] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 10:57:15] [INFO ] After 98580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :575
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-08 10:58:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 10:58:59] [INFO ] After 225037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:575
Fused 575 Parikh solutions to 570 different solutions.
Parikh walk visited 124 properties in 7066 ms.
Support contains 451 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 5527/5527 transitions.
Graph (complete) has 3040 edges and 761 vertex of which 757 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.18 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 757 transition count 5413
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 223 place count 647 transition count 5413
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 223 place count 647 transition count 5406
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 237 place count 640 transition count 5406
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 277 place count 600 transition count 5366
Iterating global reduction 2 with 40 rules applied. Total rules applied 317 place count 600 transition count 5366
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 325 place count 600 transition count 5358
Performed 40 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 40 places in 11 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 405 place count 560 transition count 5315
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 455 place count 560 transition count 5265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 461 place count 557 transition count 5270
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 464 place count 557 transition count 5267
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 494 place count 557 transition count 5237
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 500 place count 557 transition count 5231
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 510 place count 551 transition count 5227
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 511 place count 551 transition count 9321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 512 place count 550 transition count 9321
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 513 place count 550 transition count 9321
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 514 place count 550 transition count 9320
Applied a total of 514 rules in 1433 ms. Remains 550 /761 variables (removed 211) and now considering 9320/5527 (removed -3793) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1433 ms. Remains : 550/761 places, 9320/5527 transitions.
Interrupted random walk after 408215 steps, including 5044 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 403
Incomplete Best-First random walk after 100001 steps, including 136 resets, run finished after 803 ms. (steps per millisecond=124 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 139 resets, run finished after 768 ms. (steps per millisecond=130 ) properties (out of 48) seen :2
Incomplete Best-First random walk after 100001 steps, including 142 resets, run finished after 747 ms. (steps per millisecond=133 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 141 resets, run finished after 739 ms. (steps per millisecond=135 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 858 ms. (steps per millisecond=116 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 140 resets, run finished after 840 ms. (steps per millisecond=119 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 133 resets, run finished after 764 ms. (steps per millisecond=130 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 767 ms. (steps per millisecond=130 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 144 resets, run finished after 759 ms. (steps per millisecond=131 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 758 ms. (steps per millisecond=131 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 776 ms. (steps per millisecond=128 ) properties (out of 46) seen :2
Incomplete Best-First random walk after 100000 steps, including 138 resets, run finished after 745 ms. (steps per millisecond=134 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 876 ms. (steps per millisecond=114 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 139 resets, run finished after 829 ms. (steps per millisecond=120 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 141 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 140 resets, run finished after 694 ms. (steps per millisecond=144 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 139 resets, run finished after 684 ms. (steps per millisecond=146 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 694 ms. (steps per millisecond=144 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 136 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 141 resets, run finished after 897 ms. (steps per millisecond=111 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 141 resets, run finished after 740 ms. (steps per millisecond=135 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 142 resets, run finished after 723 ms. (steps per millisecond=138 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 719 ms. (steps per millisecond=139 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 137 resets, run finished after 717 ms. (steps per millisecond=139 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100000 steps, including 137 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 138 resets, run finished after 730 ms. (steps per millisecond=136 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 141 resets, run finished after 745 ms. (steps per millisecond=134 ) properties (out of 44) seen :2
Incomplete Best-First random walk after 100001 steps, including 140 resets, run finished after 748 ms. (steps per millisecond=133 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 143 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 141 resets, run finished after 735 ms. (steps per millisecond=136 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 736 ms. (steps per millisecond=135 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 725 ms. (steps per millisecond=137 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 100001 steps, including 136 resets, run finished after 744 ms. (steps per millisecond=134 ) properties (out of 42) seen :2
Incomplete Best-First random walk after 100001 steps, including 140 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 100001 steps, including 142 resets, run finished after 722 ms. (steps per millisecond=138 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 100001 steps, including 135 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 716 ms. (steps per millisecond=139 ) properties (out of 40) seen :2
Incomplete Best-First random walk after 100001 steps, including 143 resets, run finished after 703 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 137 resets, run finished after 732 ms. (steps per millisecond=136 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
// Phase 1: matrix 9320 rows 550 cols
[2023-03-08 11:00:08] [INFO ] Computed 25 place invariants in 157 ms
[2023-03-08 11:00:09] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-08 11:00:10] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 11:00:23] [INFO ] After 13456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-08 11:00:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-08 11:00:32] [INFO ] After 8727ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2023-03-08 11:00:50] [INFO ] After 26199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 7942 ms.
[2023-03-08 11:00:58] [INFO ] After 48601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Fused 38 Parikh solutions to 24 different solutions.
Parikh walk visited 37 properties in 4636 ms.
Support contains 1 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 9320/9320 transitions.
Graph (complete) has 2540 edges and 550 vertex of which 523 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 8212 transitions
Reduce isomorphic transitions removed 8212 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 8414 rules applied. Total rules applied 8415 place count 523 transition count 902
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 8617 place count 321 transition count 902
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 8617 place count 321 transition count 878
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 8665 place count 297 transition count 878
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 8724 place count 238 transition count 817
Iterating global reduction 2 with 59 rules applied. Total rules applied 8783 place count 238 transition count 817
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 8831 place count 238 transition count 769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8831 place count 238 transition count 765
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 8839 place count 234 transition count 765
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 8842 place count 231 transition count 762
Iterating global reduction 3 with 3 rules applied. Total rules applied 8845 place count 231 transition count 762
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8847 place count 229 transition count 760
Iterating global reduction 3 with 2 rules applied. Total rules applied 8849 place count 229 transition count 760
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8851 place count 227 transition count 758
Iterating global reduction 3 with 2 rules applied. Total rules applied 8853 place count 227 transition count 758
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8854 place count 226 transition count 757
Iterating global reduction 3 with 1 rules applied. Total rules applied 8855 place count 226 transition count 757
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 8975 place count 166 transition count 697
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 8984 place count 166 transition count 688
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 8988 place count 162 transition count 666
Iterating global reduction 4 with 4 rules applied. Total rules applied 8992 place count 162 transition count 666
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8993 place count 161 transition count 665
Iterating global reduction 4 with 1 rules applied. Total rules applied 8994 place count 161 transition count 665
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -151
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 9034 place count 141 transition count 816
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 9043 place count 141 transition count 807
Drop transitions removed 214 transitions
Redundant transition composition rules discarded 214 transitions
Iterating global reduction 5 with 214 rules applied. Total rules applied 9257 place count 141 transition count 593
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 9262 place count 141 transition count 588
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 9295 place count 136 transition count 560
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 9299 place count 132 transition count 532
Iterating global reduction 6 with 4 rules applied. Total rules applied 9303 place count 132 transition count 532
Applied a total of 9303 rules in 174 ms. Remains 132 /550 variables (removed 418) and now considering 532/9320 (removed 8788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 132/550 places, 532/9320 transitions.
Incomplete random walk after 1000000 steps, including 13112 resets, run finished after 3051 ms. (steps per millisecond=327 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1683 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2105125 steps, run timeout after 9001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 2105125 steps, saw 325280 distinct states, run finished after 9003 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:01:15] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
// Phase 1: matrix 256 rows 132 cols
[2023-03-08 11:01:15] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-08 11:01:15] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:15] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-08 11:01:15] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:15] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:16] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:01:16] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 21 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 132/132 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 18 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-08 11:01:16] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:16] [INFO ] Invariant cache hit.
[2023-03-08 11:01:16] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-08 11:01:16] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:16] [INFO ] Invariant cache hit.
[2023-03-08 11:01:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:16] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-08 11:01:16] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-08 11:01:16] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:16] [INFO ] Invariant cache hit.
[2023-03-08 11:01:17] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1150 ms. Remains : 132/132 places, 532/532 transitions.
Incomplete random walk after 100000 steps, including 1311 resets, run finished after 717 ms. (steps per millisecond=139 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:01:17] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:17] [INFO ] Invariant cache hit.
[2023-03-08 11:01:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:18] [INFO ] [Real]Absence check using 3 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-08 11:01:18] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 11:01:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:18] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-08 11:01:18] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:18] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:18] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-08 11:01:18] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:18] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:18] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 11:01:18] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 13055 resets, run finished after 3218 ms. (steps per millisecond=310 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1662 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2100248 steps, run timeout after 9001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 2100248 steps, saw 325267 distinct states, run finished after 9001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:01:31] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:31] [INFO ] Invariant cache hit.
[2023-03-08 11:01:31] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:31] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-08 11:01:31] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:31] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:31] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 11:01:31] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 132/132 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-08 11:01:31] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:31] [INFO ] Invariant cache hit.
[2023-03-08 11:01:31] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-08 11:01:31] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:31] [INFO ] Invariant cache hit.
[2023-03-08 11:01:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:32] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-08 11:01:32] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-08 11:01:32] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:32] [INFO ] Invariant cache hit.
[2023-03-08 11:01:33] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1399 ms. Remains : 132/132 places, 532/532 transitions.
Incomplete random walk after 100000 steps, including 1302 resets, run finished after 407 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:01:33] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:33] [INFO ] Invariant cache hit.
[2023-03-08 11:01:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:33] [INFO ] [Real]Absence check using 3 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-08 11:01:33] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 11:01:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:33] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-08 11:01:33] [INFO ] After 29ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:33] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:33] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-08 11:01:33] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:33] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:33] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 11:01:33] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 131 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648312 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648312 steps, saw 107575 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:01:36] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:36] [INFO ] Invariant cache hit.
[2023-03-08 11:01:36] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:37] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-08 11:01:37] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:37] [INFO ] After 27ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:37] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 11:01:37] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 132/132 places, 532/532 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623383 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623383 steps, saw 104422 distinct states, run finished after 3004 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:01:40] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:40] [INFO ] Invariant cache hit.
[2023-03-08 11:01:40] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:01:40] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-08 11:01:40] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:40] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:40] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 11:01:40] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 132/132 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 532/532 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-08 11:01:40] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:40] [INFO ] Invariant cache hit.
[2023-03-08 11:01:40] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-08 11:01:40] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:40] [INFO ] Invariant cache hit.
[2023-03-08 11:01:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 11:01:41] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-08 11:01:41] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 11:01:41] [INFO ] Flow matrix only has 256 transitions (discarded 276 similar events)
[2023-03-08 11:01:41] [INFO ] Invariant cache hit.
[2023-03-08 11:01:41] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1007 ms. Remains : 132/132 places, 532/532 transitions.
Graph (trivial) has 128 edges and 132 vertex of which 47 / 132 are part of one of the 6 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 67 transitions
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 349 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 80 transition count 165
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 48 place count 62 transition count 165
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 48 place count 62 transition count 155
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 68 place count 52 transition count 155
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 47 transition count 150
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 47 transition count 150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 42 transition count 120
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 42 transition count 120
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 123 place count 42 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 37 transition count 80
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 141 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 153 place count 31 transition count 102
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 201 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 216 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 244 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 252 place count 20 transition count 20
Applied a total of 252 rules in 25 ms. Remains 20 /132 variables (removed 112) and now considering 20/532 (removed 512) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 20 cols
[2023-03-08 11:01:41] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-08 11:01:41] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 11:01:41] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-08 11:01:41] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:41] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 11:01:41] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 128 edges and 132 vertex of which 47 / 132 are part of one of the 6 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 67 transitions
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 349 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 80 transition count 165
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 48 place count 62 transition count 165
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 48 place count 62 transition count 155
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 68 place count 52 transition count 155
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 47 transition count 150
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 47 transition count 150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 42 transition count 120
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 42 transition count 120
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 123 place count 42 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 37 transition count 80
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 141 place count 37 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 153 place count 31 transition count 102
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 201 place count 31 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 216 place count 21 transition count 49
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 244 place count 21 transition count 21
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 20 transition count 20
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 252 place count 20 transition count 20
Applied a total of 252 rules in 24 ms. Remains 20 /132 variables (removed 112) and now considering 20/532 (removed 512) transitions.
Running SMT prover for 1 properties.
[2023-03-08 11:01:41] [INFO ] Invariant cache hit.
[2023-03-08 11:01:41] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:01:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 11:01:41] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-08 11:01:41] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:01:41] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-08 11:01:41] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Unable to solve all queries for examination StableMarking. Remains :1 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 493029 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CloudDeployment (PT), instance 6b
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 1888 places, 6804 transitions, 91831 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 16034972 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16148076 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 StableMarking -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="CloudDeployment-PT-6b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CloudDeployment-PT-6b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-smll-167814408700273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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